A survey and taxonomy of graph sampling
Graph sampling is a technique to pick a subset of vertices and/or edges from original graph.
It has a wide spectrum of applications, eg survey hidden population in sociology [54] …
It has a wide spectrum of applications, eg survey hidden population in sociology [54] …
Walking in facebook: A case study of unbiased sampling of osns
With more than 250 million active users, Facebook (FB) is currently one of the most
important online social networks. Our goal in this paper is to obtain a representative …
important online social networks. Our goal in this paper is to obtain a representative …
Network sampling: From static to streaming graphs
Network sampling is integral to the analysis of social, information, and biological networks.
Since many real-world networks are massive in size, continuously evolving, and/or …
Since many real-world networks are massive in size, continuously evolving, and/or …
Estimating and sampling graphs with multidimensional random walks
Estimating characteristics of large graphs via sampling is a vital part of the study of complex
networks. Current sampling methods such as (independent) random vertex and random …
networks. Current sampling methods such as (independent) random vertex and random …
Fireman: A toolkit for firewall modeling and analysis
Security concerns are becoming increasingly critical in networked systems. Firewalls
provide important defense for network security. However, misconfigurations in firewalls are …
provide important defense for network security. However, misconfigurations in firewalls are …
Practical recommendations on crawling online social networks
Our goal in this paper is to develop a practical framework for obtaining a uniform sample of
users in an online social network (OSN) by crawling its social graph. Such a sample allows …
users in an online social network (OSN) by crawling its social graph. Such a sample allows …
On the bias of BFS (breadth first search)
M Kurant, A Markopoulou… - 2010 22nd International …, 2010 - ieeexplore.ieee.org
Breadth First Search (BFS) and other graph traversal techniques are widely used for
measuring large unknown graphs, such as online social networks. It has been empirically …
measuring large unknown graphs, such as online social networks. It has been empirically …
A survey of sampling method for social media embeddedness relationship
Y Cui, X Li, J Li, H Wang, X Chen - ACM Computing Surveys, 2022 - dl.acm.org
Social media embeddedness relationships consist of online social networks formed by self-
organized individual actors and significantly affect many aspects of our lives. Since the high …
organized individual actors and significantly affect many aspects of our lives. Since the high …
Beyond random walk and metropolis-hastings samplers: why you should not backtrack for unbiased graph sampling
Graph sampling via crawling has been actively considered as a generic and important tool
for collecting uniform node samples so as to consistently estimate and uncover various …
for collecting uniform node samples so as to consistently estimate and uncover various …
Towards unbiased BFS sampling
M Kurant, A Markopoulou… - IEEE Journal on Selected …, 2011 - ieeexplore.ieee.org
Breadth First Search (BFS) is a widely used approach for sampling large graphs. However, it
has been empirically observed that BFS sampling is biased toward high-degree nodes …
has been empirically observed that BFS sampling is biased toward high-degree nodes …