On the largest component of a hyperbolic model of complex networks
Summary: We consider a model for complex networks that was introduced by \textit{D. Krioukov} et al. [``Hyperbolic geometry of complex networks, Phys. Rev. E 82, 036106 (2010; \url{doi:10.1103/PhysRevE.82.036106})]. In this model, \(N\) points are chosen randomly inside a disk on the hyperbolic plane and any two of them are joined by an edge if they are within a certain hyperbolic distance. The \(N\) points are distributed according to a \textit{quasi-uniform} distribution, which is a distorted version of the uniform distribution. The model turns out to behave similarly to the well-known Chung-Lu model, but without the independence between the edges. Namely, it exhibits a power-law degree sequence and small distances but, unlike the Chung-Lu model and many other well-known models for complex networks, it also exhibits clustering. The model is controlled by two parameters \(\alpha\) and \(\nu\) where, roughly speaking, \(\alpha\) controls the exponent of the power-law and \(\nu\) controls the average degree. The present paper focuses on the evolution of the component structure of the random graph. We show that (a) for \(\alpha > 1\) and \(\nu\) arbitrary, with high probability, as the number of vertices grows, the largest component of the random graph has sublinear order; (b) for \(\alpha < 1\) and \(\nu\) arbitrary with high probability there is a ``giant component of linear order, and (c) when \(\alpha=1\) then there is a non-trivial phase transition for the existence of a linear-sized component in terms of \(\nu\).
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- The probability of connectivity in a hyperbolic model of complex networks
- An almost-solvable model of complex network dynamics
- Generalized Hausdorff dimensions of a complex network
- Clustering in a hyperbolic model of complex networks
- Complex networks modeled on the Sierpinski gasket
- Universality for critical heavy-tailed network models: metric structure of maximal components
- On the largest component of subcritical random hyperbolic graphs
- Complexity and irreducibility of dynamics on networks of networks
- Spectral gap of random hyperbolic graphs and related parameters
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- The contact process on random hyperbolic graphs: metastability and critical exponents
- Limit theory for isolated and extreme points in hyperbolic random geometric graphs
- Clustering in a hyperbolic model of complex networks
- On the largest component of subcritical random hyperbolic graphs
- Penalising transmission to hubs in scale-free spatial random graphs
- Not all interventions are equal for the height of the second peak
- Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting)
- Recurrence versus transience for weight-dependent random connection models
- Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs
- The probability of connectivity in a hyperbolic model of complex networks
- Typical distances in a geometric model for complex networks
- On a geometrization of the Chung-Lu model for complex networks
- Assortativity and Bidegree Distributions on Bernoulli Random Graph Superpositions
- Assortativity and bidegree distributions on Bernoulli random graph superpositions
- Sub-tree counts on hyperbolic random geometric graphs
- Scale-free network clustering in hyperbolic and other random graphs
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- The diameter of KPKVB random graphs
- Degree correlations in scale-free random graph models
- On the second largest component of random hyperbolic graphs
- The emergence of a giant component in one-dimensional inhomogeneous networks with long-range effects
- Clustering and percolation on superpositions of Bernoulli random graphs
- Intersections of Poisson \(k\)-flats in constant curvature spaces
- Large nearest neighbour balls in hyperbolic stochastic geometry
- Cover and hitting times of hyperbolic random graphs
- A quadtree, a Steiner spanner, and approximate nearest neighbours in hyperbolic space
- Finiteness of the percolation threshold for inhomogeneous long-range models in one dimension
- Hamilton cycles and perfect matchings in the KPKVB model
- Bootstrap percolation and the geometry of complex networks
This page was built for publication: On the largest component of a hyperbolic model of complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490412)
