171,281 research outputs found
Constrained information flows in temporal networks reveal intermittent communities
Many real-world networks represent dynamic systems with interactions that
change over time, often in uncoordinated ways and at irregular intervals. For
example, university students connect in intermittent groups that repeatedly
form and dissolve based on multiple factors, including their lectures,
interests, and friends. Such dynamic systems can be represented as multilayer
networks where each layer represents a snapshot of the temporal network. In
this representation, it is crucial that the links between layers accurately
capture real dependencies between those layers. Often, however, these
dependencies are unknown. Therefore, current methods connect layers based on
simplistic assumptions that do not capture node-level layer dependencies. For
example, connecting every node to itself in other layers with the same weight
can wipe out dependencies between intermittent groups, making it difficult or
even impossible to identify them. In this paper, we present a principled
approach to estimating node-level layer dependencies based on the network
structure within each layer. We implement our node-level coupling method in the
community detection framework Infomap and demonstrate its performance compared
to current methods on synthetic and real temporal networks. We show that our
approach more effectively constrains information inside multilayer communities
so that Infomap can better recover planted groups in multilayer benchmark
networks that represent multiple modes with different groups and better
identify intermittent communities in real temporal contact networks. These
results suggest that node-level layer coupling can improve the modeling of
information spreading in temporal networks and better capture intermittent
community structure.Comment: 10 pages, 10 figures, published in PR
Flow of temporal network properties under local aggregation and time shuffling: a tool for characterizing, comparing and classifying temporal networks
Although many tools have been developed and employed to characterize temporal
networks, the issue of how to compare them remains largely open. It depends
indeed on what features are considered as relevant, and on the way the
differences in these features are quantified. In this paper, we propose to
characterize temporal networks through their behaviour under general
transformations that are local in time: (i) a local time shuffling, which
destroys correlations at time scales smaller than a given scale , while
preserving large time scales, and (ii) a local temporal aggregation on time
windows of length . By varying and , we obtain a flow of temporal
networks, and flows of observable values, which encode the phenomenology of the
temporal network on multiple time scales. We use a symbolic approach to
summarize these flows into labels (strings of characters) describing their
trends. These labels can then be used to compare temporal networks, validate
models, or identify groups of networks with similar labels. Our procedure can
be applied to any temporal network and with an arbitrary set of observables,
and we illustrate it on an ensemble of data sets describing face-to-face
interactions in various contexts, including both empirical and synthetic data
A Markov model for inferring flows in directed contact networks
Directed contact networks (DCNs) are a particularly flexible and convenient
class of temporal networks, useful for modeling and analyzing the transfer of
discrete quantities in communications, transportation, epidemiology, etc.
Transfers modeled by contacts typically underlie flows that associate multiple
contacts based on their spatiotemporal relationships. To infer these flows, we
introduce a simple inhomogeneous Markov model associated to a DCN and show how
it can be effectively used for data reduction and anomaly detection through an
example of kernel-level information transfers within a computer.Comment: 12 page
Probabilistic Motion Estimation Based on Temporal Coherence
We develop a theory for the temporal integration of visual motion motivated
by psychophysical experiments. The theory proposes that input data are
temporally grouped and used to predict and estimate the motion flows in the
image sequence. This temporal grouping can be considered a generalization of
the data association techniques used by engineers to study motion sequences.
Our temporal-grouping theory is expressed in terms of the Bayesian
generalization of standard Kalman filtering. To implement the theory we derive
a parallel network which shares some properties of cortical networks. Computer
simulations of this network demonstrate that our theory qualitatively accounts
for psychophysical experiments on motion occlusion and motion outliers.Comment: 40 pages, 7 figure
Spatio-temporal networks: reachability, centrality and robustness
Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded. Through numerical experiments on three real-world urban transport systems, we study the effect of node failure on a network's topological, temporal and spatial structure. We also demonstrate the broader applicability of this framework to three other classes of network. To identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network. This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks
TemporalRI: subgraph isomorphism in temporal networks with multiple contacts
AbstractTemporal networks are graphs where each edge is associated with a timestamp denoting when two nodes interact. Temporal Subgraph Isomorphism (TSI) aims at retrieving all the subgraphs of a temporal network (called target) matching a smaller temporal network (called query), such that matched target edges appear in the same chronological order of corresponding query edges. Few algorithms have been proposed to solve the TSI problem (or variants of it) and most of them are applicable only to small or specific queries. In this paper we present TemporalRI, a new subgraph isomorphism algorithm for temporal networks with multiple contacts between nodes, which is inspired by RI algorithm. TemporalRI introduces the notion of temporal flows and uses them to filter the search space of candidate nodes for the matching. Our algorithm can handle queries of any size and any topology. Experiments on real networks of different sizes show that TemporalRI is very efficient compared to the state-of-the-art, especially for large queries and targets
- …