Central limit type theorems in the generalized random graphs with random vertex weights
From MaRDI portal
(Redirected from Publication:341810)
Abstract: We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.
Recommendations
- Limit laws for the number of triangles in the generalized random graphs with random node weights
- Large deviations in generalized random graphs with node weights
- Number of edges in inhomogeneous random graphs
- A central limit theorem of random biased connected graphs
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
Cites work
Cited in
(9)- Weighted dependency graphs
- Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs
- Large deviations in generalized random graphs with node weights
- Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs
- Number of edges in inhomogeneous random graphs
- A central limit theorem for diffusion in sparse random graphs
- Rate of convergence to the Poisson law of the numbers of cycles in the generalized random graphs
- A central limit theorem for decomposable random variables with applications to random graphs
- Large deviations for empirical measures of generalized random graphs
This page was built for publication: Central limit type theorems in the generalized random graphs with random vertex weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341810)