• Corpus ID: 236170998

# Recovering lost and absent information in temporal networks

@article{Bagrow2021RecoveringLA,
title={Recovering lost and absent information in temporal networks},
author={James Bagrow and Sune Lehmann},
journal={ArXiv},
year={2021},
volume={abs/2107.10835}
}
• Published 22 July 2021
• Computer Science
• ArXiv
The full range of activity in a temporal network is captured in its edge activity data—time series encoding the tie strengths or on-off dynamics of each edge in the network. However, in many practical applications, edge-level data are unavailable, and the network analyses must rely instead on node activity data which aggregates the edge-activity data and thus is less informative. This raises the question: Is it possible to use the static network to recover the richer edge activities from the…
1 Citations

## Figures and Tables from this paper

### Multiplex reconstruction with partial information

• Computer Science
• 2022
This work proposes a relatively simple reconstruction algorithm relying on the degree-corrected stochastic block model, characterized by a computational time that grows linearly with the network size and shows that the ability of the proposed method to solve the reconstruction problem is driven by the heterogeneity of the individual layers and the similarity among the layers.

## References

SHOWING 1-10 OF 58 REFERENCES

### The fundamental advantages of temporal networks

• Computer Science
Science
• 2017
It is demonstrated that temporal networks can be controlled more efficiently and require less energy than their static counterparts, and have control trajectories that are considerably more compact than those characterizing static networks.

### Temporal Networks

• Computer Science
Encyclopedia of Social Network Analysis and Mining
• 2014

### Compressive sensing over graphs

• Computer Science, Mathematics
2011 Proceedings IEEE INFOCOM
• 2011
It is shown that, using O(k log(n)) path measurements, it is able to recover any k-sparse link vector (with no more than k nonzero elements), even though the measurements have to follow the graph path constraints.

### Modern temporal network theory: a colloquium

This colloquium reviews the methods to analyze and model temporal networks and processes taking place on them, focusing mainly on the last three years, which includes the spreading of infectious disease, opinions, rumors, in social networks; information packets in computer networks; various types of signaling in biology, and more.

### Extracting the multiscale backbone of complex weighted networks

• Computer Science
Proceedings of the National Academy of Sciences
• 2009
A filtering method is defined that offers a practical procedure to extract the relevant connection backbone in complex multiscale networks, preserving the edges that represent statistically significant deviations with respect to a null model for the local assignment of weights to edges.

### Time-Ordered Networks Reveal Limitations to Information Flow in Ant Colonies

• Computer Science
PloS one
• 2011
A general framework for analyzing dynamic networks and a mathematical model that predicts how information flow scales with individual mobility and group size are developed, enabling a broader understanding of interaction network functioning across systems and scales.

### Edge-centric functional network representations of human cerebral cortex reveal overlapping system-level architecture

• Computer Science
bioRxiv
• 2019
It is demonstrated that clustering eFC yields communities of edges that naturally divide the brain into overlapping clusters, with regions in sensorimotor and attentional networks exhibiting the greatest levels of overlap.

### Sparse Recovery over Graph Incidence Matrices

• Computer Science
2018 IEEE Conference on Decision and Control (CDC)
• 2018
This paper derives necessary and sufficient conditions for sparse recovery, which depend on properties of the cycles of the graph that can be checked in polynomial time, and exploits sparsity properties on the measurements and the structure of incidence matrices to propose a specialized sub-graph-based recovery algorithm that outperforms the standard $\ell_{1}$ -minimization approach.

### Information flow reveals prediction limits in online social activity

• Computer Science
Nature Human Behaviour
• 2019
An individual’s social ties contain up to 95% of the potential predictive accuracy achievable about that individual, and in principle, a social platform may profile an individual from their ties only, without access to their data.

### Interaction data from the Copenhagen Networks Study

• Computer Science
Scientific Data
• 2019
This work describes the multi-layer temporal network which connects a population of more than 700 university students over a period of four weeks, and expects that reuse of this dataset will allow researchers to make progress on the analysis and modeling of human social networks.