• Corpus ID: 245334638

Community detection and reciprocity in networks by jointly modeling pairs of edges

  title={Community detection and reciprocity in networks by jointly modeling pairs of edges},
  author={Martina Contisciani and Hadi Safdari and Caterina De Bacco},
We present a probabilistic generative model and an efficient algorithm to both perform community detection and capture reciprocity in networks. Our approach jointly models pairs of edges with exact 2-edge joint distributions. In addition, it provides closed-form analytical expressions for both marginal and conditional distributions. We validate our model on synthetic data in recovering communities, edge prediction tasks, and generating synthetic networks that replicate the reciprocity values… 

Figures and Tables from this paper

Latent Network Models to Account for Noisy, Multiply-Reported Social Network Data
A probabilistic model that incorporates ties reported by multiple individuals to estimate the unobserved network structure and explicitly incorporates a term for “mutuality,” the tendency to report ties in both directions involving the same alter, is proposed.
Principled inference of hyperedges and overlapping communities in hypergraphs
This work proposes a framework based on statistical inference to characterize the structural organization of hypergraphs that allows to infer missing hyperedges of any size in a principled way, and to jointly detect overlapping communities in presence of higher-order interactions.
The interplay between ranking and communities in networks
A generative model based on an interplay between community and hierarchical structures that can recognize whether a network has an overall preferred interaction mechanism and allows practitioners to learn this automatically from the data.


Reciprocity, community detection, and link prediction in dynamic networks
A probabilistic generative model with hidden variables that integrates reciprocity and communities as structural information of networks that evolve in time that captures the reciprocity of real networks better than standard models with only community structure, while performing well at link prediction tasks.
Disentangling homophily, community structure and triadic closure in networks
This approach is based on a variation of the stochastic block model with the addition of triadic closure edges, and its inference can identify the most plausible mechanism responsible for the existence of every edge in the network, in addition to the underlying community structure itself.
An efficient and principled method for detecting communities in networks
This work describes a method for finding overlapping communities based on a principled statistical approach using generative network models and shows how the method can be implemented using a fast, closed-form expectation-maximization algorithm that allows us to analyze networks of millions of nodes in reasonable running times.
Patterns of link reciprocity in directed networks.
It is found that real networks are always either correlated or anticorrelated, and that networks of the same type display similar values of the reciprocity.
Community detection, link prediction, and layer interdependence in multilayer networks
A generative model, and an efficient expectation-maximization algorithm, which allows us to perform inference tasks such as community detection and link prediction in this setting, and gives a mathematically principled way to define the interdependence between layers.
Measuring reciprocity: Double sampling, concordance, and network construction
Reciprocity—the mutual provisioning of support/goods—is a pervasive feature of social life. Di- rected networks provide a way to examine the structure of reciprocity in a community. However,
Statistical mechanics of networks.
  • Juyong Park, M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of
The impossibility of low-rank representations for triangle-rich complex networks
It is mathematically proved that low-dimensional embeddings cannot generate graphs with both low average degree and large clustering coefficients, and any embedding that can successfully create these two properties must have a rank that is nearly linear in the number of vertices.
An introduction to exponential random graph (p*) models for social networks