Corpus ID: 14868024

Random Hyperbolic Graphs: Degree Sequence and Clustering

@article{Gugelmann2012RandomHG,
  title={Random Hyperbolic Graphs: Degree Sequence and Clustering},
  author={Luca Gugelmann and K. Panagiotou and Ueli Peter},
  journal={ArXiv},
  year={2012},
  volume={abs/1205.1470}
}
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A reasonable model should not only replicate all the structural properties that are observed in real world networks (for example, heavy tailed degree distributions, high clustering and small diameter), but it should also be amenable to mathematical analysis. There are plenty of models that succeed in the first task but are hard to analyze rigorously. On the other hand, a… Expand
Cliques in Hyperbolic Random Graphs
TLDR
This work studies cliques in hyperbolic random graphs G and presents new results on the expected number of k-cliques and the size of the largest clique, and shows that for $$\beta \geqslant 3$$β⩾3, cliques can be computed in time $$\mathcal {O}(n)$$O(n). Expand
Geometric Inhomogeneous Random Graphs
TLDR
A sampling algorithm that generates a random graph from a hyperbolic random graphs model in expected linear time is provided, and it is established that GIRGs have a constant clustering coefficient and are able to compress using an expected linear number of bits. Expand
Fe b 20 16 Geometric Inhomogeneous Random Graphs
Real-world networks, like social networks or the internet infrastructure, have structural properties such as their large clustering coefficient that can best be described in terms of an underlyingExpand
Geometric Inhomogeneous Random Graphs and Graph Coloring Games
TLDR
GIRGs generalize hyperbolic random graphs to higher dimensions and are technically simpler while preserving their qualitative behavior, which serves as benchmarks for network algorithms like routing or link prediction. Expand
Random graphs on the hyperbolic plane
In this thesis, we study a recently proposed model of random graphs that exhibit properties which are present in a wide range of networks arising in real world settings. The model creates randomExpand
Sampling Geometric Inhomogeneous Random Graphs in Linear Time
TLDR
A sampling algorithm is provided that generates a random graph from the model in expected linear time, improving the best-known sampling algorithm for hyperbolic random graphs by a substantial factor O(n^0.5), and fundamental structural and algorithmic results on GIRGs are proved. Expand
Hyperbolic Random Graphs: Separators and Treewidth
TLDR
It is shown that hyperbolic random graphs in fact have comparatively small separators and can be expected to have balanced separator hierarchies with separators of size O(n^{3/2-beta/2}), O(log n), and O(1) if 2 < beta < 3, beta = 3, and 3 < beta, respectively. Expand
Spectral Gap of Random Hyperbolic Graphs and Related Parameters
Random hyperbolic graphs have been suggested as a promising model of social networks. A few of their fundamental parameters have been studied. However, none of them concerns their spectra. WeExpand
Typical distances in a geometric model for complex networks
TLDR
A further property is shown: the distance between two uniformly chosen vertices that belong to the same component is doubly logarithmic in $N$, i.e., the graph is an ~\emph{ultra-small world}. Expand
Cliques in geometric inhomogeneous random graphs
Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geometric inhomogeneousExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Mathematical results on scale‐free random graphs
TLDR
There has been much interest in studying large-scale real-world networks and attempting to model their properties using random graphs, and the work in this field falls very roughly into the following categories. Expand
Popularity based random graph models leading to a scale-free degree sequence
TLDR
Confirming non-rigorous arguments of Dorogovtsev et al. and Drinea et al., this shows that for such a, the proportion P(d) of vertices of degree d almost surely obeys a power law, where P( d) is of the form d-^2^-^a for large d. Expand
The degree sequence of a scale-free random graph process
TLDR
Here the authors obtain P(d) asymptotically for all d≤n1/15, where n is the number of vertices, proving as a consequence that γ=3.9±0.1 is obtained. Expand
Affiliation networks
TLDR
This paper presents the first model that provides a simple, realistic, and mathematically tractable generative model that intrinsically explains all the well-known properties of the social networks, as well as densification and shrinking diameter. Expand
Graphs over time: densification laws, shrinking diameters and possible explanations
TLDR
A new graph generator is provided, based on a "forest fire" spreading process, that has a simple, intuitive justification, requires very few parameters (like the "flammability" of nodes), and produces graphs exhibiting the full range of properties observed both in prior work and in the present study. Expand
Random evolution in massive graphs
TLDR
This paper gives three increasingly general directed graph models and one general undirected graph model for generating power law graphs by adding at most one node and possibly one or more edges at a time and describes a method for scaling the time in the evolution model such that the power law of the degree sequences remains invariant. Expand
Hyperbolic Geometry of Complex Networks
TLDR
It is shown that targeted transport processes without global topology knowledge are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure. Expand
Clustering in complex networks. I. General formalism.
  • M. Serrano, M. Boguñá
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge that extends the clustering coefficient in that it involves the properties of two- and not just one-vertices. Expand
First to market is not everything: an analysis of preferential attachment with fitness
TLDR
A rigorous analysis of preferential attachment with fitness, suggested by Bianconi and Barabási and studied by Motwani and Xu, in which the degree of a vertex is scaled by its quality to determine its attractiveness. Expand
Collective dynamics of ‘small-world’ networks
TLDR
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand
...
1
2
3
4
...