mlsanityData to 7 Oct 2026

Asymptotic in a class of network models with an increasing sub-Gamma degree sequence

arXiv 2111.01301 ↗First posted 2 Nov 2021math.ST econ.EM stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

For the differential privacy under the sub-Gamma noise, we derive the asymptotic properties of a class of network models with binary values with a general link function. In this paper, we release the degree sequences of the binary networks under a general noisy mechanism with the discrete Laplace mechanism as a special case. We establish the asymptotic result including both consistency and asymptotically normality of the parameter estimator when the number of parameters goes to infinity in a class of network models. Simulations and a real data example are provided to illustrate asymptotic results.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 57 references that are in the map. First posted on arXiv 2 Nov 2021.

Builds on

5 of 57 references.

References · 5

  1. 2020Concentration Inequalities for Statistical Inferencecited by 24
  2. 2017Elastic-net Regularized High-dimensional Negative Binomial Regression: Consistency and Weak Signals Detectioncited by 8
  3. 2021Sharper Sub-Weibull Concentrationscited by 8
  4. 2013Maximum entropy distributions on graphscited by 4
  5. 2020Asymptotic Theory for Differentially Private Generalized β-models with Parameters Increasingcited by 1

Built on by

Not cited yet.