When is a scale-free graph ultra-small?

DOI10.1007/s10955-017-1864-1zbMath1386.60041arXiv1611.03639OpenAlexW3100954726WikidataQ59512957 ScholiaQ59512957MaRDI QIDQ1685487

Júlia Komjáthy, Remco van der Hofstad

Publication date: 14 December 2017

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

random networksconfiguration modelscale freetypical distancessmall world propertytruncated power law degrees

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Combinatorial probability (60C05)

Related Items

Long paths in first passage percolation on the complete graph II. Global branching dynamics, Diameter in ultra‐small scale‐free random graphs, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, Weighted distances in scale-free configuration models, Penalising transmission to hubs in scale-free spatial random graphs, Linking the mixing times of random walks on static and dynamic random graphs, Sampling Geometric Inhomogeneous Random Graphs in Linear Time, Limit laws for self-loops and multiple edges in the configuration model

Uses Software

• plfit

Cites Work

• Unnamed Item
• Unnamed Item
• Vulnerability of robust preferential attachment networks
• Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
• Enumeration of graphs with a heavy-tailed degree sequence
• Diameters in preferential attachment models
• Phase transitions in social networks
• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Metric structure of random networks
• First passage percolation on random graphs with finite mean degrees
• Universality for first passage percolation on sparse random graphs
• Distances in random graphs with finite mean and infinite variance degrees
• From the Cover: The structure of scientific collaboration networks
• Random Graphs and Complex Networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Attack Resistance of Power-Law Random Graphs in the Finite-Mean, Infinite-Variance Region
• FERROMAGNETIC FLUID AS A MODEL OF SOCIAL IMPACT
• A new approach to the giant component problem
• Power-Law Distributions in Empirical Data
• Regularly varying functions in the theory of simple branching processes
• The simple branching process: a note on convergence when the mean is infinite
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• The Average Distance in a Random Graph with Given Expected Degrees
• A critical point for random graphs with a given degree sequence
• Distances in random graphs with finite variance degrees
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks
• Critical Window for Connectivity in the Configuration Model
• The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles
• The diameter of sparse random graphs
• On a conditionally Poissonian graph process
• The simple branching process with infinite mean. I
• The diameter of sparse random graphs