Sampling networks by nodal attributes

Abstract

In a social network individuals or nodes connect to other nodes by choosing one of the channels of communication at a time to re-establish the existing social links. Since available data sets are usually restricted to a limited number of channels or layers, these autonomous decision making processes by the nodes constitute the sampling of a multiplex network leading to just one (though very important) example of sampling bias caused by the behavior of the nodes. We develop a general setting to get insight and understand the class of network sampling models, where the probability of sampling a link in the original network depends on the attributes $h$ of its adjacent nodes. Assuming that the nodal attributes are independently drawn from an arbitrary distribution $\rho (h)$ and that the sampling probability $r(h_i,h_j)$ for a link $ij$ of nodal attributes $h_i$ and $h_j$ is also arbitrary, we derive exact analytic expressions of the sampled network for such network characteristics as the degree distribution, degree correlation, and clustering spectrum. The properties of the sampled network turn out to be sums of quantities for the original network topology weighted by the factors stemming from the sampling. Based on our analysis, we find that the sampled network may have sampling-induced network properties that are absent in the original network, which implies the potential risk of a naive generalization of the results of the sample to the entire original network. We also consider the case, when neighboring nodes have correlated attributes to show how to generalize our formalism for such sampling bias and we get good agreement between the analytic results and the numerical simulations.

11 pages, 5 figures

References in corpus (25)

• Detecting rich-club ordering in complex networks
• The Anatomy of the Facebook Social Graph
• Popularity versus Similarity in Growing Networks
• Class of correlated random networks with hidden variables
• Statistical properties of sampled networks
• Structure and inference in annotated networks
• Analysis of a large-scale weighted network of one-to-one human communication
• Network structure from rich but noisy data
• Measuring social dynamics in a massive multiplayer online game
• Accuracy and Scaling Phenomena in Internet Mapping
• Traceroute sampling makes random graphs appear to have power law degree distributions
• Exploring networks with traceroute-like probes: theory and simulations
• Sampling properties of random graphs: the degree distribution
• Exploring Complex Networks through Random Walks
• Generalized friendship paradox in complex networks: The case of scientific collaboration
• Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
• Statistical properties of sampled networks by random walks
• Network Sampling: From Static to Streaming Graphs
• Reliability of rank order in sampled networks
• Network structure, metadata and the prediction of missing nodes and annotations
• Disassortativity of percolating clusters in random networks
• Network Inference from TraceRoute Measurements: Internet Topology `Species'
• Sampling properties of directed networks
• What does Big Data tell? Sampling the social network by communication channels
• Stylized facts in social networks: Community-based static modeling

Cited by in corpus (1)

• Homophilic organization of egocentric communities in ICT services