308,900 research outputs found
Simple dynamics on graphs
Can the interaction graph of a finite dynamical system force this system to have a âcomplexâ dynamics? In other words, given a finite interval of integers A, which are the signed digraphs G such that every finite dynamical system f:AnâAn with G as interaction graph has a âcomplexâ dynamics? If |A|âĽ3 we prove that no such signed digraph exists. More precisely, we prove that for every signed digraph G there exists a system f:AnâAn with G as interaction graph that converges toward a unique fixed point in at most âlog2âĄnâ+2 steps. The boolean case |A|=2 is more difficult, and we provide partial answers instead. We exhibit large classes of unsigned digraphs which admit boolean dynamical systems which converge toward a unique fixed point in polynomial, linear or constant time
An analysis of the fixation probability of a mutant on special classes of non-directed graphs
There is a growing interest in the study of evolutionary dynamics on populations with some non-homogeneous structure. In this paper we follow the model of Lieberman et al. (Lieberman et al. 2005 Nature 433, 312â316) of evolutionary dynamics on a graph. We investigate the case of non-directed equally weighted graphs and find solutions for the fixation probability of a single mutant in two classes of simple graphs. We further demonstrate that finding similar solutions on graphs outside these classes is far more complex. Finally, we investigate our chosen classes numerically and discuss a number of features of the graphs; for example, we find the fixation probabilities for different initial starting positions and observe that average fixation probabilities are always increased for advantageous mutants as compared with those of unstructured populations
Semi-Markov Graph Dynamics
In this paper, we outline a model of graph (or network) dynamics based on two
ingredients. The first ingredient is a Markov chain on the space of possible
graphs. The second ingredient is a semi-Markov counting process of renewal
type. The model consists in subordinating the Markov chain to the semi-Markov
counting process. In simple words, this means that the chain transitions occur
at random time instants called epochs. The model is quite rich and its possible
connections with algebraic geometry are briefly discussed. Moreover, for the
sake of simplicity, we focus on the space of undirected graphs with a fixed
number of nodes. However, in an example, we present an interbank market model
where it is meaningful to use directed graphs or even weighted graphs.Comment: 25 pages, 4 figures, submitted to PLoS-ON
Majority dynamics and the median process: connections, convergence and some new conjectures
We consider the median dynamics process in general graphs. In this model,
each vertex has an independent initial opinion uniformly distributed in the
interval [0,1] and, with rate one, updates its opinion to coincide with the
median of its neighbors. This process provides a continuous analog of majority
dynamics. We deduce properties of median dynamics through this connection and
raise new conjectures regarding the behavior of majority dynamics on general
graphs. We also prove these conjectures on some graphs where majority dynamics
has a simple description.Comment: 27 pages, 3 figure
Graph Abstraction and Abstract Graph Transformation
Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these systems, where transitions can be conveniently described by graph transformation rules.
We present a framework for the abstraction of graphs supporting abstract graph transformation. The abstraction method naturally generalises previous approaches to abstract graph transformation. The set of possible abstract graphs is finite. This has the pleasant consequence of generating a finite transition system for any start graph and any finite set of transformation rules. Moreover, abstraction preserves a simple logic for expressing properties on graph nodes. The precision of the abstraction can be adjusted according to properties expressed in this logic to be verified
Optimizing spread dynamics on graphs by message passing
Cascade processes are responsible for many important phenomena in natural and
social sciences. Simple models of irreversible dynamics on graphs, in which
nodes activate depending on the state of their neighbors, have been
successfully applied to describe cascades in a large variety of contexts. Over
the last decades, many efforts have been devoted to understand the typical
behaviour of the cascades arising from initial conditions extracted at random
from some given ensemble. However, the problem of optimizing the trajectory of
the system, i.e. of identifying appropriate initial conditions to maximize (or
minimize) the final number of active nodes, is still considered to be
practically intractable, with the only exception of models that satisfy a sort
of diminishing returns property called submodularity. Submodular models can be
approximately solved by means of greedy strategies, but by definition they lack
cooperative characteristics which are fundamental in many real systems. Here we
introduce an efficient algorithm based on statistical physics for the
optimization of trajectories in cascade processes on graphs. We show that for a
wide class of irreversible dynamics, even in the absence of submodularity, the
spread optimization problem can be solved efficiently on large networks.
Analytic and algorithmic results on random graphs are complemented by the
solution of the spread maximization problem on a real-world network (the
Epinions consumer reviews network).Comment: Replacement for "The Spread Optimization Problem
Quantum Graphs: A model for Quantum Chaos
We study the statistical properties of the scattering matrix associated with
generic quantum graphs. The scattering matrix is the quantum analogue of the
classical evolution operator on the graph. For the energy-averaged spectral
form factor of the scattering matrix we have recently derived an exact
combinatorial expression. It is based on a sum over families of periodic orbits
which so far could only be performed in special graphs. Here we present a
simple algorithm implementing this summation for any graph. Our results are in
excellent agreement with direct numerical simulations for various graphs.
Moreover we extend our previous notion of an ensemble of graphs by considering
ensemble averages over random boundary conditions imposed at the vertices. We
show numerically that the corresponding form factor follows the predictions of
random-matrix theory when the number of vertices is large---even when all bond
lengths are degenerate. The corresponding combinatorial sum has a structure
similar to the one obtained previously by performing an energy average under
the assumption of incommensurate bond lengths.Comment: 8 pages, 3 figures. Contribution to the conference on Dynamics of
Complex Systems, Dresden (1999
- âŚ