Distance in random graphs with infinite mean degrees
From MaRDI portal
Publication:881401
DOI10.1007/s10687-006-7963-zzbMath1120.05086OpenAlexW2169534116MaRDI QIDQ881401
Dmitri Znamenski, Henri Van Den Esker, Gerard Hooghiemstra, Remco van der Hofstad
Publication date: 29 May 2007
Published in: Extremes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10687-006-7963-z
Random graphs (graph-theoretic aspects) (05C80) Extreme value theory; extremal stochastic processes (60G70) Combinatorial probability (60C05)
Related Items
Typical distances in the directed configuration model, Distance in random graphs with infinite mean degrees, Branching random walk with infinite progeny mean: a tale of two tails, Local limits of spatial inhomogeneous random graphs, Weak disorder asymptotics in the stochastic mean-field model of distance, The winner takes it all but one, First passage percolation on random graphs with finite mean degrees, How to determine if a random graph with a fixed degree sequence has a giant component, The Diameter of Sparse Random Graphs, Universality for the distance in finite variance random graphs, Weighted distances in scale-free configuration models, Diameters in preferential attachment models, Contact processes on random graphs with power law degree distributions have critical value 0, Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks, Large Cliques in a Power-Law Random Graph, Universality for distances in power-law random graphs, On a conditionally Poissonian graph process, Generating stationary random graphs on ℤ with prescribed independent, identically distributed degrees, Graph Embedding through Random Walk for Shortest Paths Problems, Jigsaw percolation: what social networks can collaboratively solve a puzzle?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distance in random graphs with infinite mean degrees
- Convergence to a stable distribution via order statistics
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Connected components in random graphs with given expected degree sequences
- Distances in random graphs with finite mean and infinite variance degrees
- A Random Graph Model for Power Law Graphs
- Statistical mechanics of complex networks
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- The Structure and Function of Complex Networks
- A critical point for random graphs with a given degree sequence
- Distances in random graphs with finite variance degrees
- Exploring complex networks
- The average distances in random graphs with given expected degrees
