High Degree Vertices and Eigenvalues in the Preferential Attachment Graph

DOI10.1080/15427951.2005.10129097MaRDI QIDQ5700145zbMATH OpenOpenAlexFDO

Authors Abraham D. Flaxman, Alan Frieze, T. 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

zbMATH Keywords

adjacency matrixeigenvaluesrandom graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• High degree vertices and eigenvalues in the preferential attachment graph
• Vertices of high degree in the preferential attachment tree
• Vertex-connectivity and eigenvalues of graphs
• Eigenvalues and extremal degrees of graphs
• Eigenvalues and degree deviation in graphs
• Degree sequences of geometric preferential attachment graphs
• Eigenvalues and the degree sequences of graphs
• On the dense preferential attachment graph models and their graphon induced counterpart
• Degree asymptotics with rates for preferential attachment random graphs
• Joint degree distributions of preferential attachment random graphs

Cited in

(14)

• Social network formation and strategic interaction in large networks
• Upperbounds on the probability of finding marked connected components using quantum walks
• A fast algorithm to find all high degree vertices in graphs with a power law degree sequence
• Vertices of high degree in the preferential attachment tree
• Some properties of random Apollonian networks
• Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
• Rumor spreading in social networks
• Expansion and Lack Thereof in Randomly Perturbed Graphs
• High degree vertices and eigenvalues in the preferential attachment graph
• On Bollobás‐Riordan random pairing model of preferential attachment graph
• Fractal networks: topology, dimension, and complexity
• A new model for preferential attachment scheme with time-varying parameters
• The spectral barycentre of a set of graphs with community structure
• Spectra of large random trees

This page was built for publication: High Degree Vertices and Eigenvalues in the Preferential Attachment Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5700145)