A recursive graph-merging algorithm produces networks with extreme topological properties that their degree sequences do not predict.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.soc-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Historical Contingencies Steer the Topology of Randomly Assembled Graphs
A recursive graph-merging algorithm produces networks with extreme topological properties that their degree sequences do not predict.