Cliques in hyperbolic random graphs
DOI10.1007/S00453-017-0323-3zbMATH Open1391.05234OpenAlexW2616752024MaRDI QIDQ724237FDOQ724237
Authors: Thomas Bläsius, Tobias Friedrich, Anton Krohmer 
Publication date: 25 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0323-3
Recommendations
- Cliques in random graphs
- Cliques in geometric inhomogeneous random graphs
- Cliques in dense inhomogeneous random graphs
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- scientific article; zbMATH DE number 3634258
- High-dimensional random geometric graphs and their clique number
- Parameterized clique on inhomogeneous random graphs
- Asymptotics for cliques in scale-free random graphs
- scientific article; zbMATH DE number 1735728
- On the hyperbolicity of random graphs
Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Random Geometric Graphs
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Unit disk graphs
- On a conditionally Poissonian graph process
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Title not available (Why is that?)
- Polynomials with real zeros and Pólya frequency sequences
- Concentration of Measure for the Analysis of Randomized Algorithms
- Graph theory
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- A random graph model for massive graphs
- Large cliques in a power-law random graph
- Parameterized Clique on Scale-Free Networks
- Clustering and the hyperbolic geometry of complex networks
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- On a geometrization of the Chung-Lu model for complex networks
- Bootstrap percolation and the geometry of complex networks
Cited In (19)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- Limit theorems for network dependent random variables
- On the largest component of subcritical random hyperbolic graphs
- Cliques in high-dimensional geometric inhomogeneous random graphs
- Parameterized clique on inhomogeneous random graphs
- Cliques in geometric inhomogeneous random graphs
- Optimal subgraph structures in scale-free configuration models
- Limit theory for isolated and extreme points in hyperbolic random geometric graphs
- Geometric inhomogeneous random graphs
- Superlogarithmic cliques in dense inhomogeneous random graphs
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- Cliques in rank-1 random graphs: the role of inhomogeneity
- Large cliques in a power-law random graph
- Sub-tree counts on hyperbolic random geometric graphs
- Sampling geometric inhomogeneous random graphs in linear time
- Clustering in a hyperbolic model of complex networks
- Scale-free network clustering in hyperbolic and other random graphs
- Hyperbolic random graphs: separators and treewidth
- On the distances within cliques in a soft random geometric graph
Uses Software
This page was built for publication: Cliques in hyperbolic random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724237)
