Asymptotic distributions in affiliation networks with an increasing sequence
From MaRDI portal
Publication:4638710
DOI10.1080/03610926.2017.1303741zbMath1388.62028OpenAlexW2614889638MaRDI QIDQ4638710
Jing Luo, Yong Zhang, Hong Qin, Jian-Wei Hu
Publication date: 27 April 2018
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610926.2017.1303741
Asymptotic properties of parametric estimators (62F12) Asymptotic distribution theory in statistics (62E20) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)
Related Items (1)
Cites Work
- Unnamed Item
- Maximum likelihood estimation in the \(\beta\)-model
- Random graphs with a given degree sequence
- The method of moments and degree distributions for network models
- Generating simple random graphs with prescribed degree distribution
- Human sexual contact network as a bipartite graph
- Consistency of community detection in networks under degree-corrected stochastic block models
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Affiliation networks with an increasing degree sequence
- Collective dynamics of ‘small-world’ networks
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- On Distributions Admitting a Sufficient Statistic
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
This page was built for publication: Asymptotic distributions in affiliation networks with an increasing sequence