Modeling Tie Duration in ERGM-Based Dynamic Network Models

Australia); NSW; Pavel N. Krivitsky (School of Mathematics; Statistics; Sydney; University of New South Wales

REVIEW

Modeling Tie Duration in ERGM-Based Dynamic Network Models

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2203.11817 v1 pith:XT444KDC submitted 2022-03-14 cs.SI math.STstat.MEstat.TH

Pavel N. Krivitsky (School of Mathematics , Statistics , University of New South Wales , Sydney , NSW , Australia) This is my paper · ORCID

classification cs.SImath.STstat.MEstat.TH

keywords durationframeworkmodelingdistributionsseparableachievableassumptionsdynamic

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

Krivitsky and Handcock (2014) proposed a Separable Temporal ERGM (STERGM) framework for modeling social networks, which facilitates separable modeling of the tie duration distributions and the structural dynamics of tie formation. In this note, we explore the hazard structures achievable in this framework, with first- and higher-order Markov assumptions, and propose ways to model a variety of duration distributions in this framework.

Discussion (0). Continue with ORCID to comment.

Pith tools