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

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

The emergence of order in natural systems is a constant source of inspiration for both physical and biological sciences. While the spatial order characterizing for example the crystals has been the basis of many advances in contemporary physics, most complex systems in nature do not offer such high degree of order. Many of these systems form complex networks whose nodes are the elements of the system and edges represent the interactions between them. 
Traditionally complex networks have been described by the random graph theory founded in 1959 by Paul Erdohs and Alfred Renyi. One of the defining features of random graphs is that they are statistically homogeneous, and their degree distribution (characterizing the spread in the number of edges starting from a node) is a Poisson distribution. In contrast, recent empirical studies, including the work of our group, indicate that the topology of real networks is much richer than that of random graphs. In particular, the degree distribution of real networks is a power-law, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network. 
The scale-free topology of real networks has very important consequences on their functioning. For example, we have discovered that scale-free networks are extremely resilient to the random disruption of their nodes. On the other hand, the selective removal of the nodes with highest degree induces a rapid breakdown of the network to isolated subparts that cannot communicate with each other. 
The non-trivial scaling of the degree distribution of real networks is also an indication of their assembly and evolution. Indeed, our modeling studies have shown us that there are general principles governing the evolution of networks. Most networks start from a small seed and grow by the addition of new nodes which attach to the nodes already in the system. This process obeys preferential attachment: the new nodes are more likely to connect to nodes with already high degree. We have proposed a simple model based on these two principles wich was able to reproduce the power-law degree distribution of real networks. Perhaps even more importantly, this model paved the way to a new paradigm of network modeling, trying to capture the evolution of networks, not just their static topology.

/pdf/statistical-mechanics-of-complex-networks-1zfjpvxipu.pdf

Statistical mechanics of complex networks

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.

/pdf/the-structure-and-function-of-complex-networks-34deompc9l.pdf

The Structure and Function of Complex Networks

We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection method in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2.6 million customers and by analyzing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad-hoc modular networks. .

Fast unfolding of communities in large networks

We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks.

/pdf/fast-unfolding-of-communities-in-large-networks-3hz1lz8b9n.pdf

We propose a technique for separation of particles based on a nonlinear coupling between an applied force and the induced transverse drift in a two-dimensional system with broken reflection symmetry transverse to the force. Further, if the system has reflection symmetry parallel to the force, the drift velocity is independent of the sign of the force. Thus, an ac force causes a net drift only in the transverse direction, allowing for efficient separation even in a very small system. In an appropriately constructed device, particles with diffusion coefficients below and above a threshold move in opposite directions, allowing for continuous separation of significant amounts of molecules.

/pdf/ac-separation-of-particles-by-biased-brownian-motion-in-a-2l4x2rk736.pdf

Ac separation of particles by biased brownian motion in a two-dimensional sieve

http://angel.elte.hu/derenyi/publ/kinesin.pdf

A chemically reversible Brownian motor: application to kinesin and Ncd.

Recently individual two-headed kinesin molecules have been studied in in vitro motility assays revealing a number of their peculiar transport properties. In this paper we propose a simple and robust model for the kinesin stepping process with elastically coupled Brownian heads that show all of these properties. The analytic and numerical treatment of our model results in a very good fit to the experimental data and practically has no free parameters. Changing the values of the parameters in the restricted range allowed by the related experimental estimates has almost no effect on the shape of the curves and results mainly in a variation of the zero load velocity that can be directly fitted to the measured data. In addition, the model is consistent with the measured pathway of the kinesin ATPase.

/pdf/the-kinesin-walk-a-dynamic-model-with-elastically-coupled-45uaof7rnb.pdf

The kinesin walk: a dynamic model with elastically coupled heads

The Kinesin Walk: A Dynamic Model with Elastically Coupled Heads.

We analyse growing networks ranging from collaboration graphs of scientists to the network of similarities defined among the various transcriptional profiles of living cells. For the explicit demonstration of the scale-free nature and hierarchical organization of these graphs, a deterministic construction is also used. We demonstrate the use of determining the eigenvalue spectra of sparse random graph models for the categorization of small measured networks.

/pdf/networks-in-life-scaling-properties-and-eigenvalue-spectra-19zmd3u2ee.pdf

Imre Derényi

Papers

Ac separation of particles by biased brownian motion in a two-dimensional sieve

A chemically reversible Brownian motor: application to kinesin and Ncd.

The kinesin walk: a dynamic model with elastically coupled heads

The Kinesin Walk: A Dynamic Model with Elastically Coupled Heads.

Networks in life: Scaling properties and eigenvalue spectra