Cliques in hyperbolic random graphs

DOI10.1007/s00453-017-0323-3zbMath1391.05234OpenAlexW2616752024MaRDI QIDQ724237

Anton Krohmer, Thomas Bläsius, Tobias Friedrich

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

zbMATH Keywords

random graphssocial networkscliquesscale-free networkshyperbolic random graphs

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Sub-tree counts on hyperbolic random geometric graphs ⋮ On the distances within cliques in a soft random geometric graph ⋮ Geometric inhomogeneous random graphs ⋮ Optimal subgraph structures in scale-free configuration models ⋮ Limit theorems for network dependent random variables ⋮ Limit theory for isolated and extreme points in hyperbolic random geometric graphs ⋮ Clustering in a hyperbolic model of complex networks ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ On the largest component of subcritical random hyperbolic graphs ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time

Uses Software

• SNAP

Cites Work

• Unnamed Item
• Bootstrap percolation and the geometry of complex networks
• Unit disk graphs
• Polynomials with real zeros and Pólya frequency sequences
• Graph Theory
• Clustering and the Hyperbolic Geometry of Complex Networks
• Large Cliques in a Power-Law Random Graph
• Emergence of Scaling in Random Networks
• Random Hyperbolic Graphs: Degree Sequence and Clustering
• A random graph model for massive graphs
• The Structure and Function of Complex Networks
• Random Geometric Graphs
• On a geometrization of the Chung–Lu model for complex networks
• Parameterized Clique on Scale-Free Networks
• On a conditionally Poissonian graph process
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Cliques in hyperbolic random graphs