Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Alexander Fribergh Mathematics , 2011, DOI: 10.1214/13-AOP835 Abstract: We study the biased random walk in positive random conductances on $\mathbb {Z}^d$. This walk is transient in the direction of the bias. Our main result is that the random walk is ballistic if, and only if, the conductances have finite mean. Moreover, in the sub-ballistic regime we find the polynomial order of the distance moved by the particle. This extends results obtained by Shen [Ann. Appl. Probab. 12 (2002) 477-510], who proved positivity of the speed in the uniformly elliptic setting.
 Mathematics , 2011, Abstract: We derive an annealed large deviation principle for the normalised local times of a continuous-time random walk among random conductances in a finite domain in $\Z^d$ in the spirit of Donsker-Varadhan \cite{DV75}. We work in the interesting case that the conductances may assume arbitrarily small values. Thus, the underlying picture of the principle is a joint strategy of small values of the conductances and large holding times of the walk. The speed and the rate function of our principle are explicit in terms of the lower tails of the conductance distribution. As an application, we identify the logarithmic asymptotics of the lower tails of the principal eigenvalue of the randomly perturbed negative Laplace operator in the domain.
 Mathematics , 2007, Abstract: We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of i.i.d. random nearest-neighbor conductances $\omega_{xy}\in[0,1]$. Apart from the requirement that the bonds with positive conductances percolate, we pose no restriction on the law of the $\omega$'s. We prove that, for a.e. realization of the environment, the path distribution of the walk converges weakly to that of non-degenerate, isotropic Brownian motion. The quenched functional CLT holds despite the fact that the local CLT may fail in $d\ge5$ due to anomalously slow decay of the probability that the walk returns to the starting point at a given time (cf math.PR/0611666).
 Jean-Marc Derrien Mathematics , 2013, Abstract: We prove a local limit theorem for nearest neighbours random walks in stationary random environment of conductances on Z without using any of both classic assumptions of uniform ellipticity and independence on the conductances. Besides the central limit theorem, we use discrete differential "Nash-type inequalities" associated with the Hausdorff's representation of the completely decreasing sequences.
 Mathematics , 2013, Abstract: We consider a random walk on a random graph $(V,E)$, where $V$ is the set of open sites under i.i.d. Bernoulli site percolation on the multi-dimensional integer set $\mathbf{Z}^d$, and the transition probabilities of the walk are generated by i.i.d. random conductances (positive numbers) assigned to the edges in $E$. This random walk in random environments has long range jumps and is reversible. We prove the quenched invariance principle for this walk when the random conductances are unbounded from above but uniformly bounded from zero by taking the corrector approach. To this end, we prove a metric comparison between the graph metric and the Euclidean metric on the graph $(V, E)$, an estimation of a first-passage percolation and an almost surely weighted Poincar{\'{e}} inequality on $(V,E)$, which are used to prove the quenched heat kernel estimations for the random walk.
 Sebastian Andres Mathematics , 2012, DOI: 10.1214/12-AIHP527 Abstract: We study a continuous time random walk X in an environment of dynamic random conductances. We assume that the conductances are stationary ergodic, uniformly bounded and bounded away from zero and polynomially mixing in space and time. We prove a quenched invariance principle for X, and obtain Green's functions bounds and a local limit theorem. We also discuss a connection to stochastic interface models.
 L. Avena Mathematics , 2012, Abstract: We consider a finite range symmetric exclusion process on the integer lattice in any dimension. We interpret it as a non-elliptic time-dependent random conductance model by setting conductances equal to one over the edges with end points occupied by particles of the exclusion process and to zero elsewhere. We prove a law of large number and a central limit theorem for the random walk driven by such a dynamical field of conductances by using the Kipnis-Varhadan martingale approximation. Unlike the tagged particle in the exclusion process, which is in some sense similar to this model, this random walk is diffusive even in the one-dimensional nearest-neighbor case.
 Mathematics , 2009, Abstract: The Central Limit Theorem for the random walk on a stationary random network of conductances has been studied by several authors. In one dimension, when conductances and resistances are integrable, and following a method of martingale introduced by S. Kozlov (1985), we can prove the Quenched Central Limit Theorem. In that case the variance of the limit law is not null. When resistances are not integrable, the Annealed Central Limit Theorem with null variance was established by Y. Derriennic and M. Lin (personal communication). The quenched version of this last theorem is proved here, by using a very simple method. The similar problem for the continuous diffusion is then considered. Finally our method allows us to prove an inequality for the quadratic mean of a diffusion (X_t)_t at all time t.
 Mathematics , 2013, Abstract: We derive an annealed large deviation principle (LDP) for the normalised and rescaled local times of a continuous-time random walk among random conductances (RWRC) in a time-dependent, growing box in $\Z^d$. We work in the interesting case that the conductances are positive, but may assume arbitrarily small values. Thus, the underlying picture of the principle is a joint strategy of small conductance values and large holding times of the walk. The speed and the rate function of our principle are explicit in terms of the lower tails of the conductance distribution as well as the time-dependent size of the box. An interesting phase transition occurs if the thickness parameter of the conductance tails exceeds a certain threshold: for thicker tails, the random walk spreads out over the entire growing box, for thinner tails it stays confined to some bounded region. In fact, in the first case, the rate function turns out to be equal to the $p$-th power of the $p$-norm of the gradient of the square root for some $p\in(\frac {2d}{d+2},2)$. This extends the Donsker-Varadhan-G\"artner rate function for the local times of Brownian motion (with deterministic environment) from $p=2$ to these values. As corollaries of our LDP, we derive the logarithmic asymptotics of the non-exit probability of the RWRC from the growing box, and the Lifshitz tails of the generator of the RWRC, the randomised Laplace operator. To contrast with the annealed, not uniformly elliptic case, we also provide an LDP in the quenched setting for conductances that are bounded and bounded away from zero. The main tool here is a spectral homogenisation result, based on a quenched invariance principle for the RWRC.
 Mathematics , 2006, DOI: 10.1214/07-AIHP126 Abstract: We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of bounded random conductances $\omega_{xy}\in[0,1]$. The conductance law is i.i.d. subject to the condition that the probability of $\omega_{xy}>0$ exceeds the threshold for bond percolation on $\Z^d$. For environments in which the origin is connected to infinity by bonds with positive conductances, we study the decay of the $2n$-step return probability $P_\omega^{2n}(0,0)$. We prove that $P_\omega^{2n}(0,0)$ is bounded by a random constant times $n^{-d/2}$ in $d=2,3$, while it is $o(n^{-2})$ in $d\ge5$ and $O(n^{-2}\log n)$ in $d=4$. By producing examples with anomalous heat-kernel decay approaching $1/n^2$ we prove that the $o(n^{-2})$ bound in $d\ge5$ is the best possible. We also construct natural $n$-dependent environments that exhibit the extra $\log n$ factor in $d=4$. See also math.PR/0701248.
 Page 1 /100 Display every page 5 10 20 Item