Limit behaviors of random connected graphs driven by a Poisson process
From MaRDI portal
(Redirected from Publication:394844)
Recommendations
- Poisson convergence and Poisson processes with applications to random graphs
- Connection probabilities in Poisson random graphs with uniformly bounded edges
- Limit density of connected components in a graph process
- Poisson convergence and semi-induced properties of random graphs
- On a conditionally Poissonian graph process
- Connectivity of Poissonian inhomogeneous random multigraphs
- Poisson convergence of numbers of vertices of a given degree in random graphs
- Inhomogeneous random graphs, isolated vertices, and Poisson approximation
- Poisson approximation and connectivity in a scale-free random connection model
- Limit laws in the generalized random graphs with random vertex weights
Cites work
- A proof of the Gamma test
- A strong law of large numbers for random biased connected graphs
- Central limit theorems for \(k\)-nearest neighbour distances
- Connectivity of random k-nearest-neighbour graphs
- Continuum Percolation
- Large deviations for sums of partly dependent random variables
- Moderate deviations for some point measures in geometric probability
- Moderate deviations of dependent random variables related to CLT
- On normal approximations of distributions in terms of dependency graphs
- On the fraction of random points by specified nearest-neighbour interrelations and degree of attraction
- Random Geometric Graphs
- Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test
- The infamous upper tail
- The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach
- The spatial general epidemic and locally dependent random graphs
- Weak laws of large numbers in geometric probability
- \(k\)-nearest-neighbor clustering and percolation theory
Cited in
(5)- A transport process on graphs and its limiting distributions
- The random connection model and functions of edge-marked Poisson processes: second order properties and normal approximation
- A central limit theorem of random biased connected graphs
- Limit theory for the Gilbert graph
- Emergence of the giant component in preferential-attachment growing networks
This page was built for publication: Limit behaviors of random connected graphs driven by a Poisson process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394844)