Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
From MaRDI portal
Publication:2301480
DOI10.1016/j.spa.2019.04.014zbMath1440.60011arXiv1803.04897MaRDI QIDQ2301480
Publication date: 24 February 2020
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04897
inhomogeneity; power law; first passage percolation; explosion; random geometric graphs; hyperbolic random graphs; typical distances
05C80: Random graphs (graph-theoretic aspects)
90B15: Stochastic network models in operations research
60C05: Combinatorial probability
Related Items
Scale-free percolation in continuous space: quenched degree and clustering coefficient, The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects, Local limits of spatial inhomogeneous random graphs, A continuous-time network evolution model describing 3-interactions, Scaling of the clustering function in spatial inhomogeneous random graphs, Scale-free percolation mixing time, On the largest component of subcritical random hyperbolic graphs, Phase transitions and percolation at criticality in enhanced random connection models, Greedy routing and the algorithmic small-world phenomenon, Penalising transmission to hubs in scale-free spatial random graphs, Recurrence versus transience for weight-dependent random connection models, Long paths in first passage percolation on the complete graph II. Global branching dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short paths for first passage percolation on the complete graph
- Scale-free percolation
- On explosions in heavy-tailed branching random walks
- On the largest component of a hyperbolic model of complex networks
- From heavy-tailed Boolean models to scale-free Gilbert graphs
- Generating simple random graphs with prescribed degree distribution
- Bootstrap percolation and the geometry of complex networks
- Diameters in preferential attachment models
- General branching processes as Markov fields
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Structures in supercritical scale-free percolation
- Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Weighted distances in scale-free configuration models
- On the scaling of the chemical distance in long-range percolation models
- Connected components in random graphs with given expected degree sequences
- First passage percolation on random graphs with finite mean degrees
- Scale-free percolation in continuum space
- Spatial preferential attachment networks: power laws and clustering coefficients
- Universality for first passage percolation on sparse random graphs
- Distances in random graphs with finite mean and infinite variance degrees
- On age-dependent binary branching processes
- FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
- Random Graphs and Complex Networks
- Some Typical Properties of the Spatial Preferred Attachment Model
- How Clustering Affects Epidemics in Random Networks
- Asymptotic equivalence and contiguity of some random graphs
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- First Passage Percolation on the Erdős–Rényi Random Graph
- Random Hyperbolic Graphs: Degree Sequence and Clustering
- Typical distances in a geometric model for complex networks
- The simple branching process: a note on convergence when the mean is infinite
- The Structure and Function of Complex Networks
- Bootstrap percolation on geometric inhomogeneous random graphs
- Nonuniversality of weighted random graphs with infinite variance degree
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Continuum Percolation
- Sharp asymptotic for the chemical distance in long‐range percolation
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- The diameter of KPKVB random graphs
- First Passage Percolation on Inhomogeneous Random Graphs
- The phase transition in inhomogeneous random graphs
- Distances in random graphs with finite variance degrees
- Collective dynamics of ‘small-world’ networks
- A Spatial Web Graph Model with Local Influence Regions
- The average distances in random graphs with given expected degrees
- On a conditionally Poissonian graph process
- Ultra-small scale-free geometric networks