DMCA
Coarse-Grained Topology Estimation via Graph Sampling (2012)
| Citations: | 10 - 4 self |
BibTeX
@MISC{Kurant12coarse-grainedtopology,
author = {Maciej Kurant and Minas Gjoka and Yan Wang and Zack W. Almquist and Carter T. Butts and Athina Markopoulou},
title = {Coarse-Grained Topology Estimation via Graph Sampling},
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In many online networks, nodes are partitioned into categories (e.g., countries or universities in OSNs), which naturally defines a weighted category graph i.e., a coarse-grained version of the underlying network. In this paper, we show how to efficiently estimate the category graph from a probability sample of nodes. We prove consistency of our estimators and evaluate their efficiency via simulation. 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.
