相关论文: Phase Transitions of the Moran Process and Algorit…

We study spreading processes in temporal graphs, i. e., graphs whose connections change over time. These processes naturally model real-world phenomena such as infectious diseases or information flows. More precisely, we investigate how…

Recently, a phase transition phenomenon has been established for parking on random trees. We extend the results of Curien and H\'enard on general Galton--Watson trees and allow different car arrival distributions depending on the vertex…

Population structures can be crucial determinants of evolutionary processes. For the Moran process on graphs certain structures suppress selective pressure, while others amplify it (Lieberman et al. 2005 Nature 433 312-316). Evolutionary…

When the unconditioned process is a diffusion living on the half-line $x \in ]-\infty,a[$ in the presence of an absorbing boundary condition at position $x=a$, we construct various conditioned processes corresponding to finite or infinite…

Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…

We construct a family of growing finite bounded degree rooted graphs, $G_n$, in which the mixing time for simple random walk, starting at the root, is order $\log |G_n|$. Yet after a quasi - isometry, the ratio of $|G_n|$ over the mixing…

Graph signal processing is an emerging field which aims to model processes that exist on the nodes of a network and are explained through diffusion over this structure. Graph signal processing works have heretofore assumed knowledge of the…

We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…

Temporal environmental variations are ubiquitous in nature, yet most of the theoretical works in population genetics and evolution assume fixed environment. Here we analyze the effect of variations in carrying capacity on the fate of a…

In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…

Biological fitness is not an observable quantity and must be inferred from population dynamics. Bayesian inference applied to the Moran process and variants yields a robust inference method that can infer fitness in populations evolving via…

The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model (VM) dynamics)…

Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…

The burning and forcing processes are both instances of propagation processes on graphs that are commonly used to model real-world spreading phenomena. The contribution of this paper is two-fold. We first establish a connection between…

Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…

Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap percolation process on $G$ is defined to be the sequence of graphs $G_i$, $i\geq 0$ which starts with $G_0:=G$ and in which $G_{i+1}$ is obtained from $G_i$ by adding…

We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…

We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…

Genome rearrangements are evolutionary events that shuffle genomic architectures. Most frequent genome rearrangements are reversals, translocations, fusions, and fissions. While there are some more complex genome rearrangements such as…