Localization for Anderson Models on Metric and Discrete Tree Graphs
David Damanik (Rice University), Jake Fillman (Virginia Tech), Selim, Sukhtaiev (Rice University)

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.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Localization for Anderson Models on
Metric and Discrete Tree Graphs
David Damanik
Department of Mathematics, Rice University, Houston, TX 77005, USA
,
Jake Fillman
Department of Mathematics, Texas State University, San Marcos, TX 78666, USA
and
Selim Sukhtaiev
Department of Mathematics, Rice University, Houston, TX 77005, USA
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ödinger 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.
Key words and phrases:
Anderson localization, Laplace operator, tree graphs
D.D. was supported in part by NSF grant DMS–1700131.
J.F. was supported in part by an AMS-Simons travel grant, 2016-2018
S.S. was supported in part by an AMS-Simons travel grant, 2017-2019
Contents
-
3.2 Positivity of Lyapunov Exponents via Fürstenberg’s Theorem
-
4.2 Proof of Dynamical and Exponential Localization for Metric Trees
-
5.3 Dynamical and Exponential Localization for Discrete Random Trees
1. Introduction
1.1. Description of Main Results
The central theme of this paper is Anderson localization for random models on tree graphs. In the first part of this work we establish spectral and dynamical localization for continuum Laplace operators subject to random Kirchhoff vertex conditions on radial trees with disordered geometry. Specifically, we consider metric trees with random branching numbers and random edge lengths. The second part of this paper addresses analogous questions for random second order difference operators on discrete radial trees with random branching numbers. At the outset, we emphasize that our results are all proved under the minimal possible hypotheses. Namely, we assume that the random variables used to generate the trees take at least two distinct values. We will formulate this assumption more precisely as Hypothesis 3.1. In particular, we can handle the case of Bernoulli distributions, which is generally considered to be the most challenging setting.
To begin, let us describe the models. Let be a metric tree with vertices , edges , and uniformly bounded edge lengths . We further assume that there is a unique vertex with degree 1, which we call the root of ; see, for example, Figure 1. For each vertex , (the generation of ) is the combinatorial distance from to the root. One defines for similarly. We consider the Laplace operator acting in . In order to ensure self-adjointness of , we impose a Dirichlet condition at , that is,
[TABLE]
as well as Kirchhoff vertex conditions given by
[TABLE]
where is a real-valued function, and denotes the inward-pointed derivative along the edge . The assumption that is purely for convenience. If the root has degree 2 or higher, the Dirichlet condition (1.1) implies that the operators we study decompose into a direct sum of operators covered by the case. In the simplified case the vertex conditions (1.2) provide a rigorous description of the self-adjoint realization of Schrödinger operators with zero-range potentials and coupling constants (cf., e.g., [7, Section III.2.1], [9, Section 1.4.1]).
We denote the branching number of each vertex by for . In this work, we assume that all quantities are radial. That is to say, we assume that and depend only on and depends only on . The three continuum random models treated in this paper are: the random branching model (RBM), the random lengths model (RLM), and the random Kirchhoff model (RKM). In these models, the branching numbers, the Kirchhoff coupling constants, and the edge lengths are independent identically distributed Bernoulli-type random variables which depend only on the distance to the root ; the precise description of these models is provided in Section 3.1. In fact, our approach can allow all three parameters to vary simultaneously; we simply single out RBM, RLM, and RKM as prominent applications of our method. Thus, these models are parameterized by a choice of a probability measure supported on a set of the form , which gives the probability distribution for the branching numbers, the edge lengths, and the Kirchhoff potential at each generation. To be a little more specific, the probability space is with measure ; then, each produces a tree model with parameters dictated by
[TABLE]
Our approach is based on the orthogonal decomposition of into a countable collection of reducing subspaces of the operator ; cf. [52], [53] (see also [22]). The restriction of on each subspace is unitarily equivalent to a shifted version of the model half-line operator acting in , subject to the Dirichlet condition at [math] and self-adjoint vertex conditions of the form
[TABLE]
where denotes the distance from the root to vertices of generation . Similarly denotes the branching number and is the Kirchhoff coupling constant at generation .
The natural occurrence of Bernoulli models in this paper is due to random branching; in particular, the branching at each generation may only take integral values, so any randomness in the branching parameter must necessarily be discrete. Broadly speaking, the behavior of random models (at least in one spatial dimension) tends to be monotone in the randomness. In particular, increasing the randomness of the model tends to make the spectrum more singular. Thus, proving localization statements in the situation in which the single-site distribution is supported on two points (the Bernoulli case) is the most challenging task.
To prove localization for the 1D half-line operator , we adapt the approach of [19], which itself fits into the general framework of spectral analysis via transfer matrix techniques, see, e.g., [26, 55] for illuminating discussions. Recall that a generalized eigenfunction is an solution of the eigenvalue equation that enjoys a linear upper bound; in this case, is known as the corresponding generalized eigenvalue.
For the proof, we first employ Fürstenberg’s Theorem to ensure positivity of the Lyapunov exponent away from a discrete set (Theorem 3.5), and then show that almost surely all generalized eigenfunctions exhibit Lyapunov behavior in every compact interval , (Theorem 3.13). This shows that the generalized eigenfunctions decay exponentially, which establishes spectral localization. At that point, the established exponential decay of generalized eigenfunctions is combined with the proof of spectral localization to bootstrap sharper bounds for the eigenfunctions in terms of their centers of localization, cf. (3.47). The latter are crucial for showing dynamical localization. We summarize this discussion by formulating the first main result of this work.
Theorem 1.1**.**
Suppose contains at least two points. Then there exists a discrete set such that for every compact interval and every , there exists with such that
[TABLE]
whenever and
[TABLE]
for some universal constant .
We prove this Theorem in Section 3. We deduce the second main result of the paper by combining Theorem 1.1 and the orthogonal decomposition of radial trees; see Section 4.
Theorem 1.2**.**
Suppose contains at least two points. Then, there exists a discrete set such that the following two assertions hold.
- (i)
The operator exhibits Anderson localization at all energies outside of . That is, almost surely, has pure point spectrum and any eigenfunction of corresponding to an energy enjoys an exponential decay estimate of the form
[TABLE]
with and , where denotes the number of vertices in the generation of , i.e., . 2. (ii)
For every compact interval and every , there exists a set with such that for every and every compact set one has
[TABLE]
where is the spectral projection corresponding to , and denotes the operator of multiplication by the radial function , , where denotes the distance from to the root .
We note that the theorem above gives localization for RBM, RLM, and RKM. We also note that the spectrum of is given by a deterministic set. This is addressed in Section 4.1 where we also point out that the analogous question for the half-line operator presents some complications which are not typical for full–line ergodic models, see Remark 4.2.
Remark 1.3*.*
A few remarks:
- (1)
The assumption that the support of the single-generation distribution contains at least two points is clearly necessary. For, if consists of a single point, then there is only one operator , which is then periodic and hence does not exhibit Anderson localization. 2. (2)
We will refer to functions on trees obeying an estimate like (1.6) as tree-exponentially decaying. Since the number of vertices at the th generation grows exponentially with , the factor of in the denominator implies that the eigenfunction decay leads to square-integrability. 3. (3)
The transfer matrices for the half-line models can be bounded at isolated energies, and hence one cannot avoid excluding a discrete set of energies. This will be discussed in more detail in Section 3.
In Part II we address analogous questions for the discrete versions of RBM, RLM, and RKM, namely, we consider discrete Schrödinger and weighted adjacency operators on radial trees with random branching numbers, hopping parameters, and vertex potentials. Concretely, we consider rooted radial tree graphs as before. Given functions and , the corresponding Schrödinger operators and are given by
[TABLE]
[TABLE]
As before, we will assume that , , and are bounded radial functions, so the randomness will be encoded in a measure which gives the distribution of branching numbers, edge weights, and vertex potentials in each generation. We will define this more precisely in Part II. Our third main result is the following theorem which is proved in Section 5.3. The quantity in (1.11) below denotes the number of points in the subtree rooted at that are at a distance from ; see (2.1) for the definition.
Theorem 1.4**.**
Assume contains at least two points. Let or . Then there exists a set of cardinality at most one such that the following assertions hold.
- (i)
The operator exhibits Anderson localization at all energies outside of . That is, almost surely, has pure point spectrum and any eigenfunction of corresponding to an energy enjoys an exponential decay estimate of the form
[TABLE]
where are constants. 2. (ii)
For every compact interval there exist with and such that for every , , one has
[TABLE]
for some . In particular, for all , , one has
[TABLE]
for some and .
It is proved in Section 5.1 that the spectrum of is given by a deterministic set. It is interesting to contrast this result with the work of Klein [51] (see also [2, 34] for alternative proofs), which works without the radial assumption. In that model, each vertex potential is an i.i.d. random variable, and that model exhibits absolutely continuous spectrum in suitable energy regions for small coupling; it therefore does not exhibit localization uniformly, whereas the model in this work does. In particular, the model of [51] is more random than this one, and yet the spectral type is more regular.
Our work is motivated by the paper [44], which investigated RLM and RKM, and can be viewed as a natural continuation of [27] where discrete RBM was considered. It is worth noting that the methods of [44] are not applicable in the present setting since they are based on spectral averaging and hence rely heavily on the assumption that the random variables are absolutely continuous. Of course, in the case of random branching numbers such a hypothesis cannot be made. We stress again that RBM naturally presents the most challenging case of random models, which are commonly referred to as Bernoulli–Anderson-type models. A textbook discussion of some difficulties presented by Bernoulli-type potentials is provided in the Notes sections of Chapters 4, 7, and 12 of [6].
1.2. Background
The spectral theory of Schrödinger operators on tree graphs has attracted a lot of attention cf., e.g., [1, 2, 3, 13, 14, 15, 16, 17, 18, 22, 27, 28, 29, 30, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 57, 58, 59]. The recurring topic in these works is the dependence of the spectrum of differential operators on the geometry of trees, in particular, on their growth rates, edge lengths, and branching numbers. For example, Ekholm, Frank, and Kovarik established Lieb–Thirring inequalities which heavily depend on the growth rate and the global dimension of underlying trees, cf. [29], and Frank and Kovarik obtained heat kernel estimates for various trees in [30]. Evans, Harris, and Pick studied Hardy inequalities on trees in the context of eigenvalue counting for the Neumann Laplacian on bounded domains with fractal boundaries cf. [31, 32]. This topic was further developed by Naimark and Solomyak in [52, 53]. As far as the discrete spectrum is concerned, Solomyak also obtained Weyl’s asymptotic formula for compact metric trees with the standard power-law behavior replaced by (this hints on mixed dimensionality of the model) with depending on the tree, cf. [59]. Further, the dependence of the spectral type on the geometry was investigated by Breuer, Frank, and Kovarik in [16, 13]. Exponential decay of the eigenfunctions on trees (and more general graphs) was recently discussed by Harrell and Maltsev in [43]. Aizenman, Sims, and Warzel studied the effects of disorder in the geometry of trees. In particular, they considered trees with edge lengths given by where and are i.i.d. random variables, and proved in [1] that the absolutely continuous spectrum of the Laplace operator is continuous (in the sense of [1, Theorem 1.1]) at almost surely. That such a continuity property fails in the case of radial disorder is conjectured in [1] and proved by Hislop and Post in [44]. As already mentioned earlier, the existence of absolutely continuous spectrum for the Anderson Hamiltonian on the regular trees in the regime of small disorder was shown by Klein in [51] (and also by Aizenman, Sims, and Warzel in [2] as well as by Froese, Hasler, and Spitzer in [34]). Thematically related recent results are due to Aizenman and Warzel [4, 5] showing delocalization near the spectral edges for random Schrödinger oprators on discrete trees.
The structure of the paper follows. In Section 2, we discuss the spectral theory of deterministic continuum operators on metric tree graphs. We use this to set notation and to give the reader relevant background on a reduction from the metric tree graphs to Schrödinger operators on a half-line with singular potentials. We prove a localization result for these half-line operators in Section 3, which we then use to prove our main results for metric tree graphs in Section 4. The case of discrete operators on random tree graphs is taken up in Part II.
Part I Anderson Localization for Continuum Radial Trees
2. Spectral Theory of Deterministic Continuum Operators
In this section we introduce deterministic Laplace operators on radial tree graphs, discuss their orthogonal decomposition, and establish several auxiliary results regarding the spectral theory of the one-dimensional half-line operators arising in such a decomposition.
To set the stage, we fix a metric rooted tree with vertices , edges , root , and edge lengths . The shortest path connecting and and its length are denoted by and , respectively, and . The generation and the branching number of a vertex are defined by
[TABLE]
In other words, is the combinatorial graph distance from to the root and is the number of children of . For an edge , we define . Furthermore, denotes the “forward” subtree of rooted at , that is, ; its branching function is given by
[TABLE]
For example, given a vertex , counts the number of vertices in the same generation as .
Hypothesis 2.1**.**
* is a rooted radial metric tree with bounded branching and bounded edge lengths, , and is a bounded radial potential. More precisely:*
- (i)
There are constants , and sequences , such that
- •
* for all *(except, ),
- •
* for all .* 2. (ii)
There are constants and a sequence such that .
When satisfies Hypothesis 2.1, we will write to emphasize the dependence of on the branching and length sequences.
Given satisfying Hypothesis 2.1, we equip with a sequence of degree two vertices , where denotes the distance from the root to vertices at generation , that is,
[TABLE]
Then, we introduce the Sobolev spaces on such a chain of intervals
[TABLE]
A note on notation: throughout this paper, we write for and for . Let us note that we use the notation even though the exact composition of the space depends on the vertices . Similarly, on , we define
[TABLE]
Notice that the elements of or may be discontinuous at the vertices.
2.1. Orthogonal Decomposition of Radial Trees
Given a radial tree and a potential satisfying Hypothesis 2.1, we consider the self-adjoint operator defined by
[TABLE]
Due to the radial structure of the graph, enjoys an orthogonal decomposition into -reducing subspaces; cf. [22], [52], [58], [59]. Namely, to every vertex there corresponds an -reducing subspace such that
[TABLE]
where denotes the orthogonal projection onto in . Furthermore, each subspace can be further decomposed into subspaces, each of which is also -reducing, that is,
[TABLE]
and . Moreover, the reduced operators are unitarily equivalent to 1D Schrödinger operators acting in . Concretely, the operators
[TABLE]
are unitarily equivalent to the operator
[TABLE]
where denotes the left shift and
[TABLE]
for . The unitary map
[TABLE]
realizing the equivalence is defined by
[TABLE]
where denotes the forward subtree determined by the th edge emanating from the vertex . Letting in (2.14), one defines . We point out that whenever belongs to the domain of the operator defined in (2.9). Indeed, continuity of at is ensured by the Dirichlet condition (2.12) while the Kirchhoff condition at is satisfied due to (2.14) and the fact that the sum of roots of unity is equal to zero. At all other vertices, one has continuity and the Kirchhoff condition by (1.3).
Combining these unitary operators together, one defines
[TABLE]
and has, [52, Theorem 4.1],
[TABLE]
Next, we turn to the spectral analysis of for fixed admissible . First, the eigenvalue problem for this operator can be written in terms of suitable matrices. Namely, if is a solution to the problem
[TABLE]
then one has
[TABLE]
where , and
[TABLE]
In this case, we can interpolate between the vertices to get
[TABLE]
for all , . Conversely, given initial data , then (2.20) and (2.22) construct a solution to the problem (2.19). Furthermore, if and only if
[TABLE]
2.2. Quadratic Form of the Model Half-Line Operator
The following proposition describes the quadratic form of and provides prerequisites for the Weyl criteria used in the proof of later results (e.g. Theorem 4.1).
Lemma 2.2**.**
Assume Hypothesis 2.1 and consider the sesquilinear form defined by
[TABLE]
Then is densely defined, closed, and bounded from below i.e. for some one has u\in\operatorname{dom}(\mathfrak{h})$$). It is uniquely associated with the operator , that is,
[TABLE]
for all and . Furthermore, there exist positive constants such that
[TABLE]
where is a lower bound of . In addition, the space of compactly supported functions contained in is a core of the form .
Proof.
Throughout this proof we will abbreviate and for an admissible fixed triple . First, we show that is bounded from below. If , the form is non-negative. Suppose that . By a standard Sobolev-type inequality (cf., e.g. [21, Corollary 4.2.10], [46, IV.1.2]) one has
[TABLE]
for all and , where . Then
[TABLE]
where we chose so that and set .
Next, we prove that is closed, i.e., that is closed with respect to the topology induced by the inner product . First, using (2.30)–(2.32) one infers
[TABLE]
Suppose that is a Cauchy sequence with respect to the inner product . In that case, it is Cauchy in and hence has a limit :
[TABLE]
In order to show that is closed, it is enough to prove that satisfies the vertex conditions at every vertex . To that end, we notice that for all , we have . Then, by (2.29) and (2.34) we may pass to the limit as and obtain for all . Similarly, we get .
The first inequality in (2.28) is already proved; see (2.33). The second one follows from the Cauchy–Schwarz inequality and the Sobolev-type estimate (2.29).
Next, we prove (2.27). Notice that the subspace
[TABLE]
is a core of . Hence it is sufficient to check (2.27) for arbitrary , with supp for some . One has
[TABLE]
∎
The following Weyl-type criterion holds.
Proposition 2.3**.**
Assume Hypothesis 2.1, and denote and as in Lemma 2.2. Let be a dense subset with respect to the norm (or, equivalently, with respect to the norm ). Then if and only if there exist and such that
[TABLE]
Proof.
Since the norm is equivalent to the form domain norm , (2.36), (2.38), together with the standard Weyl’s criterion cf., e.g, [60, Proposition 1.4.4], yield proving the “if” part.
To prove the “only if ” part we combine Weyl’s criterion and the last part of Lemma 2.2 to obtain a sequence satisfying (2.36), (2.38). Without loss of generality we may assume that . In that case, one has
[TABLE]
Thus (2.37) holds as asserted. ∎
In the sequel we will refer to the Dirichlet–Neumann truncation of the half-line operator defined as follows
[TABLE]
Proposition 2.4**.**
Let us fix , , and suppose that satisfy (1.3) for all , , , and . Then the Green function of the operator is given by
[TABLE]
where denotes the Wronskian of linearly independent solutions . That is, is an integral operator with the kernel .
Proof.
For a fixed the unique nonzero function satisfying all vertex conditions and solving the non-homogeneous differential equation is given by
[TABLE]
Evidently, the operator is bounded and
[TABLE]
as asserted. Finally, evaluating the Wronskian at and , we get
[TABLE]
(see also [44, Lemma D.12]). ∎
3. Proof of Localization for Half-Line Random Operators
The main goal of this section is to prove dynamical and spectral localization for the random half-line operators arising in the orthogonal decomposition of . Theorem 3.5 ensures positivity of the Lyapunov exponent outside of a discrete set . In Theorem 3.13 we prove spectral localization and SULE for . Finally, we conclude with the proof of Theorem 1.1, which addresses dynamical localization.
3.1. Description of Random Models
The random branching model (abbreviated RBM) is described by a family of Laplace operators subject to Neumann–Kirchhoff vertex conditions on radial metric trees with random branching numbers. In other words, we assume Hypothesis 2.1 with the following parameters
[TABLE]
where is a sequence of independent and identically distributed random variables whose common distribution contains at least two points in its support.
The random lengths model (RLM) is given by a family of the Neumann–Kirchhoff Laplace operators on radial metric trees with random edge lengths. That is, we assume Hypothesis 2.1 with
[TABLE]
where is a sequence of independent and identically distributed random variables whose common distribution contains at least two points in its support.
The random Kirchhoff model (RKM) is given by the Laplace operators subject to random -type vertex conditions. That is, we assume Hypothesis 2.1 with
[TABLE]
where is a sequence of independent and identically distributed random variables whose common distribution contains at least two points in its support.
In order to unify these models we consider three-dimensional random variables with common distribution .
Hypothesis 3.1**.**
Let be a probability measure with
[TABLE]
Suppose that contains at least two distinct points, and let .
Remark 3.2*.*
We notice that
- •
RBM arises when ,
- •
RLM arises when ,
- •
RKM arises when .
For we denote the components of as , since we will use them to define the branching, edge lengths, and Kirchhof potential of an operator. In particular, the vertices in are denoted . Given , define the operators acting in as in (LABEL:det1). Similarly, for , define
[TABLE]
as in (2.11), (2.12) and let denote the corresponding quadratic forms.
3.2. Positivity of Lyapunov Exponents via Fürstenberg’s Theorem
Inspired by (2.20) and (2.21), we introduce an -cocycle over (the left shift ) as follows. First, let , , , and be as in Hypothesis 3.1. For each , (2.20)–(2.21) lead us to define by
[TABLE]
This induces a map via , and then a skew product
[TABLE]
Then denoting the -step transfer matrix by
[TABLE]
we note that the iterates over the skew product are given by . The Lyapunov exponent is defined by
[TABLE]
By Kingman’s Subadditive Ergodic Theorem we have
[TABLE]
for -almost every .
Remark 3.3*.*
Let us note that there are two natural cocycles that one can work with here. In addition to the discrete cocycle just described, there is also the continuum cocycle defined by
[TABLE]
whenever and satisfies the vertex conditions defining . Evidently,
[TABLE]
This leads to a simple relationship between the Lyapunov exponents of and . By Birkhoff’s Ergodic Theorem,
[TABLE]
the average length. Then, one has
[TABLE]
Our next goal is to show that Lyapunov exponents are positive away from a discrete set of energies. To that end, we first recall Fürstenberg’s Theorem and some related facts. In order to state Fürstenberg’s Theorem, let us recall that a few definitions from the general theory. A group is called strongly irreducible if there does not exist a finite set such that for all ; is called contracting if there exist , such that converges to a rank-one operator as . Given Borel probability measures supported in , , we say weakly and boundedly if
[TABLE]
as , uniformly in and
[TABLE]
for all the space of continuous complex-valued functions having compact support.
Theorem 3.4**.**
Let be a probability measure on satisfying
[TABLE]
Let be the smallest closed subgroup of that contains .
- (i)
[36, Theorem 8.6]** Assume that is not compact and that it is strongly irreducible. Then the Lyapunov exponent associated with is positive. 2. (ii)
[37, Theorem B]** Assume that the set
[TABLE]
contains at most one element. If weakly and boundedly, then as .
In the present setting, we have a one-parameter family of measures induced on , namely, we consider , the pushforward of under the map in (3.5).
Theorem 3.5**.**
Assume Hypothesis 3.1. Then there is a discrete set such that enjoys the following properties for .
- (i)
* is noncompact* 2. (ii)
* is strongly irreducible* 3. (iii)
* is contracting* 4. (iv)
**
In particular, is continuous and positive on .
Proof.
In view of Theorem 3.4, positivity follows from (i) and (ii), while continuity on follows from (iv). Moreover, (ii)(iv), so we only need to prove (i)–(iii). Write
[TABLE]
Now, let be distinct elements of , abbreviate
[TABLE]
and define the commutator
[TABLE]
To conclude the proof, it suffices to show that does not vanish identically. Concretely, it is easy to see that the matrices are analytic functions of with non-constant trace and that the entries of are real whenever . Thus, the matrices satisfy the first three hypotheses of [20, Theorem 2.1], so, if does not vanish identically, we can conclude that there is a discrete set such that (i)–(iii) hold for by [20, Theorem 2.1].
To that end, suppose for the purpose of establishing a contradiction that vanishes identically. In particular, the upper left matrix element vanishes identically. One may calculate directly:
[TABLE]
For ease of notation, write , , and . Expanding the trigonometric functions, we get
[TABLE]
Thus,
[TABLE]
Since vanishes identically and , this forces
[TABLE]
It is easy to see that this yields (hence ) and . Since , we must have . Going back to (3.15), this implies
[TABLE]
and hence . Writing , and substituting , we may directly calculate :
[TABLE]
which clearly only vanishes on the discrete set
[TABLE]
a contradiction.
∎
The proof above implicitly uses the following statement.
Lemma 3.6**.**
Suppose is a set of distinct complex numbers and are polynomials in . Then, the function
[TABLE]
vanishes identically if and only if for each .
Proof.
Write and . Suppose on the contrary that
[TABLE]
with . Notice that annihilates the right hand side. However, if , one readily verifies that
[TABLE]
where has the same degree as . Consequently, a straightforward induction implies that
[TABLE]
does not vanish identically, a contradiction. ∎
Remark 3.7*.*
Let us make a few comments about the proof of Theorem 3.5.
- (1)
Since the argument above is soft, we do not get any information about , except that is discrete. However, in concrete situations in which one has more information, one can say more. For example, the from (3.18) corresponds to the RLM; we can explicitly see that . For another example, in the RBM, one has , so one can choose . After some calculations, one obtains
[TABLE]
so Fürstenberg’s Theorem holds away from . In this setting there exists a finite set of invariant directions at these special energies. That said, we note that the Lyapunov exponent is still positive by direct calculation. 2. (2)
Let us also remark that the transfer matrices may be bounded at a discrete set of energies (compare [25]). For example, take parameters and . Then, at energies with , and are commuting and elliptic.111I.e., . In particular, the transfer matrices at these energies are uniformly bounded, so [24, Corollaries 2.1 and 2.2] suggest that dynamical localization as formulated in Theorem 1.2.(ii) cannot hold without excluding these energies.
Remark 3.8*.*
As far as spectral localization is concerned, it suffices to ensure that for every compact interval , almost surely all generalized eigenvalues exhibit Lyapunov behavior. We will construct a full measure set such that one has
[TABLE]
for every generalized eigenvalue of ( is defined in (3.6)). As discussed in [19], the work of Gorodetski and Kleptsyn [40] shows that dropping the assumption that is a generalized eigenvalue invalidates the above assertion.
3.3. Dynamical Localization for Half-Line Operators
Our approach relies on the Large Deviation Theorem (LDT) [19, Theorem 3.1]. Although this is not stated explicitly in [19], the LDT and its corollaries [19, Theorem 4.1, Corollary 5.3, (5.13)] are applicable whenever the conditions of the Fürstenberg Theorem are met, the corresponding subgroup is contracting and the transfer matrices satisfy Lipschitz estimates which are supplied by the following lemma.
Lemma 3.9**.**
Fix a compact interval . There are constants , such that
[TABLE]
for all , , and . The constants depend only on and . Consequently,
[TABLE]
where is defined as in (3.8).
Proof.
Let , , , , and be given. One immediately has
[TABLE]
and
[TABLE]
since . Writing , and , we get
[TABLE]
Using the triangle inequality to change a single one-step transfer matrix at a time, one has
[TABLE]
where is the left shift operator. Writing
[TABLE]
we can estimate the first and third factors by and respectively. On other other hand, (3.23), (3.24), and (3.25) yield
[TABLE]
so, putting everything together, we have
[TABLE]
proving the first inequality. The second follows from this and the statement for . ∎
Having established Theorem 3.5 and Lemma 3.9, we may utilize the LDT in our setting. In particular, we have the following:
Theorem 3.10**.**
Assume Hypothesis 3.1 holds true.
- (i)
[19, Theorem 3.1]** For any , there exist such that
[TABLE]
for all and all . 2. (ii)
[19, Theorem 4.1]** There exist constants , such that
[TABLE] 3. (iii)
[19, Corollary 5.3]** For every there exists a full measure set with such that for every there exists such that
[TABLE]
for any and . 4. (iv)
For every there exists , with the following property: For every , there exists such that
[TABLE]
for all , , and .
Part (iii) yields
[TABLE]
This fact may also be derived from the Craig–Simon approach [23] (see also [45]). Our main focus is on showing
[TABLE]
The next key step is an analog of the elimination of double resonances. Let us note that we do not use the typical formulation of double resonances (cf., e.g., [47, (9.21)]), since our ultimate goal is to work with transfer matrices in order to apply the Avalanche Principle. The resonances we wish to exclude are those for which there are large disjoint intervals so that some energy is very close to an eigenvalue of restricted to , and the norm of the transfer matrix across at energy deviates substantially from . In particular, we would like to show that this event occurs with very small probability, see [12]. We shall make this precise and quantitative in Theorem 3.11.
By convention, we write whenever . Let us recall from (3.8), and abbreviate .
Theorem 3.11**.**
Given , , let
[TABLE]
Then there exist , such that
[TABLE]
In particular, one has
[TABLE]
Proof.
Let us fix
[TABLE]
and denote
[TABLE]
In order to estimate , we pick , consider the corresponding , and notice that (due to the resolvent bound) is close to an eigenvalue of the Dirichlet–Neumann truncation, that is,
[TABLE]
Combining (3.22), (3.28), (3.36), and choosing (hence ) sufficiently large we obtain
[TABLE]
whenever and is as in (3.36). In other words
[TABLE]
where
[TABLE]
where . We note that and the standard Dirichlet Laplacian on are self-adjoint extensions of a symmetric (minimal) operator with deficiency indices , cf. [10, Section 2.1]. Then the spectral shift for these two operators is at most , see [8, Lemma 9.3.2 p.214, Theorem 9.3.3, p. 215]. Combining this with an explicit computation of eigenvalues of we get
[TABLE]
where is a universal constant (we recall from (2.2) that ). Then using (3.27) and , we estimate
[TABLE]
for some . Clearly, one has
[TABLE]
Then for a fixed , the summation with respect to introduces a subexponential number of terms bounded by , and summation with respect to introduces no more than terms bounded by (the precise calculation is carried out in the proof of [19, Proposition 6.1]). Thus (3.33) holds as asserted, which together with the Borel–Cantelli lemma yields (3.34). ∎
Let us recall the Avalanche Principle employed in the proof of Theorem 3.13.
Lemma 3.12** (Avalanche Principle).**
Let be a finite sequence in satisfying the following conditions:
[TABLE]
Then for some absolute constant one has
[TABLE]
See [39, Proposition 2.2] for a proof of Lemma 3.12.
In order to streamline notation, we use the shorthand for the point .
Theorem 3.13**.**
There exist a discrete set and a set with such that for every compact interval and every the following assertions hold:
- (i)
For every generalized eigenvalue of the operator , one has
[TABLE] 2. (ii)
The spectral subspace admits a basis of exponentially decaying eigenfunctions. 3. (iii)
Given and a normalized eigenfunction
[TABLE]
there exist , , such that222Recall that and are related via (3.9).**
[TABLE]
for an absolute constant .
Proof.
We will show that the statement of the theorem holds with as in Theorem 3.5 and
[TABLE]
where are defined in Theorem 3.10 (iii), (iv) and in Theorem 3.11 respectively. Note that by Theorem 3.5.
Proof of Part (i). Due to (3.31), it is enough to prove that for a given and for a generalized eigenvalue (which are henceforth fixed) one has
[TABLE]
Let be the generalized eigenfunction of corresponding to , that is,
[TABLE]
Our goal is to show that for a given and for all sufficiently large one has
[TABLE]
Since these intervals cover a half-line, (3.51) yields (3.49).
For a given333in the sequel will be determined by the center of localization let
[TABLE]
where is to be determined444 will depend on through . In particular, if all generalized eigenfunctions are uniformly bounded, is -independent., are as in Theorem 3.10 (iii), (iv) correspondingly, and is the smallest integer for which
[TABLE]
Step 1**.**
There exists such that for all there exists an integer such that
[TABLE]
Proof.
First we note that (3.30) with yields
[TABLE]
or, equivalently,
[TABLE]
for some . Focusing on the th block we introduce the following notation
[TABLE]
Our argument is based on a representation of in terms of its boundary values , and special solutions satisfying certain boundary conditions. The choice of the boundary conditions, hence the representation of , depends on the entry of the matrix
[TABLE]
that dominates its norm. Specifically, letting denote the th entry of (3.58) and assuming that satisfy , the interior vertex conditions in the interval , and the boundary conditions indicated below, we consider the following four cases.
Case 1. If then we let
[TABLE]
and observe that
[TABLE]
In particular, (3.60) shows that and are linearly independent, which shows that we may represent
[TABLE]
Case 2. If then
[TABLE]
Case 3. If then
[TABLE]
Case 4. If then
[TABLE]
We proceed with Case 1; the other three cases can be handled similarly. Let us estimate each term in the right-hand side of (3.61). Combining (3.56) and (3.60), we get
[TABLE]
for some . By (3.50) we get
[TABLE]
Employing (3.29) with , , and choosing so that we obtain
[TABLE]
for some . Similarly for so large that we obtain
[TABLE]
Combining (3.61), (3.71)–(3.74) one obtains
[TABLE]
where the last inequality holds whenever is large enough and . Replacing by , by in (3.61), and by in (3.73), (3.74) we obtain
[TABLE]
∎
Step 2**.**
Suppose that for some , let be the largest integer such that , and recall from Step 1 for such . Then
[TABLE]
Proof.
It suffices to show that
[TABLE]
for some independent interval , independent , and . Indeed, denoting the characteristic functions of by respectively, we get
[TABLE]
for in (3.52) sufficiently large (depending only on ). To prove (3.78) we notice that
[TABLE]
(this is similar to Case 4 in Step 1 above). By right-continuity of and we have
[TABLE]
for some independent interval . Employing (3.54) one infers
[TABLE]
for all . That is,
[TABLE]
Furthermore, noticing that
[TABLE]
for some independent sufficiently small constant , and using Proposition 2.4 we arrive at
[TABLE]
for all . Thus (3.78) holds as required. ∎
Step 3**.**
Let be as in Step 2. Then there exists such that for all and all one has
[TABLE]
Proof.
Combining (3.53), (3.77) and Theorem 3.11 one infers
[TABLE]
We will use (3.86) to apply the Avalanche principle, see Lemma 3.12. Concretely, choose with , define
[TABLE]
With , (3.86) gives
[TABLE]
for all , where the second inequality holds as long as , cf. (3.52), is sufficiently large. Since and (enlarge if necessary), we may use (3.29) to obtain
[TABLE]
Thus, implies
[TABLE]
where the final inequality needs to be sufficiently small; we note that this smallness condition depends only on . Thus, taking and , we have and the Avalanche Principle (Lemma 3.12) yields
[TABLE]
again, by choosing large.
Putting this together, we can control for general by interpolation. In particular, writing with and , we have
[TABLE]
as long as is sufficiently large (recall from (3.26)). ∎
Picking such that , replacing by , and using (3.85) one infers (3.51) which in turn yields (3.49) and (3.45).
Proof of Part (ii). By Part (i) and Ruelle’s deterministic version of Oseledec’ Theorem [56, 54], every generalized eigenvalue is, in fact, an eigenvalue corresponding to an exponentially decaying eigenfunction. Furthermore, since the spectral measure of is supported by the generalized eigenvalues belonging to , cf. [44, Theorem C.17], one infers that admits a basis of exponential decaying eigenfunctions.
Proof of Part (iii). First, we notice that
[TABLE]
and
[TABLE]
for some , and all cf., e.g, [21, Corollary 4.2.10], [46, IV.1.2]. In addition we remark that attains its maximum since
[TABLE]
Therefore, we may repeat the arguments of the proof of Part (i) with
[TABLE]
where we pick any value of argmax if there is more than one extremum. Then for a given there exists (which does not depend on ) such that for all and all one has
[TABLE]
Utilizing this with sufficiently small (depending on only) and letting
[TABLE]
see (LABEL:464n), (LABEL:377new), we will show that
[TABLE]
for all , . As in Step 1 our subsequent argument relies on a representation of considered on the interval in terms of its boundary values. Our choice of the representation, as before, depends on the entry of
[TABLE]
that dominates its norm. We will provide the argument assuming that the maximizing entry is and note that the other three cases can be treated almost identically.
One has
[TABLE]
where , , satisfies the interior vertex conditions in the interval , and
[TABLE]
and
[TABLE]
for some . In order to estimate , we rewrite it in terms of the transfer matrices and use (3.29) as follows
[TABLE]
Similarly one can estimate . Combining this and (LABEL:464n), (LABEL:377new), (3.96), (3.98) we get
[TABLE]
to facilitate the last inequality we pick sufficiently small (depending only on ). Thus
[TABLE]
for all and . Since these intervals cover the half-line for sufficiently large , the inequality in (3.101) holds for all
[TABLE]
Furthermore, estimating for
[TABLE]
trivially and changing variables , we get
[TABLE]
A similar estimate can be obtained for : In this case, the Lyapunov behavior (3.101) is observed only for sufficiently large , in which case (3.101) holds for (for small , use the trivial bound).
In order to show a version of (3.104) with replaced by , we employ
[TABLE]
and repeat (3.98)–(3.104). Finally, keeping in mind Remark 3.3 and interpolating between the discrete vertices, we infer (3.47). ∎
Having established existence of a basis of semi-uniformly localized eigenfunctions (SULE) we turn to dynamical localization. Our argument stems from the proof of [38, Theorem 2.1].
Proof of Theorem 1.1.
Our first goal is to derive an upper bound for the number of centers of localization555 from (3.47) is called the center of localization of located in a large interval . Let be an orthonormal basis of exponentially decaying eigenfunctions of the spectral subspace ; the corresponding eigenvalues are denoted by , . Then by (3.47) with
[TABLE]
we have
[TABLE]
We claim that
[TABLE]
for sufficiently large . For let denote the operator of multiplication by the characteristic function of , let denote the resolvent of at and note that . Next we show
[TABLE]
for sufficiently large and some . To that end, notice that
[TABLE]
Assuming that , , and and using (3.107) we obtain
[TABLE]
and
[TABLE]
Similar estimates hold for (3.113) and (3.114). Therefore we have
[TABLE]
for some .
Next we estimate the right-hand side of (3.109). Let us recall that (the space of Hilbert–Schmidt operators on ) and
[TABLE]
whenever , . A discussion of this fact together with related references can be found, for instance, in [60, Section 4.1.11] and [61, pp. 418–419]. This result is applicable in our case due to [44, Lemma C.12] which asserts that maps (boundedly) into . Combining these facts we infer
[TABLE]
for some . Then (3.109) and (LABEL:486) yield (3.108).
Next, we turn to (1.4). For brevity, denote and let be such that
[TABLE]
Then we have
[TABLE]
where we used (3.108) in the last inequality. ∎
4. Random Metric Trees
4.1. The Almost-Sure Spectrum for Continuum Models
Our first objective is to show that almost surely the spectrum of is given by a deterministic set .
Theorem 4.1**.**
There exists a full -measure set such that
[TABLE]
Proof.
Since
[TABLE]
one has
[TABLE]
First, we will first show that
[TABLE]
and therefore . Let us fix . Seeking a contradiction, we pick . Then there exist
[TABLE]
such that
[TABLE]
where , cf. (2.24)–(2.26) (we recall that norm is equivalent to the form norm, see (2.28)). Let denote the periodic sequence whose first elements are given by . Then since one has
[TABLE]
where the first inequality follows from the fact that and Sobolev inequalities. Suitable truncations of belong to . Indeed, for , let be such that , , , and
[TABLE]
Then for all one has
[TABLE]
where we used , see [41, Theorem 4.14]. Moreover, one has
[TABLE]
Combining (4.7), (4.10) and (4.11) we obtain a contradiction.
Next we show that exists a full -measure set such that
[TABLE]
First of all, we note that whenever there exist two sequences of natural numbers
[TABLE]
and a sequence of functions such that satisfying
[TABLE]
and
[TABLE]
where the supremum is taken over the set
[TABLE]
This is due to orthogonal decomposition (2.16) and the standard Weyl criterion for . Secondly, there exists , such that for arbitrary
[TABLE]
there exists a sequence such that for all one has
[TABLE]
see, for example, [47, Proposition 3.8]. We claim that (4.12) holds with this choice of . Indeed, pick any periodic sequence and . Then by Proposition 2.3 there exist
[TABLE]
such that
[TABLE]
In order to produce a singular sequence for we will rescale from to . That is, for every we let
[TABLE]
where
[TABLE]
for . Then changing variables one obtains
[TABLE]
where . Let us denote
[TABLE]
Then using (4.26), (4.27) with replaced by we note that there exists a constant which does not depend on such that
[TABLE]
We claim that is a singular sequence satisfying (4.13)–(4.15). First, we know that holds since the vertex conditions displayed in (2.25) are scale-invariant. Next, the conditions in (4.14) hold due to (4.22) and (4.27) (with ). In order to check (4.15), let us fix and with . Then one has
[TABLE]
In the first inequality we employed (4.26) and (4.27); in the second one we used the Cauchy–Schwarz inequality, the fact that , (4.19), and (4.20); and finally in the last inequality we used (4.22) and (4.29). Hence, (4.15) holds and as asserted. ∎
Remark 4.2*.*
It is natural to conjecture that the spectrum for the half-line operator is a deterministic set given by the union of periodic spectra of . The latter, under some spectral monotonicity assumption, in turn equals the union of constant spectra, which in certain scenarios can be computed explicitly. However, neither standard ergodicity arguments (e.g., proof of Pastur’s Theorem) nor spectral theoretical arguments (cf. [60, proof Lemma 1.4.2] and [48]) seem to be applicable to the half-line models in question. We note that the half-line models present both probabilistic and spectral-theoretical complications which are not typical for operators on .
4.2. Proof of Dynamical and Exponential Localization for Metric Trees
We say that a function is tree-exponentially decaying if there exist and such that
[TABLE]
where denotes the number of vertices in the same generation as ; cf. (2.1).
Proof of Theorem 1.2.
(i) By Theorem 4.1 and part (ii) of Theorem 3.13, there exist full measure sets such that
[TABLE]
and the operator enjoys a basis of exponentially decaying eigenfunctions. Then letting
[TABLE]
we notice that and that
[TABLE]
where we used the orthogonal decomposition (2.17). Next we show that admits a basis of tree-exponentially decaying eigenfunctions almost surely. To that end, let us fix , , , and . Then it suffices to construct a basis of tree-exponentially decaying eigenfunctions in , cf. (2.6), (2.7). For a basis element of , we define the corresponding basis element of ,
[TABLE]
Then (2.14) yields
[TABLE]
A basis of tree-exponentially decaying eigenfunctions of can be constructed similarly.
(ii) Let and , then by Part (iii) of Theorem 3.13, the subspace is spanned by semi-uniformly localized eigenfunctions
[TABLE]
For , we introduce
[TABLE]
and notice that
[TABLE]
the forward subtree rooted at . Then for one has (abbreviating ):
[TABLE]
where . Proceeding as in (3.124)–(3.133) with replaced by the characteristic function of the interval , we deduce that (4.46) converges as asserted. ∎
Remark 4.3*.*
We notice that all eigenfunctions (including those corresponding to energies ) satisfy
[TABLE]
for some and , where denotes the number of vertices in the same generation as ; cf. (2.1). Moreover, one has whenever , in particular, (4.47) yields in this case. Furthermore, if and then still decays exponentially, for all . However, this inequality alone is insufficient to deduce integrability. The analogous issue does not arise in the setting of metric graphs for which the volume of the ball centered at the root with radius grows polynomially as , e.g., as in the metric graph spanned by .
Part II Anderson Localization for Discrete Radial Trees
5. Random Discrete Trees
This part of the paper concerns Anderson localization for discrete radial trees.
Hypothesis 5.1**.**
Let be a rooted, radial discrete tree. Assume that the branching numbers , , and the potential are radial. Let
[TABLE]
be radial, symmetric, and bounded, that is,
[TABLE]
and , .
Assuming this hypothesis, we introduce a bounded operator as follows
[TABLE]
In this part, we adopt the notation of the previous sections with the convention that all edges have length one. Thus, for vertices , is the combinatorial distance between them, and, in particular for all .
5.1. The Almost-Sure Spectrum for Discrete Models
The following hypothesis is assumed throughout this section.
Hypothesis 5.2**.**
Let be a probability measure with , , and either
[TABLE]
or
[TABLE]
Let us remark that the secondary hypothesis in (5.5) is essential, for, if is concentrated on a set for which and , then the Jacobi matrices arising in the orthogonal decomposition of will all have constant entries.
We introduce . For , define the operators and Jacobi matrices , where
[TABLE]
is a sequence of i.i.d. random vectors with common distribution . Let us notice that
[TABLE]
In particular,
- •
Random Branching Model (RBM) arises when
[TABLE]
,
- •
Random Weight Model (RWM) arises when ,
- •
Random Schrödinger Operator (RSO) arises when .
Remark 5.3*.*
We point out that RBM and RSO concern random realizations of the discrete Laplace operator, while RWM is focused on the adjacency matrices, i.e. . Typically (e.g., for models) the distinction between the discrete Laplace operator and the adjacency matrix of the graph is irrelevant as the two operators differ by a scalar multiple of the identity operator. In the setting of non-constant trees, however, the distinction is more subtle since it depends on the branching numbers. What is more, the consecutive transfer matrices for RWM are correlated unless .
Abusing notation somewhat, we will identify a scalar with a constant sequence consisting of that scalar, for example writing to mean the adjacency operator for which all branching numbers are two and all ’s are one.
Theorem 5.4**.**
There exists a full -measure set such that
[TABLE]
Proof.
First, we show that
[TABLE]
Seeking contradiction, we assume that for some . Then there exist
[TABLE]
such that
[TABLE]
where denotes the ball centered at with radius . The -periodic sequence with the first elements given by is denoted by . Then since one has
[TABLE]
and thus for all we get
[TABLE]
which contradicts (5.12).
Next, we show
[TABLE]
for almost all . To that end, we first notice that there exists , such that for arbitrary
[TABLE]
there exists a sequence such that for all one has
[TABLE]
see, for example, [47, Proposition 3.8]. Pick an arbitrary periodic sequence and an arbitrary . Then there exist and such that
[TABLE]
Given (5.16)–(5.20) we are ready to produce a Weyl sequence for .
For a fixed , pick two distinct vertices , in generation with common backward neighbor (in generation ), see Figure 2. Then by (5.17) there exists a pair of graph isomorphisms
[TABLE]
We notice that
[TABLE]
For brevity, we denote
[TABLE]
Let us define
[TABLE]
for which is supported on . We claim that is a Weyl sequence for , . To that end, let us first notice
[TABLE]
where we used which follows from the definition of . Next, recalling (5.22) and the fact that is the common backward neighbor of , we get
[TABLE]
since . Further, one has
[TABLE]
where the first equality follows from (5.24). Next, let us fix , and use the shorthand . For let , see Figure 2, then one has
[TABLE]
Let us point out that is not defined if . However, one does have and therefore the equality in (5.35) holds with
[TABLE]
Moreover, combining this and (5.17) we obtain
[TABLE]
Given (5.36) and (LABEL:ur523) we are ready to continue (5.32)–(5.35). Changing variables via , we get
[TABLE]
where we made a change of variable . Furthermore we note that (5.38) holds for trivially, i.e., both sides are equal to zero. Recalling from (5.23) and using (5.18) yield
[TABLE]
Then combining (5.31), (5.38), and (5.39), we obtain
[TABLE]
where is some fixed constant. Therefore, we get
[TABLE]
Thus is a Weyl sequence for and as asserted.
∎
Remark 5.5*.*
- (1)
We emphasize that the equality in (LABEL:ur523) requires special attention if , since in this case the inclusion
[TABLE]
could be strict. However, by (5.36) the equality (LABEL:ur523) holds as asserted even in this special case. Due to this nuance the current proof is not applicable to . (Informally, if in (5.3) then we “see” extra bits around which are not observed near ). 2. (2)
The almost-sure spectrum for can be computed explicitly if , , i.e. the random branching model for the adjacency matrix. Indeed, in this case, the quadratic form of the is given by
[TABLE]
therefore
[TABLE]
where and is the first coordinate function. Combining this and (5.8) we get
[TABLE]
As before, we note that this proof is not applicable to the case or const. 3. (3)
Remark 5.3, the proof of Theorem 5.4, the previous remark, and the question of computing the almost–sure spectrum itself illustrate a subtle distinction between adjacency matrices and Schrödinger operators. This issue arises even in the most simple case , , and random , since (in view of (1.9))
[TABLE]
To be more specific, if one considers
[TABLE]
where is a sequence of i.i.d. random variables, then it is well-known that the spectrum of is almost surely given by . Since is a rank-one perturbation of , their essential spectra coincide. However, depending on the support of , it can happen that may have discrete eigenvalues outside of , and these eigenvalues may not be constant almost-surely. Thus, one should not expect the analogue of Theorem 5.4 to hold for random Schrödinger operators on graphs (as opposed to adjacency matrices).
5.2. Breuer-Type Decomposition
Our next objective is to revise the Breuer decomposition [13, Theorem 2.4] which may be viewed as a discrete version of the orthogonal decomposition of metric trees. To point out a difference between the two, we note: The invariant subspaces in (2.15) are parametrized by single vertices, while those in Breuer’s decomposition are parametrized by entire generations of vertices.
Theorem 5.6**.**
Assume Hypothesis 5.1. Then there exists a unitary operator
[TABLE]
such that
[TABLE]
where , , and denotes the Jacobi matrix acting in and given by
[TABLE]
Proof.
Breuer’s inductive procedure [13, Theorem 2.4] yields an orthonormal basis
[TABLE]
For all admissible triples , the basis elements satisfy
[TABLE]
and
[TABLE]
The latter shows that the operator leaves the subspaces
[TABLE]
invariant. Thus we have
[TABLE]
where denotes an orthogonal projection onto in . Let us define unitary operators
[TABLE]
and
[TABLE]
Then (5.55) together with (5.57) yield (5.51) and (5.52) as asserted. ∎
5.3. Dynamical and Exponential Localization for Discrete Random Trees
In this section we discuss spectral and dynamical localization for three discrete models: the random branching model (RBM), the random weights (RWM) model, and random Schrödinger operators (RSO).
Let us denote the nonzero entries of by
[TABLE]
Then a sequence satisfies , , that is,
[TABLE]
if and only if
[TABLE]
where
[TABLE]
The transfer matrix (5.64) gives rise to an SL-cocycle
[TABLE]
where and
[TABLE]
The -step transfer matrix and the Lyapunov exponent are defined as in (3.6) and (3.7) respectively.
Theorem 5.7**.**
Assume Hypothesis 5.2. Then there is a set of cardinality at most one such that enjoys the following properties for .
- (i)
* is noncompact* 2. (ii)
* is strongly irreducible* 3. (iii)
* is contracting (cf. **[19, Definition 2.8]*)** 4. (iv)
**
In particular, is continuous and positive on .
Proof.
Following the proof of Theorem 3.5, we choose
[TABLE]
let denote the transfer matrix corresponding to , and form the matrices and . Let us comment briefly on the method of proof. We can immediately apply [20] to deduce that there is an unspecified discrete set of energies away from which (i)–(iv) hold. In fact, the argument of [20] applies away from energies at which or , which allows us to refine this to a discrete set with no more than 3 elements. However, we can do better still: Conditions (i)–(iv) hold for any for which the following criterion is met:
[TABLE]
In particular, (5.67) implies (iii) which in turn implies (i) by standard arguments about . Once (i) holds, then (5.67) immediately yields (iv) and also implies (ii) (cf. [11]).
Case 1: (5.4) holds. We have , so
[TABLE]
We calculate
[TABLE]
Case 1a: . It follows that and hence . One can confirm that for all , so that and have no eigenvectors in common. Thus, there is no of cardinality one with for . Now, suppose that an invariant of cardinality two exists. We must then have have and , for some ; without loss, assume . This forces . However, since , we must have , so forces for , that is to say, each is an eigendirection of . Identifying with the Riemann sphere in the usual way, write for the image of under the identification . Since , we have
[TABLE]
From this, we deduce . On the other hand, since , we observe
[TABLE]
a contradiction. Thus, when , (5.67) holds and we have (i)–(iv) for every .
Case 1b: . There are two further subcases to consider.
Case 1bi: . Then, for every . Thus, again and never share an eigenvector. At energy , both and preserve . Since is the only energy at which vanishes for either , we have (i)–(iv) for .
Case 1bii: . One can check that vanishes for exactly one value of . Using the same argument as in Case 1a, we see that there is no invariant of cardinality one or two away from . Thus, (i)–(iv) hold away from .
Case 2: (5.5) holds. Then,
[TABLE]
Notice that
[TABLE]
Since , is hyperbolic666I.e., . and any finite set of directions left invariant by , , and must be a subset of . It is easy to see that this cannot happen for , so we may take in this case. ∎
Remark 5.8*.*
Let us note that the need to remove a single point is sharp. For example, in Case 1bi above, one can verify that . To see this, write and , and observe that
[TABLE]
Thus, by passing to blocks of length two and using the strong law of large numbers, we deduce .
Proof of Theorem 1.4.
Now that we know that is positive and obeys a uniform LDT away from , spectral and dynamical localization for follows as in Theorem 3.13, see also [27] where spectral localization was proved for the discrete RBM. Let be defined as in (4.37) (where is as in Theorem 5.4, and is a full measure set realizing localization for ) and fix .
For all , the spectral subspace enjoys an orthonormal basis of eigenfunctions of corresponding to energies . If we define , then
[TABLE]
is an orthonormal basis of .
Proof of (1.10). For an arbitrary admissible triple we will prove (1.10) with . First, we note that by spectral localization for one has
[TABLE]
for some . Then for we get
[TABLE]
which implies (1.10).
Proof of (1.11). Due to dynamical localization for one has
[TABLE]
for all , , and a constant (cf., e.g., [19, Proof of Theorem 6.4] where this step is discussed for the standard Anderson Hamiltonian). Next, we have
[TABLE]
Finally, (1.12) follows from (1.11) by summation in . ∎
Acknowledgments
We thank G. Berkolaiko, M. Lukic, and G. Stolz for helpful discussions, and P. Hislop for bringing our attention to this subject and for motivating discussions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Aizenman, R. Sims, S. Warzel, Absolutely continuous spectra of quantum tree graphs with weak disorder , Commun. Math. Phys. 264 (2006), 371–389.
- 2[2] M. Aizenman, R. Sims, S. Warzel, Stability of the absolutely continuous spectrum of random Schrödinger operators on tree graphs , Probab. Theory Related Fields 136 (2006), 363–394.
- 3[3] M. Aizenman, R. Sims, S. Warzel, Fluctuation based proof of the stability of ac spectra of random operators on tree graphs , Recent advances in differential equations and mathematical physics, 1–14, Contemp. Math., 412, Amer. Math. Soc., Providence, RI, 2006.
- 4[4] M. Aizenman, S. Warzel, Absence of mobility edge for the Anderson random potential on tree graphs at weak disorder, EPL (Europhysics Letters), 96 (2011) 37004.
- 5[5] M. Aizenman, S. Warzel, Resonant delocalization for random Schrödinger operators on tree graphs , J. Eur. Math. Soc. 15 (2013),1167–1222.
- 6[6] M. Aizenman, S. Warzel, Random Operators: Disorder Effects on Quantum Spectra and Dynamics, Graduate Studies in Mathematics Vol. 168, American Mathematical Society, 2015
- 7[7] S. Albeverio, F. Gesztesy, R. Hoegh-Krohn, H. Holden, with app. by P. Exner, Solvable Models in Quantum Mechanics , 2nd edition, AMS-Chelsea Series, Amer. Math. Soc., Providence, RI, 2005.
- 8[8] B. Sh. Birman, M. Z. Solomyak, Spectral Theory of Self-Adjoint Operators in Hilbert Space , D. Reidel Publishing Co., Dordrecht, 1987
