On the distances within cliques in a soft random geometric graph
From MaRDI portal
(Redirected from Publication:6131244)
Extreme value theory; extremal stochastic processes (60G70) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Continuum models (systems of particles, etc.) arising in equilibrium statistical mechanics (82B21)
Recommendations
- The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph
- Clique numbers of random subgraphs of some distance graphs
- Connectivity of soft random geometric graphs
- Giant component of the soft random geometric graph
- On the clique number of noisy random geometric graphs
Cites work
- Central limit theorems for \(U\)-statistics of Poisson point processes
- Cliques in geometric inhomogeneous random graphs
- Cliques in hyperbolic random graphs
- Connectivity of soft random geometric graphs
- Connectivity of soft random geometric graphs over annuli
- Continuum Percolation
- Counting cliques and cycles in scale-free inhomogeneous random graphs
- Functional Poisson approximation in Kantorovich-Rubinstein distance with applications to U-statistics and stochastic geometry
- Geometric inhomogeneous random graphs
- High-dimensional random geometric graphs and their clique number
- Inhomogeneous random graphs, isolated vertices, and Poisson approximation
- Large cliques in a power-law random graph
- Limit theory for the Gilbert graph
- Number of cliques in random scale-free network ensembles
- On a continuum percolation model
- Random Geometric Graphs
- The diameter of a long-range percolation graph
This page was built for publication: On the distances within cliques in a soft random geometric graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131244)
