The structured backbone of temporal social ties

@article{Kobayashi2019TheSB,
  title={The structured backbone of temporal social ties},
  author={Teruyoshi Kobayashi and Taro Takaguchi and Alain Barrat},
  journal={Nature Communications},
  year={2019},
  volume={10}
}
In many data sets, information on the structure and temporality of a system coexists with noise and non-essential elements. In networked systems for instance, some edges might be non-essential or exist only by chance. Filtering them out and extracting a set of relevant connections is a non-trivial task. Moreover, mehods put forward until now do not deal with time-resolved network data, which have become increasingly available. Here we develop a method for filtering temporal network data, by… 

Figures and Tables from this paper

From temporal network data to the dynamics of social relationships
TLDR
This work introduces a framework to transforming temporal network data into an evolving weighted network where the weights of the links between individuals are updated at every interaction, and takes into account the interdependence of social relationships due to the finite attention capacities of individuals.
From temporal network data to the dynamics of social relationships
TLDR
This work presents a new framework to study the dynamic evolution of social networks based on the idea that social relationships are interdependent, and implements this interdependence in a parsimonious two-parameter model and applies it to several human and non-human primates’ datasets to demonstrate that this model detects even small and short perturbations of the networks that cannot be detected using the standard technique of successive aggregated networks.
Building surrogate temporal network data from observed backbones.
TLDR
The results give hints on how to best summarize complex data sets so that they remain actionable and show how ensembles of surrogate data with similar properties can be obtained from an original single data set, without any modeling assumptions.
Identifying the temporal dynamics of densification and sparsification in human contact networks
TLDR
This work proposes a numerical maximum-likelihood method to estimate population size and the probability of two nodes connecting at any given point in time, and enables the simultaneous (rather than the asynchronous) contribution of each mechanism in the densification and sparsification of human contacts, providing a better understanding of how humans collectively construct and deconstruct social networks.
Detecting network backbones against time variations in node properties
TLDR
It is shown that neglecting time variations in node-specific properties may beget false positives in the inference of the network backbone, and the viability of the proposed approach to aid in the discovery of network backbones from time series is demonstrated.
Detecting informative higher-order interactions in statistically validated hypergraphs
TLDR
This work proposes an analytic approach to filter hypergraphs by identifying those hyperlinks that are over-expressed with respect to a random null hypothesis, and represent the most relevant higher-order connections.
Temporal properties of higher-order interactions in social networks
TLDR
This work investigates the higher-order organizations of temporal social networks by analyzing five publicly available datasets collected in different social settings and finds that higher- order interactions are ubiquitous and, similarly to their pairwise counterparts, characterized by heterogeneous dynamics.
Reconstructing irreducible links in temporal networks: which tool to choose depends on the network size
TLDR
This work examines the performance of three approaches for the discovery of backbone networks, in the presence of heterogeneous, time-varying node properties, and proposes general guidelines for the use of these three approaches based on the available dataset.
The Backbone Network of Dynamic Functional Connectivity
TLDR
This work proposes a data-driven procedure to reveal the irreducible ties in dynamic functional connectivity of resting state fRMI data with continuous weights that includes a null model that estimates the latent characteristics of the distributions of temporal links through optimization, followed by a statistical test to filter the links whose formation can be reduced to the activities and local properties of their interacting nodes.
The Backbone Network of Dynamic Functional Connectivity : 2
TLDR
This work proposes a data-driven procedure to reveal the irreducible ties in dynamic functional connectivity of resting state fRMI data with continuous weights, and proposes an optimization-based null model to infer the significant ties.
...
1
2
3
4
...

References

SHOWING 1-10 OF 90 REFERENCES
A Pólya urn approach to information filtering in complex networks
TLDR
A filtering methodology inspired by the Pólya urn is proposed, a combinatorial model driven by a self-reinforcement mechanism, which relies on a family of null hypotheses that can be calibrated to assess which links are statistically significant with respect to a given network’s own heterogeneity.
Statistically Validated Networks in Bipartite Complex Systems
TLDR
An unsupervised method is introduced to statistically validate each link of a projected network against a null hypothesis that takes into account system heterogeneity, and identifies those relationships between elements of the projected network that cannot be explained simply by system heterogeneity.
Network structure from rich but noisy data
TLDR
A technique is described that allows optimal inference of the structure of a network when the available observed data are rich but noisy, incomplete or otherwise unreliable.
From Relational Data to Graphs: Inferring Significant Links Using Generalized Hypergeometric Ensembles
TLDR
A new statistical modeling framework is proposed that builds on generalized hypergeometric ensembles, a class of generative stochastic models that give rise to analytically tractable probability spaces of directed, multi-edge graphs that can be used to assess the significance of links in noisy relational data.
Estimating network structure from unreliable measurements
  • M. Newman
  • Computer Science
    Physical Review E
  • 2018
TLDR
Here a general method for making estimates of network structure and properties using any form of network data, simple or complex, when the data are unreliable is developed, and example applications to a selection of social and biological networks are given.
Irreducible network backbones: unbiased graph filtering via maximum entropy
TLDR
This work introduces a rigorous method that outputs the network backbone that is irreducible to the local properties of nodes, i.e. their degrees and strengths and employs an exact maximum-entropy formulation guaranteeing that the filtered network encodes only the links that cannot be inferred from local information.
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
A parametric approach to information filtering in complex networks: The P\'olya filter
TLDR
A filtering methodology inspired by the Pólya urn is proposed, a combinatorial model driven by a self-reinforcement mechanism, which relies on a family of null hypotheses that can be calibrated to assess which links are statistically significant with respect to a given network’s own heterogeneity.
Temporal Networks
Analytical maximum-likelihood method to detect patterns in real networks
TLDR
The method reveals that the null behavior of various correlation properties is different from what previously believed, and highly sensitive to the particular network considered, and shows that important structural properties are currently based on incorrect expressions and provides the exact quantities that should replace them.
...
1
2
3
4
5
...