On the time to identify the nodes in a random graph

DOI10.1016/J.SPL.2023.109779MaRDI QIDQ6101720zbMATH OpenFDO

Authors Jonathan R. Stewart

Publication date 20 June 2023

Published in Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

random graphssampling timesErdős-Rényi random graphegocentric network sampling

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of statistics to social sciences (62P25) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Graph sampling
• Mixing time of exponential random graphs
• Publication:4732022
• Mixing time of vertex-weighted exponential random graphs
• Consistency under sampling of exponential random graph models

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• Inference for social network models from egocentrically sampled data, with application to understanding persistent racial disparities in HIV prevalence in the US
• Introduction to Random Graphs
• Modeling social networks from sampled data
• Random Graphs
• Topics at the Frontier of Statistics and Network Analysis

Cited in

(2)

• A tight upper bound on acquaintance time of graphs
• A probabilistic upper bound for the edge identification complexity of graphs

This page was built for publication: On the time to identify the nodes in a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6101720)