A note on undirected random graph models parameterized by the strengths of vertices
From MaRDI portal
Publication:5079140
DOI10.1080/03610926.2020.1728332OpenAlexW3007960949MaRDI QIDQ5079140
Publication date: 25 May 2022
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610926.2020.1728332
Asymptotic properties of parametric estimators (62F12) Social networks; opinion dynamics (91D30) Statistics (62-XX)
Cites Work
- Unnamed Item
- Unnamed Item
- Maximum likelihood estimation in the \(\beta\)-model
- Random graphs with a given degree sequence
- Central limit theorems for associated random variables and the percolation model
- Exponential inequalities for sums of weakly dependent variables
- On the convergence rate in the central limit theorem for associated processes
- Positively correlated normal variables are associated
- Some concepts of negative dependence
- Detection thresholds for the \(\beta\)-model on sparse graphs
- Negative association of random variables, with applications
- Association of normal random variables and Slepian's inequality
- Exponential inequality for associated random variables
- A Berry-Esseen theorem for weakly negatively dependent random variables and its applications
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Asymptotic equivalence and contiguity of some random graphs
- Emergence of Scaling in Random Networks
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- An Exponential Family of Probability Distributions for Directed Graphs
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Probability Inequalities for Sums of Bounded Random Variables
- The average distances in random graphs with given expected degrees
- Association of Random Variables, with Applications
This page was built for publication: A note on undirected random graph models parameterized by the strengths of vertices
