arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1505.05461math.STstat.MEstat.MLstat.TH
收藏

网络驱动抽样;设计效果的临界阈值

Network driven sampling; a critical threshold for design effects

Karl Rohe

摘要:

网络爬行、雪球抽样和响应者驱动抽样(RDS)是三种用于联系难以接触人群的网络抽样技术。本文研究这些程序作为一个马尔可夫过程的社会网络,是由一棵树索引。该树中的每个节点对应于一个观察,树中的每条边对应于一个引用。使用树(而不是链)索引允许采样单元将多个未来单元引用到样本中。在调查抽样中,设计效应表征了由新的抽样策略引起的额外方差。如果设计效应是某个值$DE$,则从新设计构造估计量使估计量的方差比在具有相同样本量$n$的简单随机样本下的方差大$DE$倍。在一定的假设下,推荐树,网络抽样的设计效果有一个临界阈值,这是一个功能的推荐率$m$和社会网络中的聚类结构,表示的马尔可夫转移阵,$λ_2$的第二个特征值。如果是$m < 1/λ_2^2$,则设计效应是有限的(即标准估计量是$\sqrt{n}$ -相容的)。但是,如果是$m > 1/λ_2^2$,则设计效应随$n$增长(即标准估计量不再与$\sqrt{n}$一致)。超过此临界阈值,估计量的标准误差以$n^{\log_m λ_2}$的较慢速率收敛。马尔可夫模型允许对节点进行重新采样;计算结果表明,研究结果在无替换采样中保持不变。为了估计适应正确水平的不确定性的置信区间,提出了一种新的重新估计过程。计算实验比较这个过程与以前的技术。

英文摘要:

Web crawling, snowball sampling, and respondent-driven sampling (RDS) are three types of network sampling techniques used to contact individuals in hard-to-reach populations. This paper studies these procedures as a Markov process on the social network that is indexed by a tree. Each node in this tree corresponds to an observation and each edge in the tree corresponds to a referral. Indexing with a tree (instead of a chain) allows for the sampled units to refer multiple future units into the sample. In survey sampling, the design effect characterizes the additional variance induced by a novel sampling strategy. If the design effect is some value $DE$, then constructing an estimator from the novel design makes the variance of the estimator $DE$ times greater than it would be under a simple random sample with the same sample size $n$. Under certain assumptions on the referral tree, the design effect of network sampling has a critical threshold that is a function of the referral rate $m$ and the clustering structure in the social network, represented by the second eigenvalue of the Markov transition matrix, $λ_2$. If $m < 1/λ_2^2$, then the design effect is finite (i.e. the standard estimator is $\sqrt{n}$-consistent). However, if $m > 1/λ_2^2$, then the design effect grows with $n$ (i.e. the standard estimator is no longer $\sqrt{n}$-consistent). Past this critical threshold, the standard error of the estimator converges at the slower rate of $n^{\log_m λ_2}$. The Markov model allows for nodes to be resampled; computational results show that the findings hold in without-replacement sampling. To estimate confidence intervals that adapt to the correct level of uncertainty, a novel resampling procedure is proposed. Computational experiments compare this procedure to previous techniques.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑