Related papers: On the transience of processes defined on Galton--…
A transient stochastic process is considered strongly transient if conditioned on returning to the starting location, the expected time it takes to return the the starting location is finite. We characterize strong transience for a…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
We prove that the restriction of the vertex-reinforced jump process to a subset of the vertex set is a mixture of vertex-reinforced jump processes. A similar statement holds for the non-linear hyperbolic supersymmetric sigma model. This is…
In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation…
We give a realization of the stable L\'evy forest of a given size conditioned by its mass from the path of the unconditioned forest. Then, we prove an invariance principle for this conditioned forest by considering $k$ independent…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
We introduce random interlacements for transient vertex-reinforced jump processes on a general graph $G$. Using increasing finite subgraphs $G_n$ of $G$ with wired boundary conditions, we show convergence of the vertex-reinforced jump…
We study the behavior of Random Walk in Random Environment (RWRE) on trees in the critical case left open in previous work. Representing the random walk by an electrical network, we assume that the ratios of resistances of neighboring edges…
A rotor-router walk on a graph is a deterministic process, in which each vertex is endowed with a rotor that points to one of the neighbors. A particle located at some vertex first rotates the rotor in a prescribed order, and then it is…
A Galton-Watson branching process with immigration evolving in a random environment is considered. Its associated random walk is assumed to be oscillating. We prove a functional limit theorem in which the process under consideration is…
In arXiv:1609.05666v1 [math.PR] a functional limit theorem was proved. It states that symmetric processes associated with resistance metric measure spaces converge when the underlying spaces converge with respect to the…
In this note, we make explicit the law of the renormalized supercritical branching random walk, giving credit to a conjecture formulated in a previous works of the authors for a continuous analog of the branching random walk. Also, in the…
Reinforced Galton--Watson processes describe the dynamics of a population where reproduction events are reinforced, in the sense that offspring numbers of forebears can be repeated randomly by descendants. More specifically, the evolution…
Using the language of regular variation, we give a sufficient condition for a point process to be in the superposition domain of attraction of a strictly stable point process. This sufficient condition is then used to obtain an explicit…
This paper deals with a transient random walk in Dirichlet environment, or equivalently a linearly edge reinforced random walk, on a Galton-Watson tree. We compute the stationary distribution of the environment seen from the particle of an…
We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…
In this paper, we show that a Galton-Watson tree conditioned to have a fixed number of particles in generation $n$ converges in distribution as $n\rightarrow\infty$, and with this tool we study the span and gap statistics of a branching…
We consider the random conductance model, where the underlying graph is an infinite supercritical Galton--Watson tree, the conductances are independent but their distribution may depend on the degree of the incident vertices. We prove that,…