Absolutely continuous spectrum for random Schrödinger operators on tree-strips of finite cone type.

Similar documents
Absolutely Continuous Spectrum for the Anderson Model on Trees

Absolutely Continuous Spectrum for the Anderson Model on Some Tree-like Graphs

On the inverse matrix of the Laplacian and all ones matrix

arxiv: v1 [math.sp] 18 Mar 2014

Jeffrey Schenker and Rajinder Mavi

Mathematical foundations - linear algebra

1 Tridiagonal matrices

Local Kesten McKay law for random regular graphs

Modern Discrete Probability Branching processes

Second Order Elliptic PDE

PERIODIC SOLUTIONS OF DISCRETE GENERALIZED SCHRÖDINGER EQUATIONS ON CAYLEY TREES

Anderson Localization on the Sierpinski Gasket

1 Adjacency matrix and eigenvalues

Inner Product Spaces An inner product on a complex linear space X is a function x y from X X C such that. (1) (2) (3) x x > 0 for x 0.

Wigner s semicircle law

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk

Brown University Analysis Seminar

Bootstrap Percolation on Periodic Trees

Two Classical models of Quantum Dynamics

Spectrally arbitrary star sign patterns

arxiv: v1 [cond-mat.stat-mech] 5 Oct 2015

An Algorithmist s Toolkit September 10, Lecture 1

Locating the eigenvalues for graphs of small clique-width

PHY305: Notes on Entanglement and the Density Matrix

A Geometric Approach to Graph Isomorphism

Markov Decision Processes

Di usion hypothesis and the Green-Kubo-Streda formula

The following definition is fundamental.

Peter J. Dukes. 22 August, 2012

Exponential algorithmic speedup by quantum walk

The Minesweeper game: Percolation and Complexity

Lectures on Random Schrödinger Operators

Physical Metaphors for Graphs

Quantum Diffusion and Delocalization for Random Band Matrices

Chapter 1 - Preference and choice

5 Quiver Representations

N-WEAKLY SUPERCYCLIC MATRICES

Fiedler s Theorems on Nodal Domains

Periodicity & State Transfer Some Results Some Questions. Periodic Graphs. Chris Godsil. St John s, June 7, Chris Godsil Periodic Graphs

Some analysis problems 1. x x 2 +yn2, y > 0. g(y) := lim

Statistical Machine Learning

Ma/CS 6b Class 12: Graphs and Matrices

The Minimal Rank Problem for Finite Fields. Wayne Barrett (BYU) Hein van der Holst (Eindhoven) Raphael Loewy (Technion) Don March (BYU)

arxiv:quant-ph/ v1 22 Aug 2005

Lectures 6 7 : Marchenko-Pastur Law

NATIONAL BOARD FOR HIGHER MATHEMATICS. Research Scholarships Screening Test. Saturday, February 2, Time Allowed: Two Hours Maximum Marks: 40

Preliminaries and Complexity Theory

Definition A finite Markov chain is a memoryless homogeneous discrete stochastic process with a finite number of states.

Quantum walk algorithms

Lecture 13: Spectral Graph Theory

Kruskal s Theorem Rebecca Robinson May 29, 2007

AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS

21-301, Spring 2019 Homework 4 Solutions

An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace

Entanglement Dynamics for the Quantum Disordered XY Chain

Discrete quantum random walks

Summary of free theory: one particle state: vacuum state is annihilated by all a s: then, one particle state has normalization:

SPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS

The Totally Asymmetric Simple Exclusion Process (TASEP) and related models: theory and simulation results

Math.3336: Discrete Mathematics. Chapter 9 Relations

U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018

Spectral decimation & its applications to spectral analysis on infinite fractal lattices

4 Group representations

More on NP and Reductions

Matrix Airy functions for compact Lie groups

Singular Value Decomposition (SVD) and Polar Form

Real symmetric matrices/1. 1 Eigenvalues and eigenvectors

Transfer matrices, hyperbolic geometry and absolutely continuous spectrum. Richard Froese, David Hasler and Wolfgang Spitzer

Newton s Method and Localization

Ma/CS 6b Class 23: Eigenvalues in Regular Graphs

Kernel Method: Data Analysis with Positive Definite Kernels

Notes for Functional Analysis

Algebraic Methods in Combinatorics

Spectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics

Lecture 8 Nature of ensemble: Role of symmetry, interactions and other system conditions: Part II

Very few Moore Graphs

SPA07 University of Illinois at Urbana-Champaign August 6 10, 2007

Ma/CS 6a Class 28: Latin Squares

Linear algebra and applications to graphs Part 1

Perfect Zero-Divisor Graphs of Z_n

Matrix Factorization Reading: Lay 2.5

Renormalization: An Attack on Critical Exponents

7 The structure of graphs excluding a topological minor

Lax Solution Part 4. October 27, 2016

Di-eigenals. Jennifer Galovich St. John s University/College of St. Benedict JMM 11 January, 2018

Consequences of the Completeness Property

Notes on the Matrix-Tree theorem and Cayley s tree enumerator

On the Eigenvalues of Simplicial Rook Graphs

Fiedler s Theorems on Nodal Domains

Maps which preserve equality of distance. Must they be linear?

CSC Linear Programming and Combinatorial Optimization Lecture 10: Semidefinite Programming

H ψ = E ψ. Introduction to Exact Diagonalization. Andreas Läuchli, New states of quantum matter MPI für Physik komplexer Systeme - Dresden

LECTURE 10: THE ATIYAH-GUILLEMIN-STERNBERG CONVEXITY THEOREM

WOMP 2001: LINEAR ALGEBRA. 1. Vector spaces

MA5206 Homework 4. Group 4. April 26, ϕ 1 = 1, ϕ n (x) = 1 n 2 ϕ 1(n 2 x). = 1 and h n C 0. For any ξ ( 1 n, 2 n 2 ), n 3, h n (t) ξ t dt

Spectral Properties of the Hata Tree

Math 354 Transition graphs and subshifts November 26, 2014

WORKSHOP ON DYNAMICAL METHODS IN SPECTRAL THEORY OF QUASICRYSTALS

ALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley

Complex Networks CSYS/MATH 303, Spring, Prof. Peter Dodds

Transcription:

Absolutely continuous spectrum for random Schrödinger operators on tree-strips of finite cone type. Christian Sadel University of California, Irvine Tucson, March 13th, 2012 C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 1 / 11

A tree-strip of finite cone type of width m is the product graph of a finite graph G with m vertices and a rooted tree of finite cone type. The product graph of two graphs G 1 and G 2 is defined as follows: (x 1, y 1 ) and (x 2, y 2 ) are connected by an edge, iff either x 1 = x 2 and y 1 and y 2 are connected by an edge, or y 1 = y 2 and x 1 and x 2 are connected by an edge. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 2 / 11

A tree-strip of finite cone type of width m is the product graph of a finite graph G with m vertices and a rooted tree of finite cone type. The product graph of two graphs G 1 and G 2 is defined as follows: (x 1, y 1 ) and (x 2, y 2 ) are connected by an edge, iff either x 1 = x 2 and y 1 and y 2 are connected by an edge, or y 1 = y 2 and x 1 and x 2 are connected by an edge. A tree of finite cone type can be constructed from an s s substitution matrix S with non-negative integer entries, as follows: Each vertex has a label p {1,..., s}. A vertex of label p has S p,q children of label q. Except for the root, a vertex of label p has q S p,q + 1 neighbors. The tree is determined by the label of the root, if the label is p we call the tree T (p). The cone of descendents of a vertex with label p is equal to T (p). Hence, there are only finitely many different types of cones of descendants and therefore the tree is called of finite cone type. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 2 / 11

We consider the Hilbert space l 2 (T (p) G) = l 2 (T (p) ) C m = l 2 (T (p), C m ). An element u l 2 (T (p), C m ) is considered as a function u : T (p) C m with u(x) 2 <. x T (p) On l 2 (T (p), C m ) we consider the random Schrödinger operators (H λ u)(x) = u(y) + Au(x) + λ V (x) u(x). y:d(x,y)=1 C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 3 / 11

We consider the Hilbert space l 2 (T (p) G) = l 2 (T (p) ) C m = l 2 (T (p), C m ). An element u l 2 (T (p), C m ) is considered as a function u : T (p) C m with u(x) 2 <. x T (p) On l 2 (T (p), C m ) we consider the random Schrödinger operators (H λ u)(x) = u(y) + Au(x) + λ V (x) u(x). y:d(x,y)=1 A Sym(m) is the adjacency matrix of the finite graph G. A is a real, symmetric m m matrix, A = A t. It is also called the free vertical operator C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 3 / 11

We consider the Hilbert space l 2 (T (p) G) = l 2 (T (p) ) C m = l 2 (T (p), C m ). An element u l 2 (T (p), C m ) is considered as a function u : T (p) C m with u(x) 2 <. x T (p) On l 2 (T (p), C m ) we consider the random Schrödinger operators (H λ u)(x) = u(y) + Au(x) + λ V (x) u(x). y:d(x,y)=1 A Sym(m) is the adjacency matrix of the finite graph G. A is a real, symmetric m m matrix, A = A t. It is also called the free vertical operator V (x) Sym(m) for x B are i.i.d. random, real symmetric matrices with common distribution µ. We assume that all mixed moments of µ exist. We may think of V (x) as random matrix-valued potential. λ R is the disorder and supposed to be small. One may write H λ = 1 + 1 A + λ x T (p) V (x). C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 3 / 11

Assumptions We need the following assumptions on the substitution matrix: C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 4 / 11

Assumptions We need the following assumptions on the substitution matrix: For each p, q there is a natural number n such that (S n ) p,q is not zero. This means, that each tree T (p) has vertices of each label q {1,..., s}. S < [min{s p,p }] 2 C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 4 / 11

Assumptions We need the following assumptions on the substitution matrix: For each p, q there is a natural number n such that (S n ) p,q is not zero. This means, that each tree T (p) has vertices of each label q {1,..., s}. S < [min{s p,p }] 2 With some weaker assumptions, Keller, Lenz and Warzel showed that the spectrum of the adjacency operator on T (p) is purely a.c., independant on p and consists of finitely many intervals. Let us call this set Σ. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 4 / 11

We denote the eigenvalues of the free vertical operator A by a 1 a 2... a m. There is an orthogonal matrix O O(m) such that O t AO = diag(a 1,..., a m ) = A d. Let Uu(x) = Ou(x) then U is unitary and U H λ U = 1 + 1 A d + λ x B O t V (x)o. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 5 / 11

We denote the eigenvalues of the free vertical operator A by a 1 a 2... a m. There is an orthogonal matrix O O(m) such that O t AO = diag(a 1,..., a m ) = A d. Let Uu(x) = Ou(x) then U is unitary and U H λ U = 1 + 1 A d + λ x B O t V (x)o. Hence by changing the distribution µ to O t µo we may assume w.l.o.g. that A = A d is diagonal. The free operator can be written as direct sum H 0 = 1 + 1 A d = m + a k k=1 and has a.c. band spectrum k (Σ + a k). C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 5 / 11

Main Theorems Assume S and A are such that I A,S = k (Σ + a k) has non-empty interior. (For fixed A and S there exists a b 0 such that for b > b 0 the set I A,bS has non-empty interior). Theorem (S. 2012) Under the assumptins above, there exists a dense open subset I I A,S and an open neighborhood U of {0} R in R 2 such that one obtains the following: The spectrum of H λ in U λ = {E : (λ, E) U} is purely absolutely continuous with probability one. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 6 / 11

Some previous results: Klein (1994, 1996) a.c. spectrum and ballistic wave spreading for Anderson model on Bethe lattice (regular tree) Aizenman, Sims, Warzel (2006), different proof for ac spectrum Froese, Hasler, Spitzer (2007), different proof for ac spectrum Keller, Lenz, Warzel (2010), ac spectrum for Anderson model on trees of finite cone type Froese, Halasan, Hasler (2010), ac spectrum for Bethe strip of width 2 Klein, S. (2011) a.c. spectrum and ballistic behavior for Bethe strip of arbitrary finite width Aizenman, Warzel (2011), a.c. spectrum for Anderson model on Bethe lattice for small disorder in bigger region; absence of mobility edge for small disorder; ballistic behavior in this regime C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 7 / 11

The m m Green s matrix function of H λ is given by [G λ (x, y; z)] k,l = x, k (H λ z) 1 y, l for x, y T (p), k, l G and z = E + iη with E R, η > 0. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 8 / 11

The m m Green s matrix function of H λ is given by [G λ (x, y; z)] k,l = x, k (H λ z) 1 y, l for x, y T (p), k, l G and z = E + iη with E R, η > 0. We define the integrated, averaged density of states by ( m N λ (E) = 1 m E 0, k χ(,e] (H λ ) 0, k ) for the root 0 T (p) k=1 C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 8 / 11

The m m Green s matrix function of H λ is given by [G λ (x, y; z)] k,l = x, k (H λ z) 1 y, l for x, y T (p), k, l G and z = E + iη with E R, η > 0. We define the integrated, averaged density of states by ( m N λ (E) = 1 m E 0, k χ(,e] (H λ ) 0, k ) for the root 0 T (p) k=1 Theorem There is an open neihborhood U of {0} I as above, such that the following hold: The integrated, averaged density of states is absolutely continuous in U λ, its density is strictly positive in U λ and it depends continuously on (λ, E) U. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 8 / 11

The Theorems above follow from the following: Theorem There is a dense open subset I I A,S and an open neighborhood U of {0} I in R 2, such that for all x T (p) the continuous functions and (λ, E, η) U (0, ) E( G λ (x, x; E + iη) 2 ) (1) (λ, E, η) U (0, ) E(G λ (x, x; E + iη)) (2) have continuous extensions to U [0, ). C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 9 / 11

Idea of Proof Let G be a symmetric m m matrix with positive imaginary part. On the set of pairs of positive semi-definite matrices M we define the exponential decaying functions f G (M +, M ) = exp(itr(gm + G M )). Let G (p) λ (z) denote the matrix Green s function at the root of T(p) for the random operator H λ and define ) ξ (p) λ,e,η (f = E (p) G λ (E+iη) There is a certain Banach space K, such that [ ] ξ (p) λ,e,η is in this p Banach space for Im (z) > 0 and it converges in K for λ = 0, E I A,S and η 0. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 10 / 11

Moreover, there is a continuous function F : R 2 (0, ) K K, Frechet differentiable with respect to the element in K, such that ( ) F λ, z, [ξ (p) λ,z ] p = 0. Use the implicit function Theorem at λ = 0, E I I A,S to show that [ξ (p) λ,e+iη ] p extends continuously to (λ, E, η) U [0, ) where U is an open neighborhood of I which in turn is a dense open subset of the interior of I A,S. Everything follows from these continuous extensions. C. Sadel (UCI) AC Spectrum on tree-strips Tucson, March 13th, 2012 11 / 11