arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.5488cs.SIphysics.data-anphysics.soc-ph
收藏

基于图抽样的粗粒度拓扑估计

Coarse-Grained Topology Estimation via Graph Sampling

Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almquist, Carter T. Butts, Athina Markopoulou

摘要:

许多在线网络都是通过采样技术来测量和研究的,这些技术通常收集相对较小的一部分节点及其相关边缘。过去在这一领域的工作主要集中在获得节点的代表性样本和基于该样本的局部图属性(如节点度分布或任何节点属性)的有效估计。然而,很少有人知道估计的全局拓扑结构的基础图。在本文中,我们展示了如何有效地估计粗粒度的拓扑图的概率样本的节点。特别地,我们考虑节点被划分为类别(例如,国家或OSN中的工作/学习地点),其自然地定义加权类别图。我们感兴趣的是估计(i)类别的大小和(ii)来自两个不同类别的节点连接的概率。对于上述每一个,我们开发了一个家庭的估计基于设计的推理均匀或非均匀采样下,采用两种测量策略:诱导子图采样,它只依赖于信息的采样节点;和星抽样,这也利用类别信息的邻居采样节点。我们证明了这些估计的一致性,并评估其效率,通过模拟完全已知的图。我们还将我们的方法应用于Facebook用户的样本,以获得一些类别图,例如大学友谊图和国家友谊图;我们在www.geosocialmap.com上共享并可视化结果数据。

英文摘要:

Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this area has primarily focused on obtaining a representative sample of nodes and on efficient estimation of local graph properties (such as node degree distribution or any node attribute) based on that sample. However, less is known about estimating the global topology of the underlying graph. In this paper, we show how to efficiently estimate the coarse-grained topology of a graph from a probability sample of nodes. In particular, we consider that nodes are partitioned into categories (e.g., countries or work/study places in OSNs), which naturally defines a weighted category graph. We are interested in estimating (i) the size of categories and (ii) the probability that nodes from two different categories are connected. For each of the above, we develop a family of estimators for design-based inference under uniform or non-uniform sampling, employing either of two measurement strategies: induced subgraph sampling, which relies only on information about the sampled nodes; and star sampling, which also exploits category information about the neighbors of sampled nodes. We prove consistency of these estimators and evaluate their efficiency via simulation on fully known graphs. We also apply our methodology to a sample of Facebook users to obtain a number of category graphs, such as the college friendship graph and the country friendship graph; we share and visualize the resulting data at www.geosocialmap.com.

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

↑