On the time to identify the nodes in a random graph

DOI10.1016/J.SPL.2023.109779zbMATH Open1518.05174MaRDI QIDQ6101720FDOQ6101720

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Inference for social network models from egocentrically sampled data, with application to understanding persistent racial disparities in HIV prevalence in the US
• Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
• Random Graphs
• Topics at the Frontier of Statistics and Network Analysis
• Modeling social networks from sampled data
• Introduction to Random Graphs

Cited In (3)

• A probabilistic upper bound for the edge identification complexity of graphs
• How long it takes for an ordinary node with an ordinary ID to output?
• A tight upper bound on acquaintance time 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)