# zbMATH — the first resource for mathematics

Parabolic problems for the Anderson model. I: Intermittency and related topics. (English) Zbl 0711.60055
Summary: The objective of this paper is a mathematically rigorous investigation of intermittency and related questions intensively studied in different areas of physics, in particular in hydrodynamics. On a qualitative level, intermittent random fields are distinguished by the appearance of sparsely distributed sharp “peaks” which give the main contribution to the formation of the statistical moments. The paper deals with the Cauchy problem $(\partial /\partial t)u(t,x)=Hu(t,x),\quad u(0,x)=u_ 0(x)\geq 0,\quad (t,x)\in {\mathbb{R}}_+\times {\mathbb{Z}}^ d,$ for the Anderson Hamiltonian $$H=\kappa \Delta +\xi (\cdot)$$, where $$\xi$$ (x), $$x\in {\mathbb{Z}}^ d$$, is a (generally unbounded) spatially homogeneous random potential.
This first part is devoted to some basic problems. Using percolation arguments, a complete answer to the question of existence and uniqueness for the Cauchy problem in the class of all nonnegative solutions is given in the case of i.i.d. random variables. Necessary and sufficient conditions for intermittency of the fields u(t,$$\cdot)$$ as $$t\to \infty$$ are found in spectral terms of H. Rough asymptotic formulas for the statistical moments and the almost sure behavior of u(t,x) as $$t\to \infty$$ are also derived.

##### MSC:
 60H25 Random operators and equations (aspects of stochastic analysis) 81Q05 Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics
Full Text:
##### References:
 [1] Aizenman, M., Kesten, H., Newman, C.M.: Uniqueness of the infinite cluster and continuity of connectivity functions for short and long range percolation. Commun. Math. Phys.111, 505–531 (1987) · Zbl 0642.60102 [2] Anderson, P.W.: Absence of diffusion in certain random lattices. Phys. Rev.109, 1492–1505 (1958) [3] Dawson, D.A., Ivanoff, G.: Branching diffusions and random measures. Adv. Probab. Relat. Top.5, 61–104 (1978) · Zbl 0407.60087 [4] Ejdel’man, S.D.: Parabolic systems (Russian). Moscow: Nauka 1964 [5] Fröhlich, J., Martinelli, F., Scoppola, E., Spencer, T.: Constructive proof of localization in the Anderson tight binding model. Commun. Math. Phys.101, 21–46 (1985) · Zbl 0573.60096 [6] Kesten, H.: Percolation theory for mathematicians. Boston: Birkhäuser 1982 · Zbl 0522.60097 [7] Kesten, H.: Percolation theory and first passage percolation. Ann. Probab.15, 1231–1271 (1987) · Zbl 0629.60103 [8] Kuratowski, K.: Topology, Vol. 2. New York, London: Academic Press 1968 [9] Martinelli, F., Scoppola, E.: Introduction to the mathematical theory of Anderson localization. Riv. Nuovo Cimento10, 1–90 (1987) [10] Men’shikov, M.V., Molchanov, S.A., Sidorenko, A.F.: Percolation theory and some applications (Russian). Itogi Nauki Tekh., Ser. Teor. Veroyatn., Mat. Stat., Teor. Kibern.24, 53–110, Moscow 1986 · Zbl 0647.60103 [11] Pastur, L.A.: Spectral theory of random self-adjoint operators (Russian). Itogi Nauki Tekh., Ser. Teor. Veroyatn., Mat. Stat., Teor. Kibern.25, 3–67, Moscow 1987 · Zbl 0661.60079 [12] Sevast’yanov, B.A.: Branching processes (Russian). Moscow: Nauka 1971 [13] Zel’dovich, Ya.B., Molchanov, S.A., Ruzmajkin, A.A., Sokolov, D.D.: Intermittent passive fields in random media (Russian). Zh. Eksper. Teoret. Fiz.89, 2061–2072 (1985) [Sov. Phys. JETP62, 1188 (1985)] [14] Zel’dovich, Ya.B., Molchanov, S.A., Ruzmajkin, A.A., Sokolov, D.D.: Intermittency in random media (Russian). Usp. Fiz. Nauk152, 3–32 (1987) [15] Zel’dovich, Ya.B., Molchanov, S.A., Ruzmajkin, A.A., Sokolov, D.D.: Intermittency, diffusion and generation in a nonstationary random medium. Sov. Sci. Rev., Sect. C Math. Phys. Rev.7, 1–110 (1988) · Zbl 0642.60039
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.