The parabolic Anderson model

Juergen Gaertner; Wolfgang Koenig

Home/Archive/arXiv

arXiv · math/0403091

The parabolic Anderson model

Juergen Gaertner·Wolfgang Koenig

View original source ↗Read source document ↗Export metadata ↓

Abstract

This is a survey on the intermittent behavior of the parabolic {Anderson} model, which is the Cauchy problem for the heat equation with random potential on the lattice $\Z^d$. We first introduce the model and give heuristic explanations of the long-time behavior of the solution, both in the annealed and the quenched setting for time-independent potentials. We thereby consider examples of potentials studied in the literature. In the particularly important case of an i.i.d. potential with double-exponential tails we formulate the asymptotic results in detail. Furthermore, we explain that, under mild regularity assumptions, there are only four different universality classes of asymptotic behaviors. Finally, we study the moment Lyapunov exponents for space-time homogeneous catalytic potentials generated by a {Poisson} field of random walks.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Juergen Gaertner, Wolfgang Koenig. 2004-03-04. The parabolic Anderson model. https://arxiv.org/abs/math/0403091

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the minimum bisection of random $3$-regular graphs

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

math.PR↗

arXiv2026

Quantitative Propagation of Chaos for Singular Interacting Particle Systems Driven by Fractional Brownian Motion

We consider interacting systems particle driven by i.i.d. fractional Brownian motions, subject to irregular, possibly distributional, pairwise interactions. We show propagation of chaos and mean field convergence to the law of the associated McKean--Vlasov equation, as the number of particles $N\to\infty$, with quantitative sharp rates of order $N^{-1/2}$. Our results hold for a wide class of possibly time-dependent interactions, which are only assumed to satisfy a Besov-type regularity, related to the Hurst parameter $H\in (0,+\infty)\setminus \mathbb{N}$ of the driving noises. In particular, as $H$ decreases to $0$, interaction kernels of arbitrary singularity can be considered, a phenomenon frequently observed in regularization by noise results. Our proofs rely on a combinations of Sznitman's direct comparison argument with stochastic sewing techniques.

math.PR↗

arXiv2026

Power rate of convergence of discrete curves: framework and applications

We develop a framework for power-law rates of convergence of random discrete curves to Schramm Loewner Evolution (SLE). We show that a power-law rate of convergence of a suitable martingale observable gives a power-law rate of convergence of the interface to SLE, provided the discrete curves satisfy the Kemppainen-Smirnov crossing condition; the proof uses known estimates on the derivative of the SLE map. We apply the framework to the exploration process of critical site percolation on the triangular lattice, obtaining a power-law rate of convergence to SLE$_6$.

math.PR↗