English
Related papers

Related papers: The parabolic Anderson model on a Galton-Watson tr…

200 papers

Motivated by the link between Anderson localisation on high-dimensional graphs and many-body localisation, we study the effect of periodic driving on Anderson localisation on random trees. The time dependence is eliminated in favour of an…

Disordered Systems and Neural Networks · Physics 2021-03-31 Sthitadhi Roy , Roderich Moessner , Achilleas Lazarides

We study the long-time behavior of localized solutions to linear or semilinear parabolic equations in the whole space $\mathbb{R}^n$, where $n \ge 2$, assuming that the diffusion matrix depends on the space variable $x$ and has a finite…

Analysis of PDEs · Mathematics 2020-05-29 Thierry Gallay , Romain Joly , Geneviève Raugel

Results of large-scale numerical simulations are reported on the Anderson localization in a two-dimensional square lattice tight-binding model with random flux. Localization lengths, fluctuations of the conductance, and the density of…

Mesoscale and Nanoscale Physics · Physics 2009-01-23 A. Furusaki

Suppose that the edges of a complete graph are assigned weights independently at random and we ask for the weight of the minimal-weight spanning tree, or perfect matching, or Hamiltonian cycle. For these and several other common…

Combinatorics · Mathematics 2025-01-28 Yun Cheng , Yixue Liu , Tomasz Tkocz , Albert Xu

We study the Anderson localization of atomic gases exposed to three-dimensional optical speckles by analyzing the statistics of the energy-level spacings. This method allows us to consider realistic models of the speckle patterns, taking…

Quantum Gases · Physics 2015-06-17 Elisa Fratini , Sebastiano Pilati

The space requirements of an $m$-ary search tree satisfies a well-known phase transition: when $m\leq 26$, the second order asymptotics is Gaussian. When $m\geq 27$, it is not Gaussian any longer and a limit $W$ of a complex-valued…

Probability · Mathematics 2012-01-20 Brigitte Chauvin , Quansheng Liu , Nicolas Pouyanne

We introduce generalizations of Aldous' Brownian Continuous Random Tree as scaling limits for multicritical models of discrete trees. These discrete models involve trees with fine-tuned vertex-dependent weights ensuring a k-th root…

Mathematical Physics · Physics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

Recent progress in the study of the contact process [2] has verified that the extinction-survival threshold $\lambda_1$ on a Galton-Watson tree is strictly positive if and only if the offspring distribution $\xi$ has an exponential tail. In…

Probability · Mathematics 2019-10-31 Danny Nam , Oanh Nguyen , Allan Sly

In this paper we consider inhomogeneous Galton-Watson trees, and derive various moments for such processes: the number of vertices, the number of leaves, and the height of the tree. Also we make a simple condition of finiteness. We use…

Applications · Statistics 2025-05-09 Jakob G. Rasmussen , Troels Pedersen , Rasmus L. Olsen

We prove delocalization for the Anderson model on an infinite regular tree (or Cayley graph or Bethe lattice) at low disorder. This extends earlier results of Klein and Aizenman--Warzel by filling in the previously missing parts of the…

Probability · Mathematics 2025-11-14 Reuben Drogin , Charles K Smart

A new approach is applied to the 1D Anderson model by making use of a two-dimensional Hamiltonian map. For a weak disorder this approach allows for a simple derivation of correct expressions for the localization length both at the center…

Disordered Systems and Neural Networks · Physics 2009-10-31 F. M. Izrailev , S. Ruffo , L. Tessieri

We consider branching particle processes on discrete structures like the hypercube in a random fitness landscape (i.e., random branching/killing rates). The main question is about the location where the main part of the population sits at a…

Probability · Mathematics 2021-07-20 Wolfgang König

We consider Galton--Watson trees conditioned on both the total number of vertices $n$ and the number of leaves $k$. The focus is on the case in which both $k$ and $n$ grow to infinity and $k = \alpha n + O(1)$, with $\alpha \in (0, 1)$.…

Probability · Mathematics 2023-10-19 Vladislav Kargin

We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…

Probability · Mathematics 2019-03-07 Nicolas Curien , Tom Hutchcroft , Asaf Nachmias

We derive rigorously the leading asymptotics of the so-called Anderson integral in the thermodynamic limit for one-dimensional, non-relativistic, spin-less Fermi systems. The coefficient, $\gamma$, of the leading term is computed in terms…

Mathematical Physics · Physics 2013-10-30 Heinrich Küttler , Peter Otte , Wolfgang Spitzer

We consider infinite Galton-Watson trees without leaves together with i.i.d.~random variables called marks on each of their vertices. We define a class of flow rules on marked Galton-Watson trees for which we are able, under some algebraic…

Probability · Mathematics 2018-05-07 Pierre Rousselin

A Slave-Boson perturbational approach to ground-state properties of the $U\to\infty$ periodic Anderson model is derived as an expansion around the Atomic Limit ($V=0$). In the case of zero temperature any constraint-integral or limiting…

Condensed Matter · Physics 2009-10-28 Jan Brinckmann

We build a regular version of the field $Z_{\beta}(t,x|s,y)$ which describes the Green's function, or fundamental solution, of the parabolic Anderson model (PAM) with white noise forcing on $\mathbb{R}^{1+1}$: $\partial_t Z_{\beta}(t,x |…

Probability · Mathematics 2022-11-16 Tom Alberts , Christopher Janjigian , Firas Rassoul-Agha , Timo Seppäläinen

We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…

Probability · Mathematics 2018-09-17 Leon Ramzews , Benedikt Stufler

We study the totally asymmetric simple exclusion process (TASEP) on trees where particles are generated at the root. Particles can only jump away from the root, and they jump from $x$ to $y$ at rate $r_{x,y}$ provided $y$ is empty. Starting…

Probability · Mathematics 2024-10-01 Nina Gantert , Nicos Georgiou , Dominik Schmid
‹ Prev 1 4 5 6 7 8 10 Next ›