Open AccessPosted Content
Multigraph Sampling of Online Social Networks
Reads0
Chats0
TLDR
In this article, a multigraph sampling method was proposed to exploit the relationships between OSN users, such as membership in the same group or participation in the event, by performing a random walk on their union multigraph.Abstract:
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation (typically friendship). While powerful, these methods rely on the social graph being fully connected. Furthermore, the mixing time of the sampling process strongly depends on the characteristics of this graph. In this paper, we observe that there often exist other relations between OSN users, such as membership in the same group or participation in the same event. We propose to exploit the graphs these relations induce, by performing a random walk on their union multigraph. We design a computationally efficient way to perform multigraph sampling by randomly selecting the graph on which to walk at each iteration. We demonstrate the benefits of our approach through (i) simulation in synthetic graphs, and (ii) measurements of this http URL - an Internet website for music with social networking features. More specifically, we show that multigraph sampling can obtain a representative sample and faster convergence, even when the individual graphs fail, i.e., are disconnected or highly clustered.read more
Citations
More filters
Journal ArticleDOI
Practical Recommendations on Crawling Online Social Networks
TL;DR: This paper develops a practical framework for obtaining a uniform sample of users in an online social network by crawling its social graph by considering and comparing several candidate crawling techniques and introduces online formal convergence diagnostics to assess sample quality during the data collection process.
Journal ArticleDOI
Spreading Processes in Multilayer Networks
TL;DR: This paper reviews the main models, results and applications of multilayer spreading processes, and discusses some promising research directions in this young research area.
Book
Multilayer Social Networks
TL;DR: This book unifies and consolidates existing practical and theoretical knowledge on multilayer networks including data collection and analysis, modeling, and mining of multilayers social network systems, the evolution of interconnected social networks, and dynamic processes such as information spreading.
Posted Content
A Survey and Taxonomy of Graph Sampling.
Pili Hu,Wing Cheong Lau +1 more
TL;DR: This survey discusses both classical text-book type properties and some advanced properties of graph sampling, and provides a taxonomy of different graph sampling objectives and graph sampling approaches.
Posted Content
Towards Unbiased BFS Sampling
TL;DR: In this article, the degree bias of incomplete BFS is quantified and a practical BFS-bias correction procedure is proposed, which takes as input a collected BFS sample together with its fraction f. Even though BFS does not capture many graph properties common in real-life graphs (such as assortativity), their RG(pk)-based correction technique performs well on a broad range of Internet topologies and on two large BFS samples of Facebook and Orkut networks.
References
More filters
Journal ArticleDOI
Inference from Iterative Simulation Using Multiple Sequences
Andrew Gelman,Donald B. Rubin +1 more
TL;DR: The focus is on applied inference for Bayesian posterior distributions in real problems, which often tend toward normal- ity after transformations and marginalization, and the results are derived as normal-theory approximations to exact Bayesian inference, conditional on the observed simulations.
BookDOI
Markov Chain Monte Carlo in Practice
TL;DR: The Markov Chain Monte Carlo Implementation Results Summary and Discussion MEDICAL MONITORING Introduction Modelling Medical Monitoring Computing Posterior Distributions Forecasting Model Criticism Illustrative Application Discussion MCMC for NONLINEAR HIERARCHICAL MODELS.
Book
Introduction to Graph Theory
TL;DR: In this article, the authors introduce the concept of graph coloring and propose a graph coloring algorithm based on the Eulers formula for k-chromatic graphs, which can be seen as a special case of the graph coloring problem.
Journal ArticleDOI
Introduction to Probability Models.
TL;DR: There is a comprehensive introduction to the applied models of probability that stresses intuition, and both professionals, researchers, and the interested reader will agree that this is the most solid and widely used book for probability theory.
Journal ArticleDOI
Respondent-driven sampling : A new approach to the study of hidden populations
TL;DR: A new variant of chain-referral sampling, respondent-driven sampling, is introduced that employs a dual system of structured incentives to overcome some of the deficiencies of such samples and discusses how respondent- driven sampling can improve both network sampling and ethnographic investigation.