Network sampling and classification: An investigation of network model representations
Edoardo M. Airoldi,Xue Bai,Kathleen M. Carley +2 more
- Vol. 51, Iss: 3, pp 506-518
Reads0
Chats0
TLDR
It is argued that conclusions based on simulated network studies must focus on the full features of the connectivity patterns of a network instead of on the limited set of network metrics for a specific network type.Abstract:
Methods for generating a random sample of networks with desired properties are important tools for the analysis of social, biological, and information networks. Algorithm-based approaches to sampling networks have received a great deal of attention in recent literature. Most of these algorithms are based on simple intuitions that associate the full features of connectivity patterns with specific values of only one or two network metrics. Substantive conclusions are crucially dependent on this association holding true. However, the extent to which this simple intuition holds true is not yet known. In this paper, we examine the association between the connectivity patterns that a network sampling algorithm aims to generate and the connectivity patterns of the generated networks, measured by an existing set of popular network metrics. We find that different network sampling algorithms can yield networks with similar connectivity patterns. We also find that the alternative algorithms for the same connectivity pattern can yield networks with different connectivity patterns. We argue that conclusions based on simulated network studies must focus on the full features of the connectivity patterns of a network instead of on the limited set of networkmetrics for a specific network type. This fact has important implications for network data analysis: for instance, implications related to the way significance is currently assessed.read more
Citations
More filters
Posted Content
Model Selection Framework for Graph-based data
TL;DR: A framework for graph model selection that leverages a long list of graph topological properties and a random forest classifier to learn and classify different graph instances is discussed and insight is provided on which topological features play a critical discriminating role.
Journal ArticleDOI
Dynamic network prediction
Ravi Goyal,Victor De Gruttola +1 more
TL;DR: In this article, the authors present a statistical framework for generating predicted dynamic networks based on the observed evolution of social relationships in a population, which includes a novel and flexible procedure to sample dynamic networks given a probability distribution on evolving network properties; it permits the use of a broad class of approaches to model trends, seasonal variability, uncertainty and changes in population composition.
Journal ArticleDOI
Avaliação de redes de pesquisa: indicadores de interação e formação
Denise Leite,Bernardo Sfredo Miorando,Isabel Pinho,Célia Elizabete Caregnato,Elizeth Gonzaga dos Santos Lima +4 more
TL;DR: In this paper, a methodology was developed to explore the curricula of researchers employing software to build spreadsheets, count coauthorships, and analyze social networks, which have been tested and validated in the context of application.
Posted Content
Graph Model Selection via Random Walks.
TL;DR: This approach leverages the transient behavior of many short random walks with novel initialization mechanisms to generate model discriminative features that are able to capture a more comprehensive structural signature of the underlying graph model.
Book ChapterDOI
ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks
Emrah Cem,Oznur Ozkasap +1 more
TL;DR: A fully distributed Protocol for Frequent Item set Discovery (ProFID) where the result is produced at every peer is proposed and a practical rule for convergence of the algorithm is proposed.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Book
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
TL;DR: In this paper, the authors describe the important ideas in these areas in a common conceptual framework, and the emphasis is on concepts rather than mathematics, with a liberal use of color graphics.
Journal ArticleDOI
Statistical mechanics of complex networks
TL;DR: In this paper, a simple model based on the power-law degree distribution of real networks was proposed, which was able to reproduce the power law degree distribution in real networks and to capture the evolution of networks, not just their static topology.
Book
Social Network Analysis: Methods and Applications
TL;DR: This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of Dyadic and Triadic Interaction Models, which describes the relationships between actor and group measures and the structure of networks.