Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Evaluating the effect of aging on interference resolution with time-varying complex networks analysis.

ABSTRACT: In this study we used graph theory analysis to investigate age-related reorganization of functional networks during the active maintenance of information that is interrupted by external interference. Additionally, we sought to investigate network differences before and after averaging network parameters between both maintenance and interference windows. We compared young and older adults by measuring their magnetoencephalographic recordings during an interference-based working memory task restricted to successful recognitions. Data analysis focused on the topology/temporal evolution of functional networks during both the maintenance and interference windows. We observed that: (a) Older adults require higher synchronization between cortical brain sites in order to achieve a successful recognition, (b) The main differences between age groups arise during the interference window,

SUBMITTER: Ariza P

PROVIDER: S-EPMC4428067 | biostudies-literature | 2015

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Evaluating the effect of aging on interference resolution with time-varying complex networks analysis.

Ariza Pedro P Solesio-Jofre Elena E Martínez Johann H JH Pineda-Pardo José A JA Niso Guiomar G Maestú Fernando F Buldú Javier M JM

Frontiers in human neuroscience 20150512

In this study we used graph theory analysis to investigate age-related reorganization of functional networks during the active maintenance of information that is interrupted by external interference. Additionally, we sought to investigate network differences before and after averaging network parameters between both maintenance and interference windows. We compared young and older adults by measuring their magnetoencephalographic recordings during an interference-based working memory task restri ...[more]

PMID: 26029079

Similar Datasets

Quantifying the effect of temporal resolution on time-varying networks.

Project description:Time-varying networks describe a wide array of systems whose constituents and interactions evolve over time. They are defined by an ordered stream of interactions between nodes, yet they are often represented in terms of a sequence of static networks, each aggregating all edges and nodes present in a time interval of size ?t. In this work we quantify the impact of an arbitrary ?t on the description of a dynamical process taking place upon a time-varying network. We focus on the elementary random walk, and put forth a simple mathematical framework that well describes the behavior observed on real datasets. The analytical description of the bias introduced by time integrating techniques represents a step forward in the correct characterization of dynamical processes on time-varying graphs.

| S-EPMC3801130 | biostudies-literature

Stability and synchronization for discrete-time complex-valued neural networks with time-varying delays.

Project description:In this paper, the synchronization problem for a class of discrete-time complex-valued neural networks with time-varying delays is investigated. Compared with the previous work, the time delay and parameters are assumed to be time-varying. By separating the real part and imaginary part, the discrete-time model of complex-valued neural networks is derived. Moreover, by using the complex-valued Lyapunov-Krasovskii functional method and linear matrix inequality as tools, sufficient conditions of the synchronization stability are obtained. In numerical simulation, examples are presented to show the effectiveness of our method.

| S-EPMC3979734 | biostudies-literature

Activity driven modeling of time varying networks.

Project description:Network modeling plays a critical role in identifying statistical regularities and structural principles common to many systems. The large majority of recent modeling approaches are connectivity driven. The structural patterns of the network are at the basis of the mechanisms ruling the network formation. Connectivity driven models necessarily provide a time-aggregated representation that may fail to describe the instantaneous and fluctuating dynamics of many networks. We address this challenge by defining the activity potential, a time invariant function characterizing the agents' interactions and constructing an activity driven model capable of encoding the instantaneous time description of the network dynamics. The model provides an explanation of structural features such as the presence of hubs, which simply originate from the heterogeneous activity of agents. Within this framework, highly dynamical networks can be described analytically, allowing a quantitative discussion of the biases induced by the time-aggregated representations in the analysis of dynamical processes.

| S-EPMC3384079 | biostudies-other

Epidemic spreading in modular time-varying networks.

Project description:We investigate the effects of modular and temporal connectivity patterns on epidemic spreading. To this end, we introduce and analytically characterise a model of time-varying networks with tunable modularity. Within this framework, we study the epidemic size of Susceptible-Infected-Recovered, SIR, models and the epidemic threshold of Susceptible-Infected-Susceptible, SIS, models. Interestingly, we find that while the presence of tightly connected clusters inhibits SIR processes, it speeds up SIS phenomena. In this case, we observe that modular structures induce a reduction of the threshold with respect to time-varying networks without communities. We confirm the theoretical results by means of extensive numerical simulations both on synthetic graphs as well as on a real modular and temporal network.

| S-EPMC5799280 | biostudies-literature

Dynamical efficiency for multimodal time-varying transportation networks.

Project description:Spatial systems that experience congestion can be modeled as weighted networks whose weights dynamically change over time with the redistribution of flows. This is particularly true for urban transportation networks. The aim of this work is to find appropriate network measures that are able to detect critical zones for traffic congestion and bottlenecks in a transportation system. We propose for both single and multi-layered networks a path-based measure, called dynamical efficiency, which computes the travel time differences under congested and free-flow conditions. The dynamical efficiency quantifies the reachability of a location embedded in the whole urban traffic condition, in lieu of a myopic description based on the average speed of single road segments. In this way, we are able to detect the formation of congestion seeds and visualize their evolution in time as well-defined clusters. Moreover, the extension to multilayer networks allows us to introduce a novel measure of centrality, which estimates the expected usage of inter-modal junctions between two different transportation means. Finally, we define the so-called dilemma factor in terms of number of alternatives that an interconnected transportation system offers to the travelers in exchange for a small increase in travel time. We find macroscopic relations between the percentage of extra-time, number of alternatives and level of congestion, useful to quantify the richness of trip choices that a city offers. As an illustrative example, we show how our methods work to study the real network of a megacity with probe traffic data.

| S-EPMC8630039 | biostudies-literature

Renormalization group theory for percolation in time-varying networks.

Project description:Motivated by multi-hop communication in unreliable wireless networks, we present a percolation theory for time-varying networks. We develop a renormalization group theory for a prototypical network on a regular grid, where individual links switch stochastically between active and inactive states. The question whether a given source node can communicate with a destination node along paths of active links is equivalent to a percolation problem. Our theory maps the temporal existence of multi-hop paths on an effective two-state Markov process. We show analytically how this Markov process converges towards a memoryless Bernoulli process as the hop distance between source and destination node increases. Our work extends classical percolation theory to the dynamic case and elucidates temporal correlations of message losses. Quantification of temporal correlations has implications for the design of wireless communication and control protocols, e.g. in cyber-physical systems such as self-organized swarms of drones or smart traffic networks.

| S-EPMC5964206 | biostudies-literature

Time varying networks and the weakness of strong ties.

Project description:In most social and information systems the activity of agents generates rapidly evolving time-varying networks. The temporal variation in networks' connectivity patterns and the ongoing dynamic processes are usually coupled in ways that still challenge our mathematical or computational modelling. Here we analyse a mobile call dataset and find a simple statistical law that characterize the temporal evolution of users' egocentric networks. We encode this observation in a reinforcement process defining a time-varying network model that exhibits the emergence of strong and weak ties. We study the effect of time-varying and heterogeneous interactions on the classic rumour spreading model in both synthetic, and real-world networks. We observe that strong ties severely inhibit information diffusion by confining the spreading process among agents with recurrent communication patterns. This provides the counterintuitive evidence that strong ties may have a negative role in the spreading of information across networks.

| S-EPMC3918922 | biostudies-literature

Synchronization in time-varying random networks with vanishing connectivity.

Project description:A sufficiently connected topology linking the constituent units of a complex system is usually seen as a prerequisite for the emergence of collective phenomena such as synchronization. We present a random network of heterogeneous phase oscillators in which the links mediating the interactions are constantly rearranged with a characteristic timescale and, possibly, an extremely low instantaneous connectivity. We show that with strong coupling and sufficiently fast rewiring the network reaches partial synchronization even in the vanishing connectivity limit. In particular, we provide an approximate analytical argument, based on the comparison between the different characteristic timescales of our system in the low connectivity regime, which is able to predict the transition to synchronization threshold with satisfactory precision beyond the formal fast rewiring limit. We interpret our results as a qualitative mechanism for emergence of consensus in social communities. In particular, our result suggest that groups of individuals are capable of aligning their opinions under extremely sparse exchanges of views, which is reminiscent of fast communications that take place in the modern social media. Our results may also be relevant to characterize the onset of collective behavior in engineered systems of mobile units with limited wireless capabilities.

| S-EPMC6629696 | biostudies-literature

Mixed-Effect Time-Varying Network Model and Application in Brain Connectivity Analysis.

Project description:Time-varying networks are fast emerging in a wide range of scientific and business applications. Most existing dynamic network models are limited to a single-subject and discrete-time setting. In this article, we propose a mixed-effect network model that characterizes the continuous time-varying behavior of the network at the population level, meanwhile taking into account both the individual subject variability as well as the prior module information. We develop a multistep optimization procedure for a constrained likelihood estimation and derive the associated asymptotic properties. We demonstrate the effectiveness of our method through both simulations and an application to a study of brain development in youth. Supplementary materials for this article are available online.

| S-EPMC8314561 | biostudies-literature

Time-Varying Networks of Inter-Ictal Discharging Reveal Epileptogenic Zone.

Project description:The neuronal synchronous discharging may cause an epileptic seizure. Currently, most of the studies conducted to investigate the mechanism of epilepsy are based on EEGs or functional magnetic resonance imaging (fMRI) recorded during the ictal discharging or the resting-state, and few studies have probed into the dynamic patterns during the inter-ictal discharging that are much easier to record in clinical applications. Here, we propose a time-varying network analysis based on adaptive directed transfer function to uncover the dynamic brain network patterns during the inter-ictal discharging. In addition, an algorithm based on the time-varying outflow of information derived from the network analysis is developed to detect the epileptogenic zone. The analysis performed revealed the time-varying network patterns during different stages of inter-ictal discharging; the epileptogenic zone was activated prior to the discharge onset then worked as the source to propagate the activity to other brain regions. Consistence between the epileptogenic zones detected by our proposed approach and the actual epileptogenic zones proved that time-varying network analysis could not only reveal the underlying neural mechanism of epilepsy, but also function as a useful tool in detecting the epileptogenic zone based on the EEGs in the inter-ictal discharging.

| S-EPMC5563307 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data