Monotonicity, asymptotic normality and vertex degrees in random graphs
From MaRDI portal
Publication:2469660
DOI10.3150/07-BEJ6103zbMath1132.60024arXivmath/0605642OpenAlexW3104229213MaRDI QIDQ2469660
Publication date: 6 February 2008
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0605642
asymptotic normalityrandom graphsconditional limit theoremvertex degreesrandom allocationsCramér-Wold theorem
Related Items (4)
Testing for Balance in Social Networks ⋮ Central limit theorems for additive functionals and fringe trees in tries ⋮ Asymptotic normality in random graphs with given vertex degrees ⋮ Asymptotic normality of the \(k\)-core in random graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotic normality of the \(k\)-core in random graphs
- Asymptotic normality of sum-functions of spacings
- Some conditional limit theorems in exponential families
- Two conditional limit theorems with applications
- A central limit theorem for decomposable random variables with applications to random graphs
- Local limit theorems for finite and infinite urn models
- Moment convergence in conditional limit theorems
- Limiting Distributions in Some Occupancy Problems
- A functional limit theorem for random graphs with applications to subgraph count statistics
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- On sequential occupancy problems
- On tree census and the giant component in sparse random graphs
- Stochastic Monotonicity and Conditioning in the Limit
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
- On the central limit theorem for sums of dependent random variables
- Asymptotic normality in a coupon collector's problem
- Some Theorems on Distribution Functions
This page was built for publication: Monotonicity, asymptotic normality and vertex degrees in random graphs