# Localization for Anderson Models on Metric and Discrete Tree Graphs

## TL;DR

This paper proves spectral and dynamical localization for Anderson models on radial trees, including cases with disordered geometry and Bernoulli potentials, using graph-theoretic and spectral analysis techniques.

## Contribution

It introduces a general approach to localization on radial trees with minimal disorder assumptions, covering both geometric and potential randomness.

## Key findings

- Localization on compact energy intervals outside exceptional sets
- Applicability to trees with disordered geometry and Bernoulli potentials
- Use of graph-theoretic and spectral analysis methods

## Abstract

We establish spectral and dynamical localization for several Anderson models on metric and discrete radial trees. The localization results are obtained on compact intervals contained in the complement of discrete sets of exceptional energies. All results are proved under the minimal hypothesis on the type of disorder: the random variables generating the trees assume at least two distinct values. This level of generality, in particular, allows us to treat radial trees with disordered geometry as well as Schr\"odinger operators with Bernoulli-type singular potentials. Our methods are based on an interplay between graph-theoretical properties of radial trees and spectral analysis of the associated random differential and difference operators on the half-line.