High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
From MaRDI portal
Publication:5700145
DOI10.1080/15427951.2005.10129097zbMath1077.05091OpenAlexW2624048597MaRDI QIDQ5700145
Abraham D. Flaxman, Alan M. Frieze, Trevor I. Fenner
Publication date: 27 October 2005
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2005.10129097
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ Upperbounds on the probability of finding marked connected components using quantum walks ⋮ Social network formation and strategic interaction in large networks ⋮ Rumor spreading in social networks ⋮ Spectra of large random trees ⋮ Expansion and Lack Thereof in Randomly Perturbed Graphs ⋮ Some Properties of Random Apollonian Networks
This page was built for publication: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph