Central limit type theorems in the generalized random graphs with random vertex weights
From MaRDI portal
Publication:341810
DOI10.1007/S10958-016-3024-6zbMATH Open1350.05153arXiv1602.01283OpenAlexW3101427337MaRDI QIDQ341810FDOQ341810
Zhishui Hu, V. V. Ulyanov, Qunqiang Feng
Publication date: 17 November 2016
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1602.01283
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 (5)
- Central limit theorem for fluctuations of linear eigenvalue statistics of large random graphs
- Rate of Convergence to the Poisson Law of the Numbers of Cycles in the Generalized Random Graphs
- A central limit theorem for diffusion in sparse 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)