# The Number of Open Paths in an Oriented ρ-Percolation Model

@article{Comets2007TheNO,
title={The Number of Open Paths in an Oriented $\rho$-Percolation Model},
author={Francis Comets and Serguei Yu. Popov and M. Vachkovskaia},
journal={Journal of Statistical Physics},
year={2007},
volume={131},
pages={357-379}
}
• Published 5 July 2007
• Mathematics
• Journal of Statistical Physics
We study the asymptotic properties of the number of open paths of length n in an oriented ρ-percolation model. We show that this number is enα(ρ)(1+o(1)) as n→∞. The exponent α is deterministic, it can be expressed in terms of the free energy of a polymer model, and it can be explicitly computed in some range of the parameters. Moreover, in a restricted range of the parameters, we even show that the number of such paths is n−1/2Wenα(ρ)(1+o(1)) for some nondegenerate random variable W. We build…
• Mathematics
• 2013
We study the number $N_n$ of open paths of length $n$ in supercritical oriented percolation on $\Zd \times \N$, with $d \ge 1$. We prove that on the percolation event $\{\inf N_n>0\}$, $N_n^{1/n}$
The sequence of random probability measures ν n that gives a path of length n , times the sum of the random weights collected along the paths, is shown to satisfy a large deviations principle with
• Mathematics
• 2015
We study asymptotics of the free energy for the directed polymer in random environment. The polymer is allowed to make unbounded jumps and the environment is given by Bernoulli variables. We first
• Mathematics
• 2008
We consider a model of directed polymers on a regular tree with a disorder given by independent, identically distributed weights attached to the vertices. For suitable weight distributions this model
We are interested in two probabilistic models of a process interacting with a random environment. Firstly, we consider the model of directed polymers in random environment. In this case, a polymer,
In this chapter we deal with polymer models on different oriented graphs and compare them with the lattice case. As revealed by Derrida and Spohn in, many interesting questions can be answered on the
• Mathematics
The Annals of Probability
• 2020
We show that the number of maximal paths in directed last-passage percolation on the hypercubic lattice ${\mathbb Z}^d$ $(d\geq2)$ in which weights take finitely many values is typically
Consider a $p$-random subset $A$ of initially infected vertices in the discrete cube $[L]^3$, and assume that the neighbourhood of each vertex consists of the $a_i$ nearest neighbours in the \$\pm