相关论文: The maximal flow from a compact convex subset to i…

This paper concerns maximal flows on $\mathbb{Z}^2$ traveling from a convex set to infinity, the flows being restricted by a random capacity. For every compact convex set $A$, we prove that the maximal flow $\Phi(nA)$ between $nA$ and…

We consider the standard model of i.i.d. first passage percolation on Z^d given a distribution G on [0, +$\infty$] (including +$\infty$). We suppose that G({0}) > 1 -- p\_c(d), i.e., the edges of positive passage time are in the subcritical…

We consider the standard first passage percolation on $\mathbb{Z}^{d}$: with each edge of the lattice we associate a random capacity. We are interested in the maximal flow through a cylinder in this graph. Under some assumptions Kesten…

We consider the standard first passage percolation in $\mathbb{Z}^{d}$ for $d\geq 2$ and we denote by $\phi_{n^{d-1},h(n)}$ the maximal flow through the cylinder $]0,n]^{d-1} \times ]0,h(n)]$ from its bottom to its top. Kesten proved a law…

We consider the standard first passage percolation model in $\ZZ^d$ for $d\geq 2$ and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a…

We consider the model of i.i.d. first passage percolation on Z^d, where we associate with the edges of the graph a family of i.i.d. random variables with common distribution G on [0, +$\infty$] (including +$\infty$). Whereas the time…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq2$ and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma ^1$ and $\Gamma ^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model in the rescaled graph $\mathbb {Z}^d/n$ for $d\geq2$ and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb {R}^d$. Let $\Gamma ^1$ and $\Gamma ^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model in the rescaled lattice $\mathbb{Z}^d$ for $d\geq 2$ and a bounded domain $\Omega$ in $\mathbb R ^d$. We denote by $\Gamma^1$ and $\Gamma^2$ two disjoint subsets of $\partial \Omega$…

We consider the standard first passage percolation model in $\mathbb{Z}^d$ for $d\geq 2$. We are interested in two quantities, the maximal flow $\tau$ between the lower half and the upper half of the box, and the maximal flow $\phi$ between…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model in the rescaled graph $\mathbb{Z}^d/n$ for $d\geq 2$, and a domain $\Omega$ of boundary $\Gamma$ in $\mathbb{R}^d$. Let $\Gamma^1$ and $\Gamma^2$ be two disjoint open subsets of…

We consider the standard first passage percolation model in the rescaled lattice $\mathbb Z^d/n$ for $d\geq 2$ and a bounded domain $\Omega$ in $\mathbb R^d$. We denote by $\Gamma^1$ and $\Gamma^2$ two disjoint subsets of $\partial \Omega$…

Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. A law of large numbers is known for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. We prove that…

We study the time constant $\mu(e_{1})$ in first passage percolation on $\mathbb Z^{d}$ as a function of the dimension. We prove that if the passage times have finite mean, $$\lim_{d \to \infty} \frac{\mu(e_{1}) d}{\log d} = \frac{1}{2a},$$…

We independently assign a non-negative value, as a capacity for the quantity of flows per unit time, with a distribution F to each edge on the Z^d lattice. We consider the maximum flows through the edges of two disjoint sets, that is from a…

Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. We prove a law of large numbers for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. The value of the…

We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…

We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product $G\square G \square \dots \square G$ of some base graph $G$ as the number of factors tends to infinity. We…

In this paper, we study some properties of optimal paths in the first passage percolation on $\Z^d$ and show the followings: (1) the number of optimal paths has an exponential growth if the distribution has an atom; (2) the means of…