Asymptotic in undirected random graph models with a noisy degree sequence
From MaRDI portal
Publication:5079273
DOI10.1080/03610926.2020.1755870OpenAlexW3019659359MaRDI QIDQ5079273
No author found.
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.1755870
Asymptotic properties of parametric estimators (62F12) Asymptotic distribution theory in statistics (62E20) Statistics (62-XX)
Cites Work
- Unnamed Item
- Maximum likelihood estimation in the \(\beta\)-model
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- 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
- Consistency of community detection in networks under degree-corrected stochastic block models
- Compound Poisson point processes, concentration and oracle inequalities
- Asymptotic theory for differentially private generalized \(\beta\)-models with parameters increasing
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- A nonparametric view of network models and Newman–Girvan and other modularities
- Statistical mechanics of complex networks
- Some Elementary Inequalities Relating to the Gamma and Incomplete Gamma Function
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- An Exponential Family of Probability Distributions for Directed Graphs
- A note on asymptotic distributions in directed exponential random graph models with bi-degree sequences
- The Average Distance in a Random Graph with Given Expected Degrees
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Asymptotics in theβ-model for networks with a differentially private degree sequence
- Probability Inequalities for Sums of Bounded Random Variables
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Theory of Cryptography
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
This page was built for publication: Asymptotic in undirected random graph models with a noisy degree sequence