Diameters in preferential attachment models
From MaRDI portal
Publication:967660
DOI10.1007/s10955-010-9921-zzbMath1191.82020arXiv0705.4153OpenAlexW2157921649MaRDI QIDQ967660
Remco van der Hofstad, Gerard Hooghiemstra, Sander Dommers
Publication date: 30 April 2010
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0705.4153
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items
Not all interventions are equal for the height of the second peak, On the Diameter of Hyperbolic Random Graphs, Typical Distances in Ultrasmall Random Networks, On the Diameter of Hyperbolic Random Graphs, A preferential attachment model with random initial degrees, Scale-free network clustering in hyperbolic and other random graphs, It's a small world for random surfers, Large communities in a scale-free network, Scale-free percolation, Local weak convergence for PageRank, When is a scale-free graph ultra-small?, Chemical distance in geometric random graphs with long edges and scale-free degree distribution, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Random networks with sublinear preferential attachment: the giant component, Justifying the small-world phenomenon via random recursive trees, First passage percolation on random graphs with finite mean degrees, Diameter in ultra‐small scale‐free random graphs, First-Order Model-Checking in Random Graphs and Complex Networks, The idemetric property: when most distances are (almost) the same, Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size, Subgraphs in preferential attachment models, The age-dependent random connection model, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, Metastability for the contact process on the preferential attachment graph, Typical distances in a geometric model for complex networks, A Theory of Network Security: Principles of Natural Selection and Combinatorics, Distance evolutions in growing preferential attachment graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence properties of the degree distribution of some growing network models
- A preferential attachment model with random initial degrees
- Distance in random graphs with infinite mean degrees
- Universality for the distance in finite variance random graphs
- The diameter of a scale-free random graph
- Distances in random graphs with finite mean and infinite variance degrees
- The degree sequence of a scale-free random graph process
- Random Graphs and Complex Networks
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The degree sequences and spectra of scale-free random graphs
- A Phase Transition for the Diameter of the Configuration Model
- Note on the heights of random recursive trees and random m‐ary search trees
- The Structure and Function of Complex Networks
- On random trees
- Coupling Scale-Free and Classical Random Graphs
- Coupling Online and Offline Analyses for Random Power Law Graphs
- Robustness and Vulnerability of Scale-Free Random Graphs
- The Average Distance in a Random Graph with Given Expected Degrees
- The Maximum Degree of the Barabási–Albert Random Tree
- A general model of web graphs
- Connectivity Transitions in Networks with Super-Linear Preferential Attachment
- The phase transition in inhomogeneous random graphs
- Distances in random graphs with finite variance degrees
- Random trees and general branching processes
- The diameter of sparse random graphs
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
