Fundamental Structures in Dynamic Communication Networks

July 23, 2019 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Sune Lehmann arXiv ID 1907.09966 Category physics.soc-ph Cross-listed cs.SI Citations 3 Venue arXiv.org Last Checked 4 months ago
Abstract
In this paper I introduce a framework for modeling temporal communication networks and dynamical processes unfolding on such networks. The framework originates from the realization that there is a meaningful division of temporal communication networks into six dynamic classes, where the class of a network is determined by its generating process. In particular, each class is characterized by a fundamental structure: a temporal-topological network motif, which corresponds to the network representation of communication events in that class of network. These fundamental structures constrain network configurations: only certain configurations are possible within a dynamic class. In this way the framework presented here highlights strong constraints on network structures, which simplify analyses and shape network flows. Therefore the fundamental structures hold the potential to impact how we model temporal networks overall. I argue below that networks within the same class can be meaningfully compared, and modeled using similar techniques, but that integrating statistics across networks belonging to separate classes is not meaningful in general. This paper presents a framework for how to analyze networks in general, rather than a particular result of analyzing a particular dataset. I hope, however, that readers interested in modeling temporal networks will find the ideas and discussion useful in spite of the paper's more conceptual nature.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted