Justifying the small-world phenomenon via random recursive trees

DOI10.1002/rsa.20648zbMath1359.05031arXiv1410.6397OpenAlexW2963880450MaRDI QIDQ2977566

Abbas Mehrabian

Publication date: 18 April 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.6397

zbMATH Keywords

preferential attachmentrandom recursive treessmall-world phenomenondiameters of random graphs

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)

Cites Work

• Scale free properties of random \(k\)-trees
• A preferential attachment model with random initial degrees
• The diameter of protean graphs
• Diameters in preferential attachment models
• The degree distribution of random \(k\)-trees
• The diameter of a scale-free random graph
• Degree distribution of the FKP network model
• Degrees and distances in random and evolving apollonian networks
• The small-community phenomenon in networks
• It's a Small World for Random Surfers
• Statistical mechanics of complex networks
• High-dimensional Apollonian networks
• Using PageRank to Characterize Web Structure
• Spatial Models for Virtual Networks
• A Geometric Preferential Attachment Model of Networks II
• A survey of gossiping and broadcasting in communication networks
• Note on the heights of random recursive trees and random m‐ary search trees
• Distance in the Forest Fire Model How far are you from Eve?
• Coupling Online and Offline Analyses for Random Power Law Graphs
• Random Deletion in a Scale-Free Random Graph Process
• Deeper Inside PageRank
• A general model of web graphs
• The height of random k‐trees and related branching processes
• On longest paths and diameter in random apollonian networks
• The phase transition in inhomogeneous random graphs
• Ancestors and descendants in evolving k‐tree models
• Networks