An official website of the United States government
Abstract Dynamic community detection provides a coherent description of network clusters over time, allowing one to track the growth and death of communities as the network evolves. However, modularity maximization, a popular method for performing multilayer community detection, requires the specification of an appropriate null network as well as resolution and interlayer coupling parameters. Importantly, the ability of the algorithm to accurately detect community evolution is dependent on the choice of these parameters. In functional temporal networks, where evolving communities reflect changing functional relationships between network nodes, it is especially important that the detected communities reflect any state changes of the system. Here, we present analytical work suggesting that a uniform null network provides improved sensitivity to the detection of small evolving communities in temporal networks with positive edge weights bounded above by 1, such as certain types of correlation networks. We then propose a method for increasing the sensitivity of modularity maximization to state changes in nodal dynamics by modelling self-identity links between layers based on the self-similarity of the network nodes between layers. This method is more appropriate for functional temporal networks from both a modelling and mathematical perspective, as it incorporates the dynamic nature of network nodes. We motivate our method based on applications in neuroscience where network nodes represent neurons and functional edges represent similarity of firing patterns in time. We show that in simulated data sets of neuronal spike trains, updating interlayer links based on the firing properties of the neurons provides superior community detection of evolving network structure when groups of neurons change their firing properties over time. Finally, we apply our method to experimental calcium imaging data that monitors the spiking activity of hundreds of neurons to track the evolution of neuronal communities during a state change from the awake to anaesthetized state.
more »
« less
Detecting Dynamic States of Temporal Networks Using Connection Series Tensors
Many temporal networks exhibit multiple system states, such as weekday and weekend patterns in social contact networks. The detection of such distinct states in temporal network data has recently been studied as it helps reveal underlying dynamical processes. A commonly used method is network aggregation over a time window, which aggregates a subsequence of multiple network snapshots into one static network. This method, however, necessarily discards temporal dynamics within the time window. Here we propose a new method for detecting dynamic states in temporal networks using connection series (i.e., time series of connection status) between nodes. Our method consists of the construction of connection series tensors over nonoverlapping time windows, similarity measurement between these tensors, and community detection in the similarity network of those time windows. Experiments with empirical temporal network data demonstrated that our method outperformed the conventional approach using simple network aggregation in revealing interpretable system states. In addition, our method allows users to analyze hierarchical temporal structures and to uncover dynamic states at different spatial/temporal resolutions.
more »
« less
- Award ID(s):
- 1734147
- PAR ID:
- 10301398
- Editor(s):
- De Lellis, Pietro
- Date Published:
- Journal Name:
- Complexity
- Volume:
- 2020
- ISSN:
- 1076-2787
- Page Range / eLocation ID:
- 1 to 15
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Demeniconi, C.; Davidson, I (Ed.)Many irregular domains such as social networks, financial transactions, neuron connections, and natural language constructs are represented using graph structures. In recent years, a variety of graph neural networks (GNNs) have been successfully applied for representation learning and prediction on such graphs. In many of the real-world applications, the underlying graph changes over time, however, most of the existing GNNs are inadequate for handling such dynamic graphs. In this paper we propose a novel technique for learning embeddings of dynamic graphs using a tensor algebra framework. Our method extends the popular graph convolutional network (GCN) for learning representations of dynamic graphs using the recently proposed tensor M-product technique. Theoretical results presented establish a connection between the proposed tensor approach and spectral convolution of tensors. The proposed method TM-GCN is consistent with the Message Passing Neural Network (MPNN) framework, accounting for both spatial and temporal message passing. Numerical experiments on real-world datasets demonstrate the performance of the proposed method for edge classification and link prediction tasks on dynamic graphs. We also consider an application related to the COVID-19 pandemic, and show how our method can be used for early detection of infected individuals from contact tracing data.more » « less
-
ABSTRACT Spontaneous neural activity coherently relays information across the brain. Several efforts have been made to understand how spontaneous neural activity evolves at the macro‐scale level as measured by resting‐state functional magnetic resonance imaging (rsfMRI). Previous studies observe the global patterns and flow of information in rsfMRI using methods such as sliding window or temporal lags. However, to our knowledge, no studies have examined spatial propagation patterns evolving with time across multiple overlapping 4D networks. Here, we propose a novel approach to study how dynamic states of the brain networks spatially propagate and evaluate whether these propagating states contain information relevant to mental illness. We implement a lagged windowed correlation approach to capture voxel‐wise network‐specific spatial propagation patterns in dynamic states. Results show systematic spatial state changes over time, which we confirmed are replicable across multiple scan sessions using human connectome project data. We observe networks varying in propagation speed; for example, the default mode network (DMN) propagates slowly and remains positively correlated with blood oxygenation level‐dependent (BOLD) signal for 6–8 s, whereas the visual network propagates much quicker. We also show that summaries of network‐specific propagative patterns are linked to schizophrenia. More specifically, we find significant group differences in multiple dynamic parameters between patients with schizophrenia and controls within four large‐scale networks: default mode, temporal lobe, subcortical, and visual network. Individuals with schizophrenia spend more time in certain propagating states. In summary, this study introduces a promising general approach to exploring the spatial propagation in dynamic states of brain networks and their associated complexity and reveals novel insights into the neurobiology of schizophrenia.more » « less
-
This work presents a framework for studying temporal networks using zigzag persistence, a tool from the field of Topological Data Analysis (TDA). The resulting approach is general and applicable to a wide variety of time-varying graphs. For example, these graphs may correspond to a system modeled as a network with edges whose weights are functions of time, or they may represent a time series of a complex dynamical system. We use simplicial complexes to represent snapshots of the temporal networks that can then be analyzed using zigzag persistence. We show two applications of our method to dynamic networks: an analysis of commuting trends on multiple temporal scales, e.g., daily and weekly, in the Great Britain transportation network, and the detection of periodic/chaotic transitions due to intermittency in dynamical systems represented by temporal ordinal partition networks. Our findings show that the resulting zero- and one-dimensional zigzag persistence diagrams can detect changes in the networks’ shapes that are missed by traditional connectivity and centrality graph statistics.more » « less
-
Abstract Representing data using time-resolved networks is valuable for analyzing functional data of the human brain. One commonly used method for constructing time-resolved networks from data is sliding window Pearson correlation (SWPC). One major limitation of SWPC is that it applies a high-pass filter to the activity time series. Therefore, if we select a short window (desirable to estimate rapid changes in connectivity), we will remove important low-frequency information. Here, we propose an approach based on single sideband modulation (SSB) in communication theory. This allows us to select shorter windows to capture rapid changes in the time-resolved functional network connectivity (trFNC). We use simulation and real resting-state functional magnetic resonance imaging (fMRI) data to demonstrate the superior performance of SSB+SWPC compared to SWPC. We also compare the recurring trFNC patterns between individuals with the first episode of psychosis (FEP) and typical controls (TC) and show that FEPs stay more in states that show weaker connectivity across the whole brain. A result exclusive to SSB+SWPC is that TCs stay more in a state with negative connectivity between subcortical and cortical regions. Based on all the results, we argue that SSB+SWPC is more sensitive for capturing temporal variation in trFNC.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1155/2020/9649310
