Vito Latora

Bio: Vito Latora is an academic researcher from Queen Mary University of London. The author has contributed to research in topics: Complex network & Centrality. The author has an hindex of 78, co-authored 332 publications receiving 35697 citations. Previous affiliations of Vito Latora include University of Catania & University of Paris.

Network isolators inhibit failure spreading in complex networks.

Abstract: In our daily lives, we rely on the proper functioning of supply networks, from power grids to water transmission systems. A single failure in these critical infrastructures can lead to a complete collapse through a cascading failure mechanism. Counteracting strategies are thus heavily sought after. In this article, we introduce a general framework to analyse the spreading of failures in complex networks and demostrate that not only decreasing but also increasing the connectivity of the network can be an effective method to contain damages. We rigorously prove the existence of certain subgraphs, called network isolators, that can completely inhibit any failure spreading, and we show how to create such isolators in synthetic and real-world networks. The addition of selected links can thus prevent large scale outages as demonstrated for power transmission grids. A single damage can lead to a complete collapse of supply networks due to a cascading failure mechanism. Kaiser et al. show that by adding new connections network isolators can be created, that can inhibit failure spreading relevant for power grids and water transmission systems.

The Olami-Feder-Christensen model on a small-world topology

Abstract: We study the effects of the topology on the Olami-Feder-Christensen (OFC) model, an earthquake model of self-organized criticality. In particular, we consider a 2D square lattice and a random rewiring procedure with a parameter $0

Dynamically induced cascading failures in supply networks

Abstract: Reliable functioning of infrastructure networks is essential for our modern society since the disruption of any communication, transport or supply network poses serious risks to our normal life. Cascading failures, namely events in which the initial and local failure of a component triggers a sequence of multiple failures of other parts of the network, are the main cause of large-scale network outages. Although cascading failures often exhibit dynamical transients, i.e., momentary variations of the state of the system, the modelling of cascades has so far mainly focused on the analysis of sequences of steady states. In this article, we focus on electrical supply networks and introduce a general dynamical framework that takes into consideration both the event-based nature of cascades and the details of the network dynamics. In this way, we account for possible losses of transmission lines and for the dynamical transition from one steady state to the next, which can significantly increase the vulnerability of a network. We find that transients in the flows of a supply network play a crucial role in the emergence of collective behaviors and may cause cascades which cannot be predicted by a steady-state analysis approach. We illustrate our results on a series of network case studies, including the real topology of the national power grids of Spain, France and Great Britain. We finally propose a forecasting method that may help to better understanding the stability conditions of a network, and also to identify its critical lines and components in advance or during an exceptional situation. Overall, our work highlights the relevance of dynamically induced failures on the synchronization dynamics of national power grids of different European countries and it provides novel methods to predict and limit cascading failures.

Unified Treatment of Dynamical Processes on Generalized Networks: Higher-Order, Multilayer, and Temporal Interactions

Abstract: When describing complex interconnected systems, one often has to go beyond the traditional network description to account for generalized interactions. Here, we establish a unified framework to optimally simplify the analysis of cluster synchronization patterns for a wide range of generalized networks, including hypergraphs, multilayer networks, and temporal networks. The framework is based on finding the finest simultaneous block diagonalization (SBD) of the matrices encoding the synchronization pattern and the interaction pattern. As an application, we use the SBD framework to characterize chimera states induced by nonpairwise interactions and by time-varying interactions. The unified framework established here can be extended to other dynamical processes and can facilitate the discovery of novel emergent phenomena in complex systems with generalized interactions.

Social synchronization of brain activity increases during eye-contact

Abstract: Abstract Humans make eye-contact to extract information about other people’s mental states, recruiting dedicated brain networks that process information about the self and others. Recent studies show that eye-contact increases the synchronization between two brains but do not consider its effects on activity within single brains. Here we investigate how eye-contact affects the frequency and direction of the synchronization within and between two brains and the corresponding network characteristics. We also evaluate the functional relevance of eye-contact networks by comparing inter- and intra-brain networks of friends vs. strangers and the direction of synchronization between leaders and followers. We show that eye-contact increases higher inter- and intra-brain synchronization in the gamma frequency band. Network analysis reveals that some brain areas serve as hubs linking within- and between-brain networks. During eye-contact, friends show higher inter-brain synchronization than strangers. Dyads with clear leader/follower roles demonstrate higher synchronization from leader to follower in the alpha frequency band. Importantly, eye-contact affects synchronization between brains more than within brains, demonstrating that eye-contact is an inherently social signal. Future work should elucidate the causal mechanisms behind eye-contact induced synchronization.

I and i

Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

The Structure and Function of Complex Networks

Abstract: Inspired by empirical studies of networked systems such as the Internet, social networks, and biological networks, researchers have in recent years developed a variety of techniques and models to help us understand or predict the behavior of these systems. Here we review developments in this field, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.

Finding and evaluating community structure in networks.

Abstract: We propose and study a set of algorithms for discovering community structure in networks-natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the network to split it into communities, the edges removed being identified using any one of a number of possible "betweenness" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our algorithms are highly effective at discovering community structure in both computer-generated and real-world network data, and show how they can be used to shed light on the sometimes dauntingly complex structure of networked systems.