Cliques in high-dimensional geometric inhomogeneous random graphs

DOI10.1137/23M157394XMaRDI QIDQ6572998zbMATH OpenFDO

Authors Tobias Friedrich, Andreas Göbel, Maximilian Katzmann, Leon Schiller

Publication date 16 July 2024

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

geometrydimensionalityclique numberrandom graphscliquesscale-free networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• A Random Graph Model for Power Law Graphs
• A multivariate Berry-Esseen theorem with explicit constants
• Bootstrap percolation on geometric inhomogeneous random graphs
• Cliques in geometric inhomogeneous random graphs
• Cliques in hyperbolic random graphs
• Clustering in a hyperbolic model of complex networks
• Collective dynamics of `small-world' networks
• Connected components in random graphs with given expected degree sequences
• High-dimensional random geometric graphs and their clique number
• How rare are power-law networks really?
• Large cliques in a power-law random graph
• Law of large numbers for the largest component in a hyperbolic model of complex networks
• On the diameter of hyperbolic random graphs
• Optimal subgraph structures in scale-free configuration models
• Random Geometric Graphs
• Random Graphs
• Random hyperbolic graphs: degree sequence and clustering (extended abstract)
• Simplicial homology of random configurations
• The average distances in random graphs with given expected degrees
• True scale-free networks hidden by finite size effects

This page was built for publication: Cliques in high-dimensional geometric inhomogeneous random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572998)