Related papers: Chase-escape with conversion on the complete graph
We introduce a new oriented evolving graph model inspired by biological networks. A node is added at each time step and is connected to the rest of the graph by random oriented edges emerging from older nodes. This leads to a statistical…
In this paper, we prove lower and upper bounds for the extinction time of the contact process on random geometric graphs with connecting radius tending to infinity. We obtain that for any infection rate $\lambda >0$, the contact process on…
In this paper we will be introducing a type of game which as far as this author is aware has never been studied before. These are games where there are two players, one who is trying to get one of his pieces, called a King to a predefined…
In this work, we investigate a simple nonequilibrium system with many interconnected, open subsystems, each exchanging a globally conserved resource with an external reserve. The system is represented by a random graph, where nodes…
The Moran process is a random process that models the spread of genetic mutations through graphs. If the graph is connected, the process eventually reaches "fixation", where every vertex is a mutant, or "extinction", where no vertex is a…
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
We study a multispecies generalization of a left-permeable asymmetric exclusion process (LPASEP) in one dimension with open boundaries. We determine all phases in the phase diagram using an exact projection to the LPASEP solved by us in a…
Motivated by biological aspects related to fungus growth, we consider the competition of growth and corrosion. We study a modification of the totally asymmetric exclusion process, including the probabilities of injection $\alpha$ and death…
We compute universal distributions for the transition probabilities of a Markov model for transport in the mixed phase space of area-preserving maps and verify that the survival probability distribution for trajectories near an infinite…
We study the existence of state transfer with respect to the $q$-Laplacian matrix of a graph equipped with a non-trivial involution. We show that the occurrence of perfect state transfer between certain pair (or plus) states in such a graph…
Stochastic driven flow along a channel can be modeled by the asymmetric simple exclusion process. We confirm numerically the presence of a dynamic queuing phase transition at a nonzero obstruction strength, and establish its scaling…
In this paper we study the metastability of the contact process on a random regular graph. We show that the extinction time of the contact process, when initialized so that all vertices are infected at time 0, grows exponentially with the…
There is a natural connection between two types of recurrence law: hitting times to shrinking targets, and hitting times to a fixed target (usually seen as escape through a hole). We show that for systems which mix exponentially fast, one…
In this article, we investigate a multispecies generalization of the single-species asymmetric simple exclusion process defined on an open one-dimensional lattice. We devise an exact projection scheme to find the phase diagram in terms of…
We study pursuit-evasion in a polygonal environment with polygonal obstacles. In this turn based game, an evader $e$ is chased by pursuers $p_1, p_2, ..., p_{\ell}$. The players have full information about the environment and the location…
We study the stochastic evolution of four species in cyclic competition in a well mixed environment. In systems composed of a finite number $N$ of particles these simple interaction rules result in a rich variety of extinction scenarios,…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…
We analyze Receding Horizon Games without any MPC-like terminal ingredients. We show that recursive feasibility can be inferred from the turnpike phenomenon under mild assumptions. Moreover, we prove sufficient conditions for practical…
For a homogeneous random walk in the quarter plane with nearest-neighbor transitions, starting from some state $(i_0,j_0)$, we study the event that the walk reaches the vertical axis, before reaching the horizontal axis. We derive an exact…
We treat a quantum walk model with in- and out- flows at every time step from the outside. We show that this quantum walk can find the marked vertex of the complete graph with a high probability in the stationary state. In exchange of the…