Related papers: Critical value for the contact process with random…
Critical behavior of the contact process is studied in annealed scale-free networks by mapping it on the random walk problem. We obtain the analytic results for the critical scaling, using the event-driven dynamics approach. These results…
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 consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…
In this paper we introduce a contact process on a dynamical long range percolation (CPDLP) defined on a complete graph $(V,\mathcal{E})$. A dynamical long range percolation is a Feller process defined on the edge set $\mathcal{E}$, which…
The basic contact process with parameter $\mu$ altered so that infections of sites that have not been previously infected occur at rate proportional to $\lambda$ instead is considered. Emergence of an infinite epidemic starting out from a…
In this paper we are concerned with threshold-one contact processes on lattices. We show that the probability that the origin is infected converges to 0 at an exponential rate I in the subcritical case. Furthermore, we give a limit theorem…
Here we prove critical exponents for Random Connections Models (RCMs) with random marks. The vertices are given by a marked Poisson point process on $\mathbb{R}^d$ and an edge exists between any pair of vertices independently with a…
The quadratic contact process (QCP) is a natural extension of the well studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate $\lambda$ and infected individuals recover ($1 \longrightarrow 0$)…
We consider the biased random walk on a critical Galton-Watson tree conditioned to survive, and confirm that this model with trapping belongs to the same universality class as certain one-dimensional trapping models with slowly-varying…
We study the typical behavior of the harmonic measure of balls in large critical Galton-Watson trees whose offspring distribution has finite variance. The harmonic measure considered here refers to the hitting distribution of height $n$ by…
We study branching diffusions in a bounded domain $D$ of $\mathbb{R}^d$ in which particles are killed upon hitting the boundary $\partial D$. It is known that any such process undergoes a phase transition when the branching rate $\beta$…
We consider an interacting particle process on a graph which, from a macroscopic point of view, looks like $\Z^d$ and, at a microscopic level, is a complete graph of degree $N$ (called a patch). There are two birth rates: an inter-patch one…
This paper is concerned with a natural variant of the contact process modeling the spread of knowledge on the integer lattice. Each site is characterized by its knowledge, measured by a real number ranging from 0 = ignorant to 1 =…
This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…
We study the threshold $theta geq 2$ contact process on a homogeneous tree $T_b$ of degree $kappa = b + 1$, with infection parameter $lambda geq 0$ and started from a product measure with density $p$. The corresponding mean-field model…
We consider a specific random graph which serves as a disordered medium for a particle performing biased random walk. Take a two-sided infinite horizontal ladder and pick a random spanning tree with a certain edge weight $c$ for the…
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…
We consider loop ensembles on random trees. The loops are induced by a Poisson process of links sampled on the underlying tree interpreted as a metric graph. We allow two types of links, crosses and double bars. The crosses-only case…
We are interested in the spread of an epidemic between two communities that have higher connectivity within than between them. We model the two communities as independent Erdos-Renyi random graphs, each with n vertices and edge probability…
We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal edge occupation probabilities. The edge probabilities are moderated by vertex weights, and are such that the degree of…