Asymptotic in the ordered networks with a noisy degree sequence
From MaRDI portal
Publication:2165451
DOI10.1007/S11424-021-0248-4zbMATH Open1495.91095OpenAlexW3187220594MaRDI QIDQ2165451FDOQ2165451
Publication date: 19 August 2022
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-021-0248-4
Recommendations
- Degree-based moment estimation for ordered networks
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
- Affiliation weighted networks with a differentially private degree sequence
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Privacy-preserving statistical estimation with optimal convergence rates
Cites Work
- Statistical mechanics of complex networks
- Title not available (Why is that?)
- Consistency of community detection in networks under degree-corrected stochastic block models
- An Exponential Family of Probability Distributions for Directed Graphs
- Probability Inequalities for Sums of Bounded Random Variables
- The method of moments and degree distributions for network models
- Maximum likelihood estimation in the \(\beta\)-model
- Theory of Cryptography
- Random graphs with a given degree sequence
- Some Elementary Inequalities Relating to the Gamma and Incomplete Gamma Function
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Generating simple random graphs with prescribed degree distribution
- Title not available (Why is that?)
- A discrete analogue of the Laplace distribution
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Concentration inequalities for statistical inference
- An econometric model of network formation with degree heterogeneity
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
- A note on a network model with degree heterogeneity and homophily
- Asymptotics in theβ-model for networks with a differentially private degree sequence
- Statistical inference in a directed network model with covariates
- Degree-based moment estimation for ordered networks
Cited In (5)
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
- Asymptotic in a class of network models with a difference private degree sequence
- Affiliation weighted networks with a differentially private degree sequence
- Degree-based moment estimation for ordered networks
- On networks with order close to the Moore bound
This page was built for publication: Asymptotic in the ordered networks with a noisy degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165451)
