Related papers: The contact process on finite homogeneous trees re…
We consider the super-critical contact process on $\mathbb{Z}^d$. It is known that measures which dominate the upper invariant measure $\mu$ converge exponentially fast to $\mu$. However, the same is not true for measures which are below…
This paper is concerned with a stochastic model for the spread of an SEIR (susceptible -> exposed (=latent) -> infective -> removed) epidemic with a contact tracing scheme, in which removed individuals may name some of their infectious…
The regular tree corresponds to the random regular graph as its local limit. For this reason the famous double phase transition of the contact process on regular tree has been seen to correspond to a phase transition on the large random…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
The main substance of the paper concerns the growth rate and the classification (ergodicity, transience) of a family of random trees. In the basic model, new edges appear according to a Poisson process of parameter $\lambda$ and leaves can…
We consider a stochastic model of infection spread on the complete graph on $N$ vertices incorporating dynamic partnerships, which we assume to be monogamous. This can be seen as a variation on the contact process in which some form of edge…
We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \[ \operatorname{Var}_x(\tau_y)+\mathbb E_x\tau_y \ge \frac{(\mathbb E_x\tau_y)^2}{1+\log n}, \]…
For $n$-vertex, $d$-dimensional lattices $\Lambda$ with $d \ge 2$, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present an exact closed-form result for the…
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…
In this paper, we study asymptotic behaviors of the tails of extinction time and maximal displacement of a critical branching killed L\'{e}vy process $(Z_t^{(0,\infty)})_{t\ge 0}$ in $\mathbb{R}$, in which all particles (and their…
In this note we give a new method for getting a series of approximations for the extinction probability of the one-dimensional contact process by using the Gr\"obner basis.
We present simulation results for the contact process on regular, cubic networks that are composed of a one-dimensional lattice and a set of long edges with unbounded length. Networks with different sets of long edges are considered, that…
We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain…
We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower…
In this paper we introduce a contact process in an evolving random environment (CPERE) on a connected and transitive graph with bounded degree, where we assume that this environment is described through an ergodic spin systems with finite…
Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…
The asymptotic behavior, as $n\rightarrow \infty $ of the probability of the event that a decomposable critical branching process $\mathbf{Z}(m)=(Z_{1}(m),...,Z_{N}(m)),$ $m=0,1,2,...,$ with $N$ types of particles dies at moment $n$ is…
Previous work has shown that for contagion processes on extended star networks (trees with exactly one node of degree > 2), there is a simple, closed-form expression for a highly accurate approximation to the maximum likelihood infection…
We consider nearest-neighbor self-avoiding walk, bond percolation, lattice trees, and bond lattice animals on ${\mathbb{Z}}^d$. The two-point functions of these models are respectively the generating function for self-avoiding walks from…
We model an epidemic where the per-person infectiousness in a network of geographic localities changes with the total number of active cases. This would happen as people adopt more stringent non-pharmaceutical precautions when the…