Cliques in high-dimensional geometric inhomogeneous random graphs
From MaRDI portal
Publication:6572998
DOI10.1137/23M157394XMaRDI QIDQ6572998FDOQ6572998
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)
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
- Random Geometric Graphs
- A multivariate Berry-Esseen theorem with explicit constants
- Title not available (Why is that?)
- Random Graphs
- Collective dynamics of `small-world' networks
- Connected components in random graphs with given expected degree sequences
- Simplicial homology of random configurations
- The average distances in random graphs with given expected degrees
- Clustering in a hyperbolic model of complex networks
- A Random Graph Model for Power Law Graphs
- On the diameter of hyperbolic random graphs
- High-dimensional random geometric graphs and their clique number
- Large cliques in a power-law random graph
- Law of large numbers for the largest component in a hyperbolic model of complex networks
- Random hyperbolic graphs: degree sequence and clustering (extended abstract)
- Cliques in geometric inhomogeneous random graphs
- Cliques in hyperbolic random graphs
- True scale-free networks hidden by finite size effects
- Bootstrap percolation on geometric inhomogeneous random graphs
- Optimal subgraph structures in scale-free configuration models
- How rare are power-law networks really?
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)
