Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs (Q2301480): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Typical distances in a geometric model for complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted distances in scale-free configuration models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spatial Web Graph Model with Local Influence Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On explosions in heavy-tailed branching random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniversality of weighted random graphs with infinite variance degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight fluctuations of weight-distances in random graphs with infinite-variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On age-dependent binary branching processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Passage Percolation on the Erdős–Rényi Random Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality for first passage percolation on sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First passage percolation on random graphs with finite mean degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the scaling of the chemical distance in long-range percolation models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp asymptotic for the chemical distance in long‐range percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the largest component of a hyperbolic model of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Geometric Inhomogeneous Random Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating simple random graphs with prescribed degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap percolation and the geometry of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Typical Properties of the Spatial Preferred Attachment Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Clustering Affects Epidemics in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple branching process: a note on convergence when the mean is infinite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-free percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scale-free percolation in continuum space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short paths for first passage percolation on the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Law of large numbers for the largest component in a hyperbolic model of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Hyperbolic Graphs: Degree Sequence and Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structures in supercritical scale-free percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: From heavy-tailed Boolean models to scale-free Gilbert graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs and Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in random graphs with finite variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in random graphs with finite mean and infinite variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spatial preferential attachment networks: power laws and clustering coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: General branching processes as Markov fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: One, Two and Three Times log <i>n</i>/<i>n</i> for Paths in a Complete Graph with Random Weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic equivalence and contiguity of some random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bootstrap percolation on geometric inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: First Passage Percolation on Inhomogeneous Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuum Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of KPKVB random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conditionally Poissonian graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultra-small scale-free geometric networks / rank
 
Normal rank

Latest revision as of 21:29, 21 July 2024

scientific article
Language Label Description Also known as
English
Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
scientific article

    Statements

    Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs (English)
    0 references
    0 references
    0 references
    24 February 2020
    0 references
    This paper derives distributional results on weighted distances in the so-called geometric inhomogeneous random graphs. This is a model that was introduced recently by \textit{K. Bringmann} et al. [``Average distance in a general class of scale-free networks with underlying geometry'', Preprint, \url{arXiv:1602.05712}]. There, a random graph is formed on a set of \(n\) points that are distributed according to some measure on a metric space. Furthermore, these points have weights which i.i.d. random variables. The probability that two of them are joined by an edge is a function of their distance in the underlying space as well as of their weights. In particular, it is proportional to the product of their weights. Also, the collection of the corresponding events for all pairs of point forms an independent family. In this paper, the weights are assumed to follow a power law distribution. In the usual set-up of first passage percolation, the edges are assumed to have i.i.d. weights sampled from some distribution \(L\) and the weighted distances (or \(L\)-distances) between vertices are considered. Specifically, the random variable that is considered is the explosion time. Roughly speaking, this is the smallest distance \(t\) around a certain vertex where the ball of weighted distance at most \(t\) becomes infinite. The authors show that if the vertex weights have finite second moment, then explosion does not occur. If the power law has exponent between 2 and 3 (that is, infinite second moment), they give a condition on \(L\) which characterises the occurrence of explosion. Furthermore, if explosion occurs, they show that the \(L\)-distance of two randomly selected vertices converges in distribution to the sum of two i.i.d. random variables distributed as the explosion time around a random vertex conditioned on being finite. Analogous results are shown in the context of scale-free percolation on \(\mathbb{Z}^d\) in which the underlying graph is formed by joining non-nearest neighbours of \(\mathbb{Z}^d\) with probability that depends on their distance in \(\mathbb{Z}^d\) and the product of their weights. Again, the vertices are assumed to have i.i.d. weight that follow a power law and edges have i.i.d. weights sampled from a distribution \(L\). A distributional result as above is derived when the condition that yields explosion holds.
    0 references
    random geometric graphs
    0 references
    hyperbolic random graphs
    0 references
    inhomogeneity
    0 references
    power law
    0 references
    explosion
    0 references
    first passage percolation
    0 references
    typical distances
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references