Related papers: Fixation times on directed graphs
Community detection is an important tool for analyzing the social graph of mobile phone users. The problem of finding communities in static graphs has been widely studied. However, since mobile social networks evolve over time, static graph…
In many biological processes, the size of a population changes stochastically with time, and recent work in the context of cancer and bacterial growth have focused on the situation when the mean population size grows exponentially. Here,…
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
We investigate evolutionary dynamics of two-strategy matrix games with zealots in finite populations. Zealots are assumed to take either strategy regardless of the fitness. When the strategy selected by the zealots is the same, the fixation…
Evolutionary dynamics has been classically studied for homogeneous populations, but now there is a growing interest in the non-homogenous case. One of the most important models has been proposed by Lieberman, Hauert and Nowak, adapting to a…
The trapping problem on graph (or network) as a typical focus of great interest has attracted more attention from various science fields, including applied mathematics and theoretical computer science, in the past. Here, we first study this…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Understanding the influence of an environment on the evolution of its resident population is a major challenge in evolutionary biology. Great progress has been made in homogeneous population structures while heterogeneous structures have…
Natural selection and random drift are competing phenomena for explaining the evolution of populations. Combining a highly fit mutant with a population structure that improves the odds that the mutant spreads through the whole population…
We propose a model of network formation based on reinforcement learning, which can be seen as a generalization as the one proposed by Skyrms for signaling games. On a discrete graph, whose vertices represent individuals, at any time step…
We give a self-contained introduction to the theory of directed graphs, leading up to the relationship between the Perron-Frobenius eigenvectors of a graph and its autocatalytic sets. Then we discuss a particular dynamical system on a fixed…
Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…
We derived a new speed limit in population dynamics, which is a fundamental limit on the evolutionary rate. By splitting the contributions of selection and mutation to the evolutionary rate, we obtained the new bound on the speed of…
Studies of fixation dynamics in Markov processes predominantly focus on the mean time to absorption. This may be inadequate if the distribution is broad and skewed. We compute the distribution of fixation times in one-step birth-death…
The determination of the computational complexity of multi-agent pathfinding on directed graphs has been an open problem for many years. For undirected graphs, solvability can be decided in polynomial time, as has been shown already in the…
We study two of the simple rules on finite graphs under the death-birth updating and the imitation updating discovered by Ohtsuki, Hauert, Lieberman and Nowak [Nature 441 (2006) 502-505]. Each rule specifies a payoff-ratio cutoff point for…
Population structure affects the outcome of natural selection. Static population structures can be described by graphs, where individuals occupy the nodes, and interactions occur along the edges. General conditions for evolutionary success…
The k-domination number of a graph is the minimum size of a set X such that every vertex of G is in distance at most k from X. We give a linear time constant-factor approximation algorithm for k-domination number in classes of graphs with…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…