Related papers: Chase-escape with conversion on the complete graph
The graph transformation approach is a recently proposed method for computing mean first passage times, rates, and committor probabilities for kinetic transition networks. Here we compare the performance to existing linear algebra methods,…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…
We investigate the escape dynamics of the doubling map with a time-periodic hole. We use Ulam's method to calculate the escape rate as a function of the control parameters. We consider two cases, oscillating or breathing holes, where the…
We calculate the survival probability of an immobile target surrounded by a sea of uncorrelated diffusive or subdiffusive evanescent traps, i.e., traps that disappear in the course of their motion. Our calculation is based on a fractional…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…
The asymmetric exclusion process is an idealised stochastic model of transport, whose exact solution has given important insight into a general theory of nonequilibrium statistical physics. In this work, we consider a totally asymmetric…
We consider a random walk with death in $[-N,N]$ moving in a time dependent environment. The environment is a system of particles which describes a current flux from $N$ to $-N$. Its evolution is influenced by the presence of the random…
With the increasing use of robots in daily life, there is a growing need to provide robust collaboration protocols for robots to tackle more complicated and dynamic problems effectively. This paper presents a novel, factor graph-based…
The paper presents two results. The first one provides separate conditions for the upper and lower estimate of the distribution of the exit time from balls of a random walk on a weighted graph. The main result of the paper is that the lower…
In this paper we are concerned with the Susceptible-Infective-Removed model with random transition rates on complete graphs $C_n$ with $n$ vertices. We assign i. i. d. copies of a positive random variable $\xi$ on each vertex as the…
In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is…
We consider multimodal maps with holes and study the evolution of the open systems with respect to equilibrium states for both geometric and H\"older potentials. For small holes, we show that a large class of initial distributions share the…
This article rigorously analyzes the meeting time between pursuers and evaders performing random walks on digraphs. There exist several bounds on the expected meeting time between random walkers on graphs in the literature, however,…
We study a one-dimensional totally asymmetric simple exclusion process with one special site from which particles fly to any empty site (not just to the neighboring site). The system attains a non-trivial stationary state with density…
We prove that on any transitive graph $G$ with infinitely many ends, a self-avoiding walk of length $n$ is ballistic with extremely high probability, in the sense that there exist constants $c,t>0$ such that $\mathbb{P}_n(d_G(w_0,w_n)\geq…
A simple model of cyclically competing species on a directed graph with quenched disorder is proposed as an extension of the rock-paper-scissors model. By assuming that the effects of loops in a directed random graph can be ignored in the…
Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…
The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to…