Cliques in rank-1 random graphs: the role of inhomogeneity
From MaRDI portal
Publication:2278662
DOI10.3150/19-BEJ1125zbMath1439.05202arXiv1805.01688MaRDI QIDQ2278662
Remco van der Hofstad, Rui M. Castro, Kay Bogerd
Publication date: 5 December 2019
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.01688
Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)
Related Items (2)
Weakly interacting oscillators on dense random graphs ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs
Cites Work
- Generating simple random graphs with prescribed degree distribution
- Number of cliques in random scale-free network ensembles
- Limits of dense graph sequences
- Community detection in sparse random networks
- On the Lambert \(w\) function
- Connected components in random graphs with given expected degree sequences
- Parameterized clique on inhomogeneous random graphs
- Community detection in dense random networks
- Random Graphs and Complex Networks
- Connectivity of inhomogeneous random graphs
- Large Cliques in a Power-Law Random Graph
- The Volume of the Giant Component of a Random Graph with Given Expected Degrees
- On colouring random graphs
- The Average Distance in a Random Graph with Given Expected Degrees
- The diameter of inhomogeneous random graphs
- Finding and certifying a large hidden clique in a semirandom graph
- Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs
- The phase transition in inhomogeneous random graphs
- Cliques in dense inhomogeneous random graphs
- Finding Hidden Cliques in Linear Time with High Probability
- On a conditionally Poissonian graph process
- Unnamed Item
- Unnamed Item
This page was built for publication: Cliques in rank-1 random graphs: the role of inhomogeneity
