Reciprocity, community detection, and link prediction in dynamic networks

  title={Reciprocity, community detection, and link prediction in dynamic networks},
  author={Hadi Safdari and Martina Contisciani and Caterina De Bacco},
  journal={Journal of Physics: Complexity},
Many complex systems change their structure over time, in these cases dynamic networks can provide a richer representation of such phenomena. As a consequence, many inference methods have been generalized to the dynamic case with the aim to model dynamic interactions. Particular interest has been devoted to extend the stochastic block model and its variant, to capture community structure as the network changes in time. While these models assume that edge formation depends only on the community… 
Community detection and reciprocity in networks by jointly modeling pairs of edges
A probabilistic generative model and an efficient algorithm to both perform community detection and capture reciprocity in networks that overcomes the limitations of both standard algorithms and recent models that incorporate reciprocity through a pseudo-likelihood approximation are presented.
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 assumes that each node has a preference in the interaction mechanism and nodes with the same preference are more likely to interact, while heterogeneous interactions are still allowed.
A Method for Investigating Coverage Area Issue in Dynamic Networks
  • Zaid A. Mundher
  • Computer Science
    Technium: Romanian Journal of Applied Sciences and Technology
  • 2022
The findings show that Cauchy distribution is not appropriate for simulating dynamic networks due to the large uncovered areas by nodes communications, and the stability of an approach is considered an important factor when measuring the performance of a dynamic network.


Dynamic Erdős-Rényi Graphs
For both models, the evolution of the number of edges present is considered, with explicit results for the corresponding moments, functional central limit theorems and large deviations asymptotics.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
The conference this year continues with its tradition of a strong tutorial and workshop program on leading edge issues of data mining during the first two days of the program, and continues a strong hands-on tutorial program, in which participants will learn how to use practical data science tools.
The European Physical Journal B 90
  • 1
  • 2017
  • Rev. Research 3, 023209
  • 2021
  • Discov. Data 1, 2–es
  • 2007
and P
    Machine learning 82
    • 157
    • 2011