Scale-free percolation

DOI10.1214/12-AIHP480MaRDI QIDQ372568zbMATHFDO

Authors Maria Deijfen, Remco van der Hofstad, Gerard Hooghiemstra

Publication date 9 October 2013

Published in Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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

zbMATH Keywords

phase transitionrandom graphsdegree distributiongraph distancelong-range percolationchemical distancepercolation in random environment

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We formulate and study a model for inhomogeneous long-range percolation on $$. Each vertex $$ is assigned a non-negative weight $W_x$, where $$ are i.i.d. random variables. Conditionally on the weights, and given two parameters $alpha,lambda>0$, the edges are independent and the probability that there is an edge between $x$ and $y$ is given by $p_{xy}=1-exp-lambda{W}_x{W}_y/|x-y{|}^{a}lpha$. The parameter $lambda$ is the percolation parameter, while $alpha$ describes the long-range nature of the model. We focus on the degree distribution in the resulting graph, on whether there exists an infinite component and on graph distance between remote pairs of vertices. First, we show that the tail behavior of the degree distribution is related to the tail behavior of the weight distribution. When the tail of the distribution of $W_x$ is regularly varying with exponent $au-1$, then the tail of the degree distribution is regularly varying with exponent $gamma=alpha(au-1)/d$. The parameter $gamma$ turns out to be crucial for the behavior of the model. Conditions on the weight distribution and $gamma$ are formulated for the existence of a critical value $lambd{a}_{c}in(0,infty)$ such that the graph contains an infinite component when $lambda>lambd{a}_c$ and no infinite component when $lambda<lambd{a}_c$. Furthermore, a phase transition is established for the graph distances between vertices in the infinite component at the point $gamma=2$, that is, at the point where the degrees switch from having finite to infinite second moment. The model can be viewed as an interpolation between long-range percolation and models for inhomogeneous random graphs, and we show that the behavior shares the interesting features of both these models.

Recommendations

• Multi-type directed scale-free percolation
• Inhomogeneous long-range percolation on the hierarchical lattice
• Structures in supercritical scale-free percolation
• Percolation phase transition in weight-dependent random connection models
• Graph distances in scale-free percolation: the logarithmic case

Cites work

• scientific article; zbMATH DE number 4000257 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Asymptotic equivalence and contiguity of some random graphs
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Connected components in random graphs with given expected degree sequences
• Continuum Percolation
• Critical behavior in inhomogeneous random graphs
• Critical percolation in the plane: Conformal invariance, Cardy's formula, scaling limits
• Diameters in preferential attachment models
• Discontinuity of the percolation density in one dimensional \(1/| x- y| ^ 2\) percolation models
• Distances in random graphs with finite mean and infinite variance degrees
• Distances in random graphs with finite variance degrees
• Domination by product measures
• Generating simple random graphs with prescribed degree distribution
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• Mean-field behavior for long- and finite range Ising model, percolation and self-avoiding walk
• Novel scaling limits for critical inhomogeneous random graphs
• On a conditionally Poissonian graph process
• On the scaling of the chemical distance in long-range percolation models
• One dimensional \(1/| j-i| ^ s\) percolation models: The existence of a transition for s\(\leq 2\)
• Percolation
• Scaling limits for critical inhomogeneous random graphs with finite third moments
• The average distances in random graphs with given expected degrees
• The diameter of a long-range percolation graph
• The phase transition in inhomogeneous random graphs
• The scaling window for a random graph with a given degree sequence
• Transience, recurrence and critical behavior for long-range percolation
• Ultra-small scale-free geometric networks
• Uniqueness of the infinite component in a random graph with applications to percolation and spin glasses

Cited in

(50)

• Polynomial growth in degree-dependent first passage percolation on spatial random graphs
• Arithmetic oscillations of the chemical distance in long-range percolation on \(\mathbb{Z}^d\)
• Branching processes and homogenization for epidemics on spatial random graphs
• Graph distances in scale-free percolation: the logarithmic case
• The diameter of a long-range percolation cluster on generalized pre-Sierpinski carpet and regular tree
• Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
• Scale-free percolation in continuum space
• Recurrence versus transience for weight-dependent random connection models
• Not all interventions are equal for the height of the second peak
• The age-dependent random connection model
• Cluster-size decay in supercritical long-range percolation
• Poisson approximation and connectivity in a scale-free random connection model
• Phase transition in random distance graphs on the torus
• Sampling geometric inhomogeneous random graphs in linear time
• Chemical distance in geometric random graphs with long edges and scale-free degree distribution
• The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
• Scale-free percolation in continuous space: quenched degree and clustering coefficient
• Cover and hitting times of hyperbolic random graphs
• On the second largest component of random hyperbolic graphs
• Weighted distances in scale-free configuration models
• Spatial Gibbs random graphs
• Spectral gap of random hyperbolic graphs and related parameters
• Penalising transmission to hubs in scale-free spatial random graphs
• Scale-free percolation mixing time
• Ultra-small scale-free geometric networks
• Branching random walk with infinite progeny mean: a tale of two tails
• SIR epidemics on a scale-free spatial nested modular network
• Inhomogeneous long-range percolation on the hierarchical lattice
• The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
• Recurrence and transience of symmetric random walks with long-range jumps
• Geometric random intersection graphs with general connection probabilities
• On the uniqueness of Gibbs distributions with a non-negative and subcritical pair potential
• Multi-type directed scale-free percolation
• Inhomogeneous long-range percolation in the weak decay regime
• On the scaling of the chemical distance in long-range percolation models
• On connectivity in random graph models with limited dependencies
• Structures in supercritical scale-free percolation
• Greedy routing and the algorithmic small-world phenomenon
• Graph distances of continuum long-range percolation
• Local limits of spatial inhomogeneous random graphs
• The contact process on random hyperbolic graphs: metastability and critical exponents
• Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
• Detecting a botnet in a network
• Large degrees in scale-free inhomogeneous random graphs
• Geometric inhomogeneous random graphs
• Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
• A percolation system with extremely long range connections and node dilution
• Percolation phase transition in weight-dependent random connection models
• Phase transitions and percolation at criticality in enhanced random connection models
• Transience versus recurrence for scale-free spatial networks

This page was built for publication: Scale-free percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372568)