稀疏Erdös-Rényi图上的响应者驱动抽样
Respondent Driven Sampling on sparse Erdös-Rényi graphs
摘要:
我们研究了一个Erdös-Rényi随机图的响应驱动的抽样方法,发现的顶点揭示他们的邻居的探索。他们中的一些人收到优惠券,轮到他们透露自己的邻居。这导致我们研究的随机图上的马尔可夫链的研究。对于大尺寸的稀疏Erdös-Rényi图,这个过程正确地重整化收敛到确定性曲线的解,即吸收在横坐标轴上的常微分方程组的解。研究了相关的涨落过程,给出了一个泛函中心极限定理和高斯极限过程。仿真和数值计算说明了研究。
英文摘要:
We study the exploration of an Erdös-Rényi random graph by a respondent-driven sampling method, where discovered vertices reveal their neighbours. Some of them receive coupons to reveal in their turn their own neighbourhood. This leads to the study of a Markov chain on the random graph that we study. For sparse Erdös-Rényi graphs of large sizes, this process correctly renormalized converges to the solution of a deterministic curve, solution of a system of ODEs absorbed on the abscissa axis. The associated fluctuation process is also studied, providing a functional central limit theorem, with a Gaussian limiting process. Simulations and numerical computation illustrate the study.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。