Title
Detectability thresholds in networks with dynamic link and community structure.
Abstract
We study the inference of a model of temporal networks in which both communities and links keep memory of previous network state. By considering maximum likelihood inference from single snapshot observation of the network, we show that link persistence decreases the detectability threshold, preventing the inference of communities even when they are in principle strong enough, while community persistence tends to restore this possibility. Then we show that the inferred communities share a maximum overlap with those of a specific previous instant of time, corresponding to the maximum of a time-lagged assortativity parameter, and therefore they can be closer to those of the past than of the present. We analytically characterize these transitions as a function of the memory parameters of the model.
Year
Venue
Field
2017
arXiv: Social and Information Networks
Data mining,Assortativity,Community structure,Computer science,Inference,Maximum likelihood,Artificial intelligence,Snapshot (computer storage),Machine learning
DocType
Volume
Citations 
Journal
abs/1701.05804
2
PageRank 
References 
Authors
0.43
0
4
Name
Order
Citations
PageRank
Paolo Barucca1113.76
Fabrizio Lillo24110.66
Piero Mazzarisi320.43
Daniele Tantari4152.78