231,604 research outputs found
Mining Time-aware Actor-level Evolution Similarity for Link Prediction in Dynamic Network
Topological evolution over time in a dynamic network triggers both the addition and deletion of actors and the links among them. A dynamic network can be represented as a time series of network snapshots where each snapshot represents the state of the network over an interval of time (for example, a minute, hour or day). The duration of each snapshot denotes the temporal scale/sliding window of the dynamic network and all the links within the duration of the window are aggregated together irrespective of their order in time. The inherent trade-off in selecting the timescale in analysing dynamic networks is that choosing a short temporal window may lead to chaotic changes in network topology and measures (for example, the actors’ centrality measures and the average path length); however, choosing a long window may compromise the study and the investigation of network dynamics. Therefore, to facilitate the analysis and understand different patterns of actor-oriented evolutionary aspects, it is necessary to define an optimal window length (temporal duration) with which to sample a dynamic network. In addition to determining the optical temporal duration, another key task for understanding the dynamics of evolving networks is being able to predict the likelihood of future links among pairs of actors given the existing states of link structure at present time. This phenomenon is known as the link prediction problem in network science. Instead of considering a static state of a network where the associated topology does not change, dynamic link prediction attempts to predict emerging links by considering different types of historical/temporal information, for example the different types of temporal evolutions experienced by the actors in a dynamic network due to the topological evolution over time, known as actor dynamicities. Although there has been some success in developing various methodologies and metrics for the purpose of dynamic link prediction, mining actor-oriented evolutions to address this problem has received little attention from the research community. In addition to this, the existing methodologies were developed without considering the sampling window size of the dynamic network, even though the sampling duration has a large impact on mining the network dynamics of an evolutionary network. Therefore, although the principal focus of this thesis is link prediction in dynamic networks, the optimal sampling window determination was also considered
Temporal connectivity in finite networks with non-uniform measures
Soft Random Geometric Graphs (SRGGs) have been widely applied to various
models including those of wireless sensor, communication, social and neural
networks. SRGGs are constructed by randomly placing nodes in some space and
making pairwise links probabilistically using a connection function that is
system specific and usually decays with distance. In this paper we focus on the
application of SRGGs to wireless communication networks where information is
relayed in a multi hop fashion, although the analysis is more general and can
be applied elsewhere by using different distributions of nodes and/or
connection functions. We adopt a general non-uniform density which can model
the stationary distribution of different mobility models, with the interesting
case being when the density goes to zero along the boundaries. The global
connectivity properties of these non-uniform networks are likely to be
determined by highly isolated nodes, where isolation can be caused by the
spatial distribution or the local geometry (boundaries). We extend the analysis
to temporal-spatial networks where we fix the underlying non-uniform
distribution of points and the dynamics are caused by the temporal variations
in the link set, and explore the probability a node near the corner is isolated
at time . This work allows for insight into how non-uniformity (caused by
mobility) and boundaries impact the connectivity features of temporal-spatial
networks. We provide a simple method for approximating these probabilities for
a range of different connection functions and verify them against simulations.
Boundary nodes are numerically shown to dominate the connectivity properties of
these finite networks with non-uniform measure.Comment: 13 Pages - 4 figure
Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A survey
Dynamic networks are used in a wide range of fields, including social network
analysis, recommender systems, and epidemiology. Representing complex networks
as structures changing over time allow network models to leverage not only
structural but also temporal patterns. However, as dynamic network literature
stems from diverse fields and makes use of inconsistent terminology, it is
challenging to navigate. Meanwhile, graph neural networks (GNNs) have gained a
lot of attention in recent years for their ability to perform well on a range
of network science tasks, such as link prediction and node classification.
Despite the popularity of graph neural networks and the proven benefits of
dynamic network models, there has been little focus on graph neural networks
for dynamic networks. To address the challenges resulting from the fact that
this research crosses diverse fields as well as to survey dynamic graph neural
networks, this work is split into two main parts. First, to address the
ambiguity of the dynamic network terminology we establish a foundation of
dynamic networks with consistent, detailed terminology and notation. Second, we
present a comprehensive survey of dynamic graph neural network models using the
proposed terminologyComment: 28 pages, 9 figures, 8 table
Multiscale Analysis of Spreading in a Large Communication Network
In temporal networks, both the topology of the underlying network and the
timings of interaction events can be crucial in determining how some dynamic
process mediated by the network unfolds. We have explored the limiting case of
the speed of spreading in the SI model, set up such that an event between an
infectious and susceptible individual always transmits the infection. The speed
of this process sets an upper bound for the speed of any dynamic process that
is mediated through the interaction events of the network. With the help of
temporal networks derived from large scale time-stamped data on mobile phone
calls, we extend earlier results that point out the slowing-down effects of
burstiness and temporal inhomogeneities. In such networks, links are not
permanently active, but dynamic processes are mediated by recurrent events
taking place on the links at specific points in time. We perform a multi-scale
analysis and pinpoint the importance of the timings of event sequences on
individual links, their correlations with neighboring sequences, and the
temporal pathways taken by the network-scale spreading process. This is
achieved by studying empirically and analytically different characteristic
relay times of links, relevant to the respective scales, and a set of temporal
reference models that allow for removing selected time-domain correlations one
by one
Activity clocks: spreading dynamics on temporal networks of human contact
Dynamical processes on time-varying complex networks are key to understanding
and modeling a broad variety of processes in socio-technical systems. Here we
focus on empirical temporal networks of human proximity and we aim at
understanding the factors that, in simulation, shape the arrival time
distribution of simple spreading processes. Abandoning the notion of wall-clock
time in favour of node-specific clocks based on activity exposes robust
statistical patterns in the arrival times across different social contexts.
Using randomization strategies and generative models constrained by data, we
show that these patterns can be understood in terms of heterogeneous
inter-event time distributions coupled with heterogeneous numbers of events per
edge. We also show, both empirically and by using a synthetic dataset, that
significant deviations from the above behavior can be caused by the presence of
edge classes with strong activity correlations
Temporal similarity metrics for latent network reconstruction: The role of time-lag decay
When investigating the spreading of a piece of information or the diffusion
of an innovation, we often lack information on the underlying propagation
network. Reconstructing the hidden propagation paths based on the observed
diffusion process is a challenging problem which has recently attracted
attention from diverse research fields. To address this reconstruction problem,
based on static similarity metrics commonly used in the link prediction
literature, we introduce new node-node temporal similarity metrics. The new
metrics take as input the time-series of multiple independent spreading
processes, based on the hypothesis that two nodes are more likely to be
connected if they were often infected at similar points in time. This
hypothesis is implemented by introducing a time-lag function which penalizes
distant infection times. We find that the choice of this time-lag strongly
affects the metrics' reconstruction accuracy, depending on the network's
clustering coefficient and we provide an extensive comparative analysis of
static and temporal similarity metrics for network reconstruction. Our findings
shed new light on the notion of similarity between pairs of nodes in complex
networks
Complex temporal patterns processing by a neural mass model of a cortical column
It is well known that neuronal networks are capable of transmitting complex spatiotemporal information in the form of precise sequences of neuronal discharges characterized by recurrent patterns. At the same time, the synchronized activity of large ensembles produces local field potentials that propagate through highly dynamic oscillatory waves, such that, at the whole brain scale, complex spatiotemporal dynamics of electroencephalographic (EEG) signals may be associated to sensorimotor decision making processes. Despite these experimental evidences, the link between highly temporally organized input patterns and EEG waves has not been studied in detail. Here, we use a neural mass model to investigate to what extent precise temporal information, carried by deterministic nonlinear attractor mappings, is filtered and transformed into fluctuations in phase, frequency and amplitude of oscillatory brain activity. The phase shift that we observe, when we drive the neural mass model with specific chaotic inputs, shows that the local field potential amplitude peak appears in less than one full cycle, thus allowing traveling waves to encode temporal information. After converting phase and amplitude changes obtained into point processes, we quantify input–output similarity following a threshold-filtering algorithm onto the amplitude wave peaks. Our analysis shows that the neural mass model has the capacity for gating the input signal and propagate selected temporal features of that signal. Finally, we discuss the effect of local excitatory/inhibitory balance on these results and how excitability in cortical columns, controlled by neuromodulatory innervation of the cerebral cortex, may contribute to set a fine tuning and gating of the information fed to the cortex.Peer ReviewedPostprint (author's final draft
Temporal Fidelity in Dynamic Social Networks
It has recently become possible to record detailed social interactions in
large social systems with high resolution. As we study these datasets, human
social interactions display patterns that emerge at multiple time scales, from
minutes to months. On a fundamental level, understanding of the network
dynamics can be used to inform the process of measuring social networks. The
details of measurement are of particular importance when considering dynamic
processes where minute-to-minute details are important, because collection of
physical proximity interactions with high temporal resolution is difficult and
expensive. Here, we consider the dynamic network of proximity-interactions
between approximately 500 individuals participating in the Copenhagen Networks
Study. We show that in order to accurately model spreading processes in the
network, the dynamic processes that occur on the order of minutes are essential
and must be included in the analysis
- …