Related papers: A phase transition for a spatial host-parasite mod…
The possible coexistence of one host, one aggressive parasite and one non-lethal parasite is simulated using the Penna model of biological ageing. If the aggressive parasites survive the difficult initial times where they have to adjust…
Following Bradonji\'c and Saniee, we study a model of bootstrap percolation on the Gilbert random geometric graph on the $2$-dimensional torus. In this model, the expected number of vertices of the graph is $n$, and the expected degree of a…
We prove a conjecture by Bertoin that the multi-dimensional elephant random walk on $\mathbb{Z}^d$($d\geq 3$) is transient and the expected number of zeros is finite. We also provide some estimates on the rate of escape. In dimensions $d=…
We consider a random walk on a $d$-regular graph $G$ where $d\to\infty$ and $G$ satisfies certain conditions. Our prime example is the $d$-dimensional hypercube, which has $n=2^d$ vertices. We explore the likely component structure of the…
We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…
We study competing first passage percolation on graphs generated by the configuration model with infinite-mean degrees. Initially, two uniformly chosen vertices are infected with type 1 and type 2 infection, respectively, and the infection…
By means of numerical simulations and epidemic analysis, the transition point of the stochastic, asynchronous Susceptible-Infected-Recovered (SIR) model on a square lattice is found to be c_0=0.1765005(10), where c is the probability a…
In this paper, based on the epidemiological microparasite model, a parasite-host model is established by considering the fear effect of susceptible individuals on infectors. We explored the pattern formation with the help of numerical…
It is a celebrated fact that a simple random walk on an infinite $k$-ary tree for $k \geq 2$ returns to the initial vertex at most finitely many times during infinitely many transitions; it is called transient. This work points out the fact…
The inhabitants of the bush lupine in coastal California have been the subject of scientific scrutiny in recent years. Observations of a host-parasitoid interaction in the shrub's foliage, in which victims are significantly less motile than…
Faults and viruses often spread in networked environments by propagating from site to neighboring site. We model this process of {\em network contamination} by graphs. Consider a graph $G=(V,E)$, whose vertex set is contaminated and our…
A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…
Inspired by DNA data of the human cytomegalovirus we propose a model of a two-type parasite population distributed over its hosts. The parasite is capable to persist in its host till the host dies, and to reinfect other hosts. To maintain…
We study a one-dimensional sluggish random walk with space-dependent transition probabilities between nearest-neighbour lattice sites. Motivated by trap models of slow dynamics, we consider a model in which the trap depth increases…
In this paper, we extend a model of host-parasite co-evolution to incorporate the semi-conservative nature of DNA replication for both the host and the parasite. We find that the optimal mutation rate for the semi-conservative and…
In this paper we explore the features of a graph generated by random walkers with nodes that have evolutionary attractiveness and Boltzmann-like transition probabilities that depend both on the euclidean distance between the nodes and on…
The frog model on the rooted d-ary tree changes from transient to recurrent as the number of frogs per site is increased. We prove that the location of this transition is on the same order as the degree of the tree.
We consider the statistical inference problem of recovering an unknown perfect matching, hidden in a weighted random graph, by exploiting the information arising from the use of two different distributions for the weights on the edges…
We study the critical effect of an intermittent social distancing strategy on the propagation of epidemics in adaptive complex networks. We characterize the effect of our strategy in the framework of the susceptible-infected-recovered…
Given an infinite connected regular graph $G=(V,E)$, place at each vertex Pois($\lambda$) walkers performing independent lazy simple random walks on $G$ simultaneously. When two walkers visit the same vertex at the same time they are…