EconBase
← All papers

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

Jing Luo, Haoyu Wei, Xiaoyu Lei, Jiaxin Guo

arXiv 2 Nov 2021 · Mathematics — Statistics Theory · publishedCommunication in Statistics-Theory and Methods (2024)

arXiv:2111.01301 · PDF · DOI · OpenAlex · Extracted main text

Abstract

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.

Citation extraction

43
references
56
in-text mentions
43
distinct cited
5
self-citations
5,191
main-text words

appendix boundary found by appendix_titled_section at “Appendix” · 45% of the source is main text. Read the extracted text to check this.

Most heavily cited references

The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.

ReferenceIntensityMentionsSectionsMain text
1Ting Yan and Jinfeng Xu (2013) A central limit theorem in the $$-model for undirected random graphs with a diverging number of vertices0.8434375%
2Vishesh Karwa and Aleksandra Slavković (2016) Inference using noisy degrees: Differentially private $ $-model and synthetic graphs0.73732100%
3Stéphane Boucheron, Gábor Lugosi, and Pascal Massart (2013) Concentration inequalities: A nonasymptotic theory of independence0.6443267%
4Chung Fan and Linyuan Lu (2002) Connected components in random graphs with given expected degree sequences0.64422100%
5Christopher Hillar and Andre Wibisono (2013) Maximum entropy distributions on graphs0.64422100%
6Philippe Rigollet and Jan-Christian Hütter (2019) High dimensional statistics0.5113233%
7Seidu Inusah and Tomasz J. Kozubowski (2006) A discrete analogue of the laplace distribution0.5112250%
8Leudo Antonio Cutillo, Refik Molva, and Thorsten Strufe (2010) Privacy preserving social networking through decentralization0.40511100%
9Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith (2006) Calibrating noise to sensitivity in private data analysis0.40511100%
10Paul Erdos, Alfréd Rényi, et al (1960) On the evolution of random graphs0.40511100%

Showing the top 10 of 43 scored citations.