White matter abnormalities associated with Alzheimer's disease and mild cognitive impairment: A critical review of MRI studies

In this article, the authors aim to present a critical review of recent MRI studies addressing white matter (WM) abnormalities in Alzheimer's disease (AD) and mild cognitive impairment (MCI), by searching PubMed and reviewing MRI studies evaluating subjects with AD or MCI using WM volumetric methods, diffusion tensor imaging and assessment of WM hyperintensities. Studies have found that, compared with healthy controls, AD and MCI samples display WM volumetric reductions and diffusion tensor imaging findings suggestive of reduced WM integrity. These changes affect complex networks relevant to episodic memory and other cognitive processes, including fiber connections that directly link medial temporal structures and the corpus callosum. Abnormalities in cortico-cortical and cortico-subcortical WM interconnections are associated with an increased risk of progression from MCI to dementia. It can be concluded that WM abnormalities are detectable in early stages of AD and MCI. Degeneration of WM networks causes disconnection among neural cells and the degree of such changes is related to cognitive decline. © 2013 2013 Expert Reviews Ltd.

Role of interstitial pinning in the dynamical phases of vortices in superconducting films

We analyze the vortex dynamics in superconducting thin films with a periodic array of pinning centers. In particular, we study the effect of anisotropy for a Kagomé pinning network when longitudinal and transverse transport currents are applied. By solving the equations of motion for the vortex array numerically at zero temperature, we find different phases for the vortex dynamics, depending on the pinning and driving force. An unusual sequence of peaks for driving force along and perpendicular to the main lattice axes is observed for the differential resistance, reflecting the anisotropy of the transport properties and the complex behavior of the vortex system. This behavior may be understood in terms of interstitial pinning vacancies, which create channels of vortices with different pinning strengths. © 2012 Springer Science+Business Media, LLC.

Consuming viscous prey: a novel protein-secreting delivery system in neotropical snail-eating snakes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Beta Diversity of Plant-Pollinator Networks and the Spatial Turnover of Pairwise Interactions

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Emprego de redes complexas para modelar e analisar a disseminação de microrganismos da familia enterobacteriaceae em pacientes mantidos em unidades de terapia intensiva

Nowadays the studies of different methodologies to interfere in the growing and spread of serious infections and systemic status in institutionalized patients those kept on intensive therapy units are relevant to understanding these complex systems and bring benefits to several health areas, particularly public health. In this study, it was analyzed the clinical and microbiological data from patients hospitalized in intensive therapy units. The interaction between patients and caregivers was modeled and analyzed using dynamic system model and complex network theory, identifying outbreaks values of microorganisms of Enterobacteriaceae Family.

Explosive synchronization enhanced by time-delayed coupling

This paper deals with the emergence of explosive synchronization in scale-free networks by considering the Kuramoto model of coupled phase oscillators. The natural frequencies of oscillators are assumed to be correlated with their degrees, and a time delay is included in the system. This assumption allows enhancing the explosive transition to reach a synchronous state. We provide an analytical treatment developed in a star graph, which reproduces results obtained in scale-free networks. Our findings have important implications in understanding the synchronization of complex networks since the time delay is present in most real-world complex systems due to the finite speed of the signal transmission over a distance.

Predicting epidemic outbreak from individual features of the spreaders

Knowing which individuals can be more efficient in spreading a pathogen throughout a determinate environment is a fundamental question in disease control. Indeed, over recent years the spread of epidemic diseases and its relationship with the topology of the involved system have been a recurrent topic in complex network theory, taking into account both network models and real-world data. In this paper we explore possible correlations between the heterogeneous spread of an epidemic disease governed by the susceptible-infected-recovered (SIR) model, and several attributes of the originating vertices, considering Erdos-Renyi (ER), Barabasi-Albert (BA) and random geometric graphs (RGG), as well as a real case study, the US air transportation network, which comprises the 500 busiest airports in the US along with inter-connections. Initially, the heterogeneity of the spreading is achieved by considering the RGG networks, in which we analytically derive an expression for the distribution of the spreading rates among the established contacts, by assuming that such rates decay exponentially with the distance that separates the individuals. Such a distribution is also considered for the ER and BA models, where we observe topological effects on the correlations. In the case of the airport network, the spreading rates are empirically defined, assumed to be directly proportional to the seat availability. Among both the theoretical and real networks considered, we observe a high correlation between the total epidemic prevalence and the degree, as well as the strength and the accessibility of the epidemic sources. For attributes such as the betweenness centrality and the k-shell index, however, the correlation depends on the topology considered.

Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution

The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

Complex network classification using partially self-avoiding deterministic walks

Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex network classification relies on the use of representative measurements that describe topological structures. Although there are a large number of measurements, most of them are correlated. To overcome this limitation, this paper presents a new measurement for complex network classification based on partially self-avoiding walks. We validate the measurement on a data set composed by 40000 complex networks of four well-known models. Our results indicate that the proposed measurement improves correct classification of networks compared to the traditional ones. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4737515]

First-principles studies of complex magnetism in Mn nanostructures on the Fe(001) surface

The magnetic properties of Mn nanostructures on the Fe(001) surface have been studied using the noncollinear first-principles real space-linear muffin-tin orbital-atomic sphere approximation method within density-functional theory. We have considered a variety of nanostructures such as adsorbed wires, pyramids, and flat and intermixed clusters of sizes varying from two to nine atoms. Our calculations of interatomic exchange interactions reveal the long-range nature of exchange interactions between Mn-Mn and Mn-Fe atoms. We have found that the strong dependence of these interactions on the local environment, the magnetic frustration, and the effect of spin-orbit coupling lead to the possibility of realizing complex noncollinear magnetic structures such as helical spin spiral and half-skyrmion.

A decaying factor accounts for contained activity in neuronal networks with no need of hierarchical or modular organization

The mechanisms responsible for containing activity in systems represented by networks are crucial in various phenomena, for example, in diseases such as epilepsy that affect the neuronal networks and for information dissemination in social networks. The first models to account for contained activity included triggering and inhibition processes, but they cannot be applied to social networks where inhibition is clearly absent. A recent model showed that contained activity can be achieved with no need of inhibition processes provided that the network is subdivided into modules (communities). In this paper, we introduce a new concept inspired in the Hebbian theory, through which containment of activity is achieved by incorporating a dynamics based on a decaying activity in a random walk mechanism preferential to the node activity. Upon selecting the decay coefficient within a proper range, we observed sustained activity in all the networks tested, namely, random, Barabasi-Albert and geographical networks. The generality of this finding was confirmed by showing that modularity is no longer needed if the dynamics based on the integrate-and-fire dynamics incorporated the decay factor. Taken together, these results provide a proof of principle that persistent, restrained network activation might occur in the absence of any particular topological structure. This may be the reason why neuronal activity does not spread out to the entire neuronal network, even when no special topological organization exists.

Network-based stochastic semisupervised learning

Semisupervised learning is a machine learning approach that is able to employ both labeled and unlabeled samples in the training process. In this paper, we propose a semisupervised data classification model based on a combined random-preferential walk of particles in a network (graph) constructed from the input dataset. The particles of the same class cooperate among themselves, while the particles of different classes compete with each other to propagate class labels to the whole network. A rigorous model definition is provided via a nonlinear stochastic dynamical system and a mathematical analysis of its behavior is carried out. A numerical validation presented in this paper confirms the theoretical predictions. An interesting feature brought by the competitive-cooperative mechanism is that the proposed model can achieve good classification rates while exhibiting low computational complexity order in comparison to other network-based semisupervised algorithms. Computer simulations conducted on synthetic and real-world datasets reveal the effectiveness of the model.

Three-feature model to reproduce the topology of citation networks and the effects from authors' visibility on their h-index

Various factors are believed to govern the selection of references in citation networks, but a precise, quantitative determination of their importance has remained elusive. In this paper, we show that three factors can account for the referencing pattern of citation networks for two topics, namely "graphenes" and "complex networks", thus allowing one to reproduce the topological features of the networks built with papers being the nodes and the edges established by citations. The most relevant factor was content similarity, while the other two - in-degree (i.e. citation counts) and age of publication - had varying importance depending on the topic studied. This dependence indicates that additional factors could play a role. Indeed, by intuition one should expect the reputation (or visibility) of authors and/or institutions to affect the referencing pattern, and this is only indirectly considered via the in-degree that should correlate with such reputation. Because information on reputation is not readily available, we simulated its effect on artificial citation networks considering two communities with distinct fitness (visibility) parameters. One community was assumed to have twice the fitness value of the other, which amounts to a double probability for a paper being cited. While the h-index for authors in the community with larger fitness evolved with time with slightly higher values than for the control network (no fitness considered), a drastic effect was noted for the community with smaller fitness. (C) 2012 Elsevier Ltd. All rights reserved.

Determination of the critical coupling of explosive synchronization transitions in scale-free networks by mean-field approximations

An explosive synchronization can be observed in scale-free networks when Kuramoto oscillators have natural frequencies equal to their number of connections. The present paper reports on mean-field approximations to determine the critical coupling of such explosive synchronization. It has been verified that the equation obtained for the critical coupling has an inverse dependence on the network average degree. This expression differs from those whose frequency distributions are unimodal and even. In this case, the critical coupling depends on the ratio between the first and second statistical moments of the degree distribution. Numerical simulations were also conducted to verify our analytical results.

Complex stochastic boolean systems: comparing bitstrings with the same hamming weight

[EN]A complex stochastic Boolean system (CSBS) is a complex system depending on an arbitrarily large number