Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.01301 v4 pith:3ZIY5CIB submitted 2021-11-02 math.ST econ.EMstat.MLstat.TH

classification math.STecon.EMstat.MLstat.TH
keywords asymptoticclassmodelsnetworkbinarydegreegeneralmechanism
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools