Papers › The Topological Behavior of Preferential Attachment Graphs
The Topological Behavior of Preferential Attachment Graphs
Chunyin Siu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We investigate the higher-order connectivity of scale-free networks using algebraic topology. We model scale-free networks as preferential attachment graphs, and we study the algebraic-topological properties of their clique complexes. We focus on the Betti numbers and the homotopy-connectedness of these complexes. We determine the asymptotic almost sure orders of magnitude of the Betti numbers. We also establish the occurence of homotopical phase transitions for the infinite complexes, and we determine the critical thresholds at which the homotopy-connectivity changes. This partially verifies Weinberger's conjecture on the homotopy type of the infinite complexes. We conjecture that the mean-normalized Betti numbers converge to power-law distributions, and we present numerical evidence. Our results also highlight the subtlety of the scaling limit of topology, which arises from the tension between topological operations and analytical limiting process. We discuss such tension at the end of the Introduction.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections