Power Transmission Control using Distributed Max-Flow

Existing maximum flow algorithms use one processor for all calculations or one processor per vertex in a graph to calculate the maximum possible flow through a graph\u27s vertices. This is not suitable for practical implementation. We extend the max-flow work of Goldberg and Tarjan to a distributed algorithm to calculate maximum flow where the number of processors is less than the number of vertices in a graph. Our algorithm is applied to maximizing electrical flow within a power network where the power grid is modeled as a graph. Error detection measures are included to detect problems in a simulated power network. We show that our algorithm is successful in executing quickly enough to prevent catastrophic power outages

Adaptive evolution of molecular phenotypes

Molecular phenotypes link genomic information with organismic functions, fitness, and evolution. Quantitative traits are complex phenotypes that depend on multiple genomic loci. In this paper, we study the adaptive evolution of a quantitative trait under time-dependent selection, which arises from environmental changes or through fitness interactions with other co-evolving phenotypes. We analyze a model of trait evolution under mutations and genetic drift in a single-peak fitness seascape. The fitness peak performs a constrained random walk in the trait amplitude, which determines the time-dependent trait optimum in a given population. We derive analytical expressions for the distribution of the time-dependent trait divergence between populations and of the trait diversity within populations. Based on this solution, we develop a method to infer adaptive evolution of quantitative traits. Specifically, we show that the ratio of the average trait divergence and the diversity is a universal function of evolutionary time, which predicts the stabilizing strength and the driving rate of the fitness seascape. From an information-theoretic point of view, this function measures the macro-evolutionary entropy in a population ensemble, which determines the predictability of the evolutionary process. Our solution also quantifies two key characteristics of adapting populations: the cumulative fitness flux, which measures the total amount of adaptation, and the adaptive load, which is the fitness cost due to a population's lag behind the fitness peak.Comment: Figures are not optimally displayed in Firefo

Exact Solution for the Time Evolution of Network Rewiring Models

We consider the rewiring of a bipartite graph using a mixture of random and preferential attachment. The full mean field equations for the degree distribution and its generating function are given. The exact solution of these equations for all finite parameter values at any time is found in terms of standard functions. It is demonstrated that these solutions are an excellent fit to numerical simulations of the model. We discuss the relationship between our model and several others in the literature including examples of Urn, Backgammon, and Balls-in-Boxes models, the Watts and Strogatz rewiring problem and some models of zero range processes. Our model is also equivalent to those used in various applications including cultural transmission, family name and gene frequencies, glasses, and wealth distributions. Finally some Voter models and an example of a Minority game also show features described by our model.Comment: This version contains a few footnotes not in published Phys.Rev.E versio

UPFC Control Employing Gradient Descent Search

Increasing demand coupled with limitations on new construction indicate that existing power transmission must be better controlled in order to continue reliable operation. Recent advances in FACTS devices provide a mechanism to better control power flow on the transmission network. One particular device, the unified power flow controller (UPFC), holds the most promise for maintaining operation even when the system has suffered partial failure (either naturally occurring, due to human error, or a malicious attack). In addition to the capital cost, the primary obstacles to widespread UPFC use are the combined problems of selecting the most cost effective locations for installation and maintaining proper control of them once installed. In this paper we list evidence that gradient descent search based on load-flow computation is more realistic and accurate than many of the optimization techniques currently in use. We then demonstrate that gradient descent search can be used to select control points that improve system fault tolerance more than those found by the max-flow technique. In addition, we demonstrate that the size of the system being computed and the number of computations is bounded and is practical for real time control

Voter Model with Time dependent Flip-rates

We introduce time variation in the flip-rates of the Voter Model. This type of generalisation is relevant to models of ageing in language change, allowing the representation of changes in speakers' learning rates over their lifetime and may be applied to any other similar model in which interaction rates at the microscopic level change with time. The mean time taken to reach consensus varies in a nontrivial way with the rate of change of the flip-rates, varying between bounds given by the mean consensus times for static homogeneous (the original Voter Model) and static heterogeneous flip-rates. By considering the mean time between interactions for each agent, we derive excellent estimates of the mean consensus times and exit probabilities for any time scale of flip-rate variation. The scaling of consensus times with population size on complex networks is correctly predicted, and is as would be expected for the ordinary voter model. Heterogeneity in the initial distribution of opinions has a strong effect, considerably reducing the mean time to consensus, while increasing the probability of survival of the opinion which initially occupies the most slowly changing agents. The mean times to reach consensus for different states are very different. An opinion originally held by the fastest changing agents has a smaller chance to succeed, and takes much longer to do so than an evenly distributed opinion.Comment: 16 pages, 6 figure

Anderson Localization, Non-linearity and Stable Genetic Diversity

In many models of genotypic evolution, the vector of genotype populations satisfies a system of linear ordinary differential equations. This system of equations models a competition between differential replication rates (fitness) and mutation. Mutation operates as a generalized diffusion process on genotype space. In the large time asymptotics, the replication term tends to produce a single dominant quasispecies, unless the mutation rate is too high, in which case the populations of different genotypes becomes de-localized. We introduce a more macroscopic picture of genotypic evolution wherein a random replication term in the linear model displays features analogous to Anderson localization. When coupled with non-linearities that limit the population of any given genotype, we obtain a model whose large time asymptotics display stable genotypic diversityComment: 25 pages, 8 Figure

Stochasticity and evolutionary stability

In stochastic dynamical systems, different concepts of stability can be obtained in different limits. A particularly interesting example is evolutionary game theory, which is traditionally based on infinite populations, where strict Nash equilibria correspond to stable fixed points that are always evolutionarily stable. However, in finite populations stochastic effects can drive the system away from strict Nash equilibria, which gives rise to a new concept for evolutionary stability. The conventional and the new stability concepts may apparently contradict each other leading to conflicting predictions in large yet finite populations. We show that the two concepts can be derived from the frequency dependent Moran process in different limits. Our results help to determine the appropriate stability concept in large finite populations. The general validity of our findings is demonstrated showing that the same results are valid employing vastly different co-evolutionary processes

Random copying in space

Random copying is a simple model for population dynamics in the absence of selection, and has been applied to both biological and cultural evolution. In this work, we investigate the effect that spatial structure has on the dynamics. We focus in particular on how a measure of the diversity in the population changes over time. We show that even when the vast majority of a population's history may be well-described by a spatially-unstructured model, spatial structure may nevertheless affect the expected level of diversity seen at a local scale. We demonstrate this phenomenon explicitly by examining the random copying process on small-world networks, and use our results to comment on the use of simple random-copying models in an empirical context.Comment: 26 pages, 11 figures. Based on invited talk at AHRC CECD Conference on "Cultural Evolution in Spatially Structured Populations" at UCL, September 2010. To appear in ACS - Advances in Complex System