Searcharxiv⌕ Search

arXiv subjects

Reka Albert

Publications and source records attributed to Reka Albert.

32 records · Page 2Linked to original sources

Bacteriophage-mediated competition in Bordetella bacteria

Apparent competition between species is believed to be one of the principle driving forces that structure ecological communities, although the precise mecha nisms have yet to be characterized. Here we develop a model system that isolates phage-mediated interactions by neutralizing resource competition using two genetically identical Bordetella bronchiseptica strains that differ only in that one is the carrier of a phage and the other is susceptible to the phage. We observe and quantify the competitive advantage of the bacterial strain bearing the prophage in both invading and in resisting invasion by bacteria susceptible to the phage, and use our measurements to develop a mathematical model of phage-mediated competition. The model predicts, and experimental evidence confirms, that the competitive advantage conferred by the phage depends only on the relative phage pathology and is independent of other phage and host parameters. This work combines experimental and mathematical approaches to the study of phage-driven competition, and provides an experimentally tested framework for evaluation of the effects of pathogens/parasites on interspecific competition.

q-bio.PE↗

Robustness and fragility of Boolean models for genetic regulatory networks

Interactions between genes and gene products give rise to complex circuits that enable cells to process information and respond to external signals. Theoretical studies often describe these interactions using continuous, stochastic, or logical approaches. We propose a new modeling framework for gene regulatory networks, that combines the intuitive appeal of a qualitative description of gene states with a high flexibility in incorporating stochasticity in the duration of cellular processes. We apply our methods to the regulatory network of the segment polarity genes, thus gaining novel insights into the development of gene expression patterns. For example, we show that very short synthesis and decay times can perturb the wild type pattern. On the other hand, separation of timescales between pre- and posttranslational processes and a minimal prepattern ensure convergence to the wild type expression pattern regardless of fluctuations.

q-bio.MN↗

Modeling Cascading Failures in the North American Power Grid

The North American power grid is one of the most complex technological networks, and its interconnectivity allows both for long-distance power transmission and for the propagation of disturbances. We model the power grid using its actual topology and plausible assumptions about the load and overload of transmission substations. Our results indicate that the loss of a single substation can lead to a 25% loss of transmission efficiency by triggering an overload cascade in the network. We systematically study the damage inflicted by the loss of single nodes, and find three universal behaviors, suggesting that 40% of the transmission substations lead to cascading failures when disrupted. While the loss of a single node can inflict substantial damage, subsequent removals have only incremental effects, in agreement with the topological resilience to less than 1% node loss.

cond-mat.other↗

Conserved network motifs allow protein-protein interaction prediction

High-throughput protein interaction detection methods are strongly affected by false positive and false negative results. Focused experiments are needed to complement the large-scale methods by validating previously detected interactions but it is often difficult to decide which proteins to probe as interaction partners. Developing reliable computational methods assisting this decision process is a pressing need in bioinformatics. We show that we can use the conserved properties of the protein network to identify and validate interaction candidates. We apply a number of machine learning algorithms to the protein connectivity information and achieve a surprisingly good overall performance in predicting interacting proteins. Using a 'leave-one-out' approach we find average success rates between 20-50% for predicting the correct interaction partner of a protein. We demonstrate that the success of these methods is based on the presence of conserved interaction motifs within the network. A reference implementation and a table with candidate interacting partners for each yeast protein are available at http://www.protsuggest.org

q-bio.MN↗

Structural Vulnerability of the North American Power Grid

The magnitude of the August 2003 blackout affecting the United States has put the challenges of energy transmission and distribution into limelight. Despite all the interest and concerted effort, the complexity and interconnectivity of the electric infrastructure have so far precluded us from understanding why certain events happened. In this paper we study the power grid from a network perspective and determine its ability to transfer power between generators and consumers when certain nodes are disrupted. We find that the power grid is robust to most perturbations, yet disturbances affecting key transmision substations greatly reduce its ability to function. We emphasize that the global properties of the underlying network must be understood as they greatly affect local behavior.

cond-mat.dis-nn↗

Dynamic receptor team formation can explain the high signal transduction gain in E. coli

Evolution has provided many organisms with sophisticated sensory systems that enable them to respond to signals in their environment. The response frequently involves alteration in the pattern of movement, such as the chemokinesis of the bacterium Escherichia coli, which swims by rotating its flagella. When rotated counterclockwise (CCW) the flagella coalesce into a propulsive bundle, producing a relatively straight ``run'', and when rotated clockwise (CW) they fly apart, resulting in a ``tumble'' which reorients the cell with little translocation. A stochastic process generates the runs and tumbles, and in a chemoeffector gradient runs that carry the cell in a favorable direction are extended. The overall structure of the signal transduction pathways is well-characterized in E. coli, but important details are still not understood. Only recently has a source of gain in the signal transduction network been identified experimentally, and here we present a mathematical model based on dynamic assembly of receptor teams that can explain this observation.

q-bio.MN↗

The topology of the regulatory interactions predics the expression pattern of the segment polarity genes in Drosophila melanogaster

Expression of the Drosophila segment polarity genes is initiated by a prepattern of pair-rule gene products and maintained by a network of regulatory interactions throughout several stages of embryonic development. Analysis of a model of gene interactions based on differential equations showed that wild-type expression patterns of these genes can be obtained for a wide range of kinetic parameters, which suggests that the steady states are determined by the topology of the network and the type of regulatory interactions between components, not the detailed form of the rate laws. To investigate this, we propose and analyze a Boolean model of this network which is based on a binary ON/OFF representation of transcription and protein levels, and in which the interactions are formulated as logical functions. In this model the spatial and temporal patterns of gene expression are determined by the topology of the network and whether components are present or absent, rather than the absolute levels of the mRNAs and proteins and the functional details of their interactions. The model is able to reproduce the wild type gene expression patterns, as well as the ectopic expression patterns observed in over-expression experiments and various mutants. Furthermore, we compute explicitly all steady states of the network and identify the basin of attraction of each steady state. The model gives important insights into the functioning of the segment polarity gene network, such as the crucial role of the wingless and sloppy paired genes, and the network's ability to correct errors in the prepattern.

q-bio.MN↗

Statistical mechanics of complex networks

Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled as random graphs, it is increasingly recognized that the topology and evolution of real networks is governed by robust organizing principles. Here we review the recent advances in the field of complex networks, focusing on the statistical mechanics of network topology and dynamics. After reviewing the empirical data that motivated the recent interest in networks, we discuss the main models and analytical tools, covering random graphs, small-world and scale-free networks, as well as the interplay between topology and the network's robustness against failures and attacks.

cond-mat.stat-mech↗

Error and attack tolerance of complex networks

Many complex systems, such as communication networks, display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network. The stability of these complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components. In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks. We find that scale-free networks, describing a number of systems, such as the World Wide Web, Internet, social networks or a cell, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates. However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.

cond-mat.dis-nn↗

Topology of evolving networks: local events and universality

Networks grow and evolve by local events, such as the addition of new nodes and links, or rewiring of links from one node to another. We show that depending on the frequency of these processes two topologically different networks can emerge, the connectivity distribution following either a generalized power-law or an exponential. We propose a continuum theory that predicts these two regimes as well as the scaling function and the exponents, in good agreement with the numerical results. Finally, we use the obtained predictions to fit the connectivity distribution of the network describing the professional links between movie actors.

cond-mat.dis-nn↗

Emergence of scaling in random networks

Systems as diverse as genetic networks or the world wide web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature is found to be a consequence of the two generic mechanisms that networks expand continuously by the addition of new vertices, and new vertices attach preferentially to already well connected sites. A model based on these two ingredients reproduces the observed stationary scale-free distributions, indicating that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

cond-mat.dis-nn↗

The diameter of the world wide web

Despite its increasing role in communication, the world wide web remains the least controlled medium: any individual or institution can create websites with unrestricted number of documents and links. While great efforts are made to map and characterize the Internet's infrastructure, little is known about the topology of the web. Here we take a first step to fill this gap: we use local connectivity measurements to construct a topological model of the world wide web, allowing us to explore and characterize its large scale properties.

cond-mat.dis-nn↗

Mean-field theory for scale-free random networks

Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information is available display scale-free features. Here we study the scaling properties of the recently introduced scale-free model, that can account for the observed power-law distribution of the connectivities. We develop a mean-field method to predict the growth dynamics of the individual vertices, and use this to calculate analytically the connectivity distribution and the scaling exponents. The mean-field method can be used to address the properties of two variants of the scale-free model, that do not display power-law scaling.

cond-mat.dis-nn↗

Driven interfaces in disordered media: determination of universality classes from experimental data

While there have been important theoretical advances in understanding the universality classes of interfaces moving in porous media, the developed tools cannot be directly applied to experiments. Here we introduce a method that can identify the universality class from snapshots of the interface profile. We test the method on discrete models whose universality class is well known, and use it to identify the universality class of interfaces obtained in experiments on fluid flow in porous media.

cond-mat.stat-mech↗