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

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

http://www.maths.qmul.ac.uk/%7Elatora/report_06.pdf

Complex networks: Structure and dynamics

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.

/pdf/community-detection-in-graphs-34rogm3r6p.pdf

Community detection in graphs

I have developed "tennis elbow" from lugging this book around the past four weeks, but it is worth the pain, the effort, and the aspirin. It is also worth the (relatively speaking) bargain price. Including appendixes, this book contains 894 pages of text. The entire panorama of the neural sciences is surveyed and examined, and it is comprehensive in its scope, from genomes to social behaviors. The editors explicitly state that the book is designed as "an introductory text for students of biology, behavior, and medicine," but it is hard to imagine any audience, interested in any fragment of neuroscience at any level of sophistication, that would not enjoy this book. The editors have done a masterful job of weaving together the biologic, the behavioral, and the clinical sciences into a single tapestry in which everyone from the molecular biologist to the practicing psychiatrist can find and appreciate his or

Principles of Neural Science

Small-world and scale-free networks are known to be more easily synchronized than regular lattices, which is usually attributed to the smaller network distance between oscillators. Surprisingly, we find that networks with a homogeneous distribution of connectivity are more synchronizable than heterogeneous ones, even though the average network distance is larger. We present numerical computations and analytical estimates on synchronizability of the network in terms of its heterogeneity parameters. Our results suggest that some degree of homogeneity is expected in naturally evolved structures, such as neural networks, where synchronizability is desirable.

/pdf/heterogeneity-in-oscillator-networks-are-smaller-worlds-1z9n8stc5r.pdf

Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?

Power-grid networks must be synchronized in order to function. A condition for the stability of the synchronous state enables identification of network parameters that enhance spontaneous synchronization—heralding the possibility of smart grids that operate optimally in real-world systems.

Spontaneous synchrony in power-grid networks

INTRODUCTION Cascading failures in power grids are inherently network processes, in which an initially small perturbation leads to a sequence of failures that spread through the connections between system components. An unresolved problem in preventing major blackouts has been to distinguish disturbances that cause large cascades from seemingly identical ones that have only mild effects. Modeling and analyzing such processes are challenging when the system is large and its operating condition varies widely across different years, seasons, and power demand levels. RATIONALE Multicondition analysis of cascade vulnerability is needed to answer several key questions: Under what conditions would an initial disturbance remain localized rather than cascade through the network? Which network components are most vulnerable to failures across various conditions? What is the role of the network structure in determining component vulnerability and cascade sizes? To address these questions and differentiate cascading-causing disturbances, we formulated an electrical-circuit network representation of the U.S.–South Canada power grid—a large-scale network with more than 100,000 transmission lines—for a wide range of operating conditions. We simulated cascades in this system by means of a dynamical model that accounts for transmission line failures due to overloads and the resulting power flow reconfigurations. RESULTS To quantify cascade vulnerability, we estimated the probability that each transmission line fails in a cascade. Aggregating the results from multiple conditions into a single network representation, we created a systemwide vulnerability map, which exhibits relatively homogeneous geographical distribution of power outages but highly heterogeneous distribution of the underlying overload failures. Topological analysis of the network representation revealed that the transmission lines vulnerable to overload failures tend to occupy the network’s core, characterized by links between highly connected nodes. We found that only a small fraction of the transmission lines in the network (well below 1% on average) are vulnerable under a given condition. When measured in terms of node-to-node distance and geographical distance, individual cascades often propagate far from the triggering failures, but the set of lines vulnerable to these cascades tend to be limited to the region in which the cascades are triggered. Moreover, large cascades are disproportionately more likely to be triggered by initial failures close to the vulnerable set. CONCLUSION Our results imply that the same disturbance in a given power grid can lead to disparate outcomes under different conditions—ranging from no damage to a large-scale cascade. The association between large cascades and the triggering failures’ proximity to the vulnerable set indicates that the topological and geographical properties of the vulnerable set is a major factor determining whether the failures spread widely. Because the vulnerable set is small, failures would often repeat on the same lines in the absence of interventions. Although the power grid represents a complex system in which changes can have unanticipated effects, our analysis suggests failure-based allocation of resources as a strategy in upgrading the system for improved resilience against large cascades.

Small vulnerable sets determine large network cascades in power grids

We consider maximization of the synchronizability of oscillator networks by assigning weights and directions to the links of a given interaction topology. By extending the master stability formalism to all possible network structures, we show that, unless some oscillator is linked to all the others, maximally synchronizable networks are necessarily nondiagonalizable and can always be obtained by imposing unidirectional information flow with normalized input strengths. The results provide insights into hierarchical structures observed in complex networks in which synchronization is important.

Synchronization is optimal in nondiagonalizable networks.

The dynamics of power-grid networks is becoming an increasingly active area of research within the physics and network science communities. The results from such studies are typically insightful and illustrative, but are often based on simplifying assumptions that can be either difficult to assess or not fully justified for realistic applications. Here we perform a comprehensive comparative analysis of three leading models recently used to study synchronization dynamics in power-grid networks—a fundamental problem of practical significance given that frequency synchronization of all power generators in the same interconnection is a necessary condition for a power grid to operate. We show that each of these models can be derived from first principles within a common framework based on the classical model of a generator, thereby clarifying all assumptions involved. This framework allows us to view power grids as complex networks of coupled second-order phase oscillators with both forcing and damping terms. Using simple illustrative examples, test systems, and real power-grid datasets, we study the inherent frequencies of the oscillators as well as their coupling structure, comparing across the different models. We demonstrate, in particular, that if the network structure is not homogeneous, generators with identical parameters need to be modeled as non-identical oscillators in general. We also discuss an approach to estimate the required (dynamical) system parameters that are unavailable in typical power-grid datasets, their use for computing the constants of each of the three models, and an open-source MATLAB toolbox that we provide for these computations.

https://iopscience.iop.org/article/10.1088/1367-2630/17/1/015012/pdf

Takashi Nishikawa

Papers

Heterogeneity in Oscillator Networks: Are Smaller Worlds Easier to Synchronize?

Spontaneous synchrony in power-grid networks

Small vulnerable sets determine large network cascades in power grids

Synchronization is optimal in nondiagonalizable networks.

Comparative analysis of existing models for power-grid synchronization