Open access peer-reviewed chapter

Spectra and Quantum Transport on Graphs

By Victor Chulaevsky

Submitted: October 18th 2016Reviewed: March 13th 2017Published: December 20th 2017

DOI: 10.5772/intechopen.68480

Downloaded: 1159


This chapter is devoted to various interactions between the graph theory and mathematical physics of disordered media, studying spectral properties of random quantum Hamiltonians. We show how the notions, methods, and constructions of graph theory can help one to solve difficult problems, and also highlight recent developments in spectral theory of multiparticle random Hamiltonians which both benefit from graph‐theoretical methods and suggest original structures where new insights are required from various areas of mathematical physics in a broad sense.


  • isoperimetric estimates
  • Cheeger bound
  • Lifshitz tails
  • Anderson localization
  • multiparticle localization
  • quantum graphs

1. Introduction

The proposed chapter focuses on the methods and applications of the graph theory in the area of quantum transport on combinatorial and metric (often referenced to as “quantum”) graphs. It is well known that perfectly periodic potentials in Euclidean spaces or on periodic lattices create favorable conditions for nonlocalized solutions of Schrödinger and/or wave equations. In quantum physics, this results in transport of quantum particles, for example, electrons or phonons. However, after the seminal, Nobel prize winning work [1] published by Philip W. Anderson in 1958, it has been realized by physicists that the propagation of quantum particles in an imperfect environment, modeled by a random or almost periodic electrostatic or magnetic potential, can be significantly inhibited, to the point where mobile quantum particles, e.g., electrons, are localized: their wave functions decay exponentially away from some loci— their respective localization centers. In many applications, the media where quantum particles propagate are not periodic crystals, but have instead a structure of more or less complex graphs formed by atoms, and therefore are treated as disordered media. The structural disorder can be complemented by a parametric one, e.g., in the context of weighted graphs where the canonical graph Laplacian ΔΓon Γis modulated by variable weights assigned to the edges. In general terms of the spectral theory of unordered structures, this is an instance of the “off‐diagonal” disorder. Furthermore, it is important to analyze the spectral properties of the discrete analogs of the Schrödinger operators ΔΓ+Von a graph Γ, where Vis a fixed or random real‐valued function on Γ.

The recent wake of interest to the nanosystems and molecular devices attracted many researchers to such models, and numerous intriguing problems in this area still remain challenging and wide open. It has been understood that the classical aspects of the graph theory, such as isoperimetric estimates (particularly, the Cheeger bounds) and deep results of the spectral theory of graphs, are of great importance to the localization/delocalization processes on graphs other than periodic lattices embedded in a Euclidean space.

Furthermore, the most recent developments in the spectral theory of disordered quantum systems, initiated independently and simultaneously by physicists (cf., e.g., [2]) and mathematicians (cf. [3, 4, 5, 6], emphasized the role of interparticle interaction which had been consciously and explicitly neglected in the pioneering works due to the complexity of the analysis involved, although P. W. Anderson himself was concerned about possible effects of interaction on the fundamental properties of the quantum transport. Following the first mathematical works in this direction, the notion of a multiparticle quantum graph has been recently introduced by Sabri [7].

Summarizing, the proposed chapter provides to the reader an overview of synthetic techniques and results where the traditional problem of the combinatorial and spectral graph theory is intertwined with complementary structures, ideas, and methods of functional analysis and quantum mechanics, in response to the new challenges in modern technology.


2. Isoperimetric bounds, spectral gaps, and quantum localization

The integer lattices Zd, d1, endowed with the usual graph structure constitute a very particular class of connected graphs. The spectra and (generalized) eigenfunctions of their canonical graph Laplacians are easy to find, due to the commutative group structure of these lattices. The lattice Laplacian ΔZdis the canonical Laplacian on Zdendowed with the graph structure where the edges are formed by the pairs (x,y)with Euclidean distance |xy|2=1. It follows from the Fourier analysis on the additive group Zdthat the spectral measure of ΔZdis absolutely continuous (with respect to the Lebesgue measure). The graph Laplacians ΔΓare defined as nonpositive operators, but in mathematical physics one considers ΔΓinstead. The spectrum of ΔZdis easily computed, knowing that its Fourier image is the operator of multiplication by the function


The generalized eigenfunctions are given by the respective Fourier harmonics (plane waves) xexp(i(p,x)), where (p,x)=p1x1++pdxd. In physics, one often works with finite cubes, where the eigenfunctions of the respective Laplacian are combinations of plane waves. Particular questions concerning the Laplacians relative to such finite graphs depend upon specific intended applications. A number of situations give rise to the quantitative analysis of a few of the lowest eigenvalues of (ΔΓ), numbered in increasing order. In particular, the spectral gap and the analytic form of the eigenfunctions with eigenvalues λ0and λ1, known explicitly for the rectangles, are more difficult to analyze for general graphs. One possible question is about the size of the gap λ1λ0: it features a power‐law decay as the size Lof the cube [1,L]dgrows, but what can one say about the spectral gap for less regular graphs? Furthermore, it is readily seen that the eigenvalue λ1is degenerate on the cube, and has multiplicity equal to the dimension d: the respective eigenfunctions are the lowest‐frequency harmonics, related to the global geometry of the cube, but the situation for general graphs is more complex.

Before going to the answers, provided by the graph theory for a large class of nonperiodic graphs, we give some motivations coming from the spectral theory of random operators.

One remarkable phenomenon relative to disordered media was discovered in the 1960s by physicist I.M. Lifshitz [8] and colorfully called in the physics and mathematics communities “Lifshitz tails”: the eigenvalue distribution of the random operators HV=Δ+V(ω)decays extremely as the energy Eapproaches the lower edge of spectrum.

In this chapter, we always assume the random potential to take i.i.d. (independent and identically distributed) values. In addition, we assume the common probability distribution of these random values to admit a bounded probability density.

We shall use the following notions and notations. Given a potential V:ZdR, we consider the discrete Schrödinger operator HV=Δ+V, where Δis the graph Laplacian on the integer lattice Zd. Further, for each integer L1and a lattice point xdenoted by B(L,x)the cube centered at xof side length 2L, and let HLbe the Schrödinger operator ΔB(L,0)+Vin the cube B(L,0); here, ΔB(L,0)is the canonical graph Laplacian in B(L,0)with the graph structure inherited from the integer lattice, where the edges are given by the pairs of nearest neighbours in the Euclidean distance. Next, denote by λkthe eigenvalues of HLnumbered in increasing order, and introduce the finite‐volume eigenvalue counting function


Definition 1.The limiting eigenvalue distribution functionN(E)of the operatorHVis the limit


whenever it exists. Otherwise, we say that the limiting distribution function does not exist.

In the case where a fixed potential V:ZdRis replaced by a sample V(ω)of a random field on the lattice, the operator HV=HV(ω)also becomes random.

In physical terminology, widely used also in mathematical physics of disordered media, N(E)is usually called the integrated density of states (IDS). The existence of the above limit is not obvious and, generally speaking, the limit may not exist. However, the existence of N(E)for any energy can be established by the methods of ergodic theory in a particular, but very rich and useful for physical applications class of ergodic operators (including all i.i.d. potentials), as well as for the periodic and almost‐periodic potentials. In fact, the latter classes can be incorporated into the general scheme of ergodic operators; cf., e.g., the monographs [9, 10]. Moreover, the IDS for ergodic potentials is nonrandom; in physical terminology, IDS is a “self‐averaging” quantity. Simply put, spatial average coincides with the ensemble average for ergodic operators.

Whenever the potential Vof the Schrödinger operator HV=Δ+Vis lower bounded, e.g., nonnegative, HV,and its spectrum Spec(HV)have the same property, sinceΔis nonnegative. Therefore, E0:=infSpec(HV)>. In physics, E0is called the ground state energy. A number of important quantities and phenomena are related to the ground state energy and also to the behavior of the IDS as the energy Eapproaches E0. Lifshitz [8] discovered that for a large class of Hamiltonians with random potential energy, including random Schrödinger operators HV=Δ+V(ω)on a lattice, the IDS decays very fast as EE0: for some C1,C>0


Lifshitz tails have numerous important ramifications in theoretical and experimental physics. They also result in a nonperturbative onset of the Anderson localization on lattices for any, arbitrarily small amplitude of the random potential V(ω). Away from the spectral edge, the proofs of localization require a sufficiently large amplitude of V(ω); moreover, it is widely believed that in dimension d3, in the models where the random potential gV(ω)has a sufficiently small amplitude |g|, there are intervals Iof energy where the corresponding generalized eigenfunctions (“extended quantum states”) are not square‐summable, and the spectral measure has in Ia nontrivial absolutely continuous component. In simpler terms, there is a nontrivial quantum transport in some energy zones.

A substantial progress has been achieved in the direction of proofs of localization near the spectral edge (or edges). For a long time, most of the efforts have been made in the analysis of lattice Hamiltonians HV=Δ+V(ω). Recently, it has been shown in Ref. [11] that a number of results obtained on the integer lattices can be extended to much more general graphs of polynomial (or, more generally, subexponential) growth. The key point is the availability of lower bounds on the spectral gap in terms of the Cheeger’s constant of the graph.

Consider a lattice cube B=B(L,0)with the graph structure inherited from the lattice, and the random lattice Schrödinger operator HB,V(ω)=ΔB+V(ω)on it. The starting point of the localization analysis of this finite‐volume Hamiltonian is the estimate of the probability to have some eigenvalues of HB,V(ω)in a small interval Iϵ=[E0,E0+ϵ]near the spectral edge E0. This is closely related to the Lifshitz tails. One needs a finite‐volume analog of the limiting Lifshitz asymptotics, but for the localization analysis, one can settle for a sufficiently strong, albeit not necessarily sharp, upper bound on the probability


Now recall Temple’s inequality [12].

Proposition 1.LetAbe a self‐adjoint operator in a finite‐dimensional Hilbert spaceH, andE0=inf Spec(A)be a simple eigenvalue. If a vectorψwith unit norm satisfiesψ,Aψ<E1:=infSpec(A)\{E0},then


Now one can see the importance of the size of the lowest spectral gap, η=E1E0. As was mentioned above, ηis easily calculated explicitly for the Laplacians in lattice rectangles, but of course there is no universal formula for general finite graphs. The following result was obtained in Ref. [11].

Proposition 2.Let be given a finite connected subgraphGof a locally finite countable connected graphΓsatisfying the following condition: there exists some real constantsd1andC>0such that any ballB(L,x)Γof radiusL1has cardinality




Apart from the canonical negative Laplacian (ΔG), it is often more convenient to work with its modified variant LGdefined by


where (nG(x)and (nG(y)are the coordination numbers of the vertices xand y, respectively: nG(x)=card(B(1,x)\{x}). The coordination numbers are nonzero, whenever the graph is connected and has more than one vertex. Below we quote the bounds obtained for the modified Laplacian, but, up to some constants, they remain valid for the original Laplacian.

Definition 2.The Cheeger’s constant of a finite connected graphGis the following quantity:


where the minimum is taken over all nontrivial partitionsG=WWcof the graphGinto disjoint subgraphsWand its complementWc.

Denote by μk(G), k0, the eigenvalues of LGnumbered, as their counterparts λk(G), in increasing order. Then one has the following results (cf. [13]).

Proposition 3.Let be given a finite connected graph Gof diameter DG:=diamG. Let μ1(G)be the first nonz ero eigenvalue of the modified graph Laplacian LG, and h(G)the Cheeger’s constant of G. Then


For a finite connected subgraph GΓsatisfying the growth condition in Eq. (7), one has DG|G|1and vol(G)Cd|G|. Combined with the inequalities in Eqs. (7) and (9), this results in the following lower bound for E1(G):


The upper bound by 2h(G)is not quite explicit in general (this depends of course on the specific problems at hand), but for finite connected subgraphs GΓone can prove that lim|G|+μ1(G)=0(cf. [14]). Now we are ready to prove the following result.

Lemma 1.Let Gbe a finite connected subgraph of a graph Γsatisfying the growth condition in Eq. (6), and 0<η16λ1(ΔG). Let Vbe a nonnegative real function on G, and set Vη(x):=min[V(x),2η],HG=ΔG+V.Then E0(HG)12|G|1xGVη(x).

Proof. Consider the normalized eigenfunctions of ΔGwith the eigenvalue E0, viz. ψ0=|G|1/21G. Next, introduce an auxiliary operator K=ΔG+Vη. By nonnegativity of the functions VηV, we have the inequalities (in the sense of the associated quadratic forms)


so that by the min‐max principle, we have E0(HG)E0(K)and E1(HG)E1(K)E1(ΔG). Since E0=0, it follows that ΔGψ0=0, and therefore,


Thus, we have Temple’s inequality to ψ0,Kand E1(K). Note first that by ΔGψ0=0, one has


Now apply Temple’s inequality, taking account of the above identity:

E0(HG)E0(K)ψ0,Kψ0ψ0,(Vη)2ψ0E1(K)ψ0,Kψ0|G|1xGVη(x)1(113)E1(K)|G|1xG(Vη(x))2|G|1xGVη(x)|G|1xGVη(x)13E1(K)23E1(K)12|G|1xGVη(x).                       □

Lemma 2. Consider a nonnegative i.i.d. random field V(x,ω)on a locally finite graph Γsatisfying the growth condition in Eq. (7), with the common marginal probability distribution function F(t):=P{V(x,ω)t}, and assume the following:

  1. There exist arbitrarily large LNsuch that any ball B(L,x)Γcan be partitioned into connected graphs Giwith Lδ12|Gi|L1/12, for some δ(0,1).

  2. F(t+s)F(t)Csβfor some β, C>0and all tR,s>0;

  3. inf{tR:F(t)>0}=0

Then for any positive integer n, there exists a finite connected subgraph GΓwith Gnand satisfying the following spectral bound:


Proof.Using the Cheeger bound for the first nonzero eigenvalue, we have


Let ηG=cd6|G|2, then 2ηG13E1(ΔG), hence we can use η=ηGand get


The value ηGcan be made arbitrarily small by taking the cardinality of the graph Glarge enough, and by assumption on continuity of the probability distribution function FV, for ηGsufficiently small we have FV(ηG)1/4. Recall that the values of the random potential V(x,ω)are i.i.d., and so are Vη(x,ω),since they are functions of i.i.d. r.v., so the probability for the sample mean of a large number of i.i.d. random variables to take a value away from the expectation can be assessed with the help of the large deviations theory. Specifically, for any n1and i.i.d. r.v. ξ1,,ξn, for any η>0such that P{ξ12η}1/4, one has


(see the details in Ref. [11]). Furthermore, we have |G|3cd6|G|2for |G|large enough. Now the lower bound in Eq. (13) combined with Eq. (18) proves the claim:

P{E0(HG)|G|3}P{E0(HG)cd6|G|2}=P{E0(HG)ηG}P{1|G|xGmin[V(x,ω),2ηG]ηG}exp(18|G|).        □

Theorem 1. Assume (W). There exist some δ>0and arbitrarily large balls B(L,x)such that


Proof.Fix a vertex xΓ. By assumption (i), there are arbitrarily large Lsuch that the ball B(L,x)can be partitioned into connected graphs Giwith Lδ12|Gi|M(L,x)L1/12. The operator (ΔG)admits the following lower bound in the sense of quadratic forms:


Since Vis a multiplication operator, we also have


Observe that by (i), L1/4|Gi|3Lδ/4. Owing to Lemma 1, we conclude that


provided that Lis sufficiently large.

Now we give an application of the above result, which was the main motivation in Ref. [11], and explain how the bounds for the eigenvalues of the graph Laplacians give rise to the decay of eigenfunctions. Due to the size limitations of the present chapter, we treat the Green’s functions in finite cubes, but the decay of the latter is important in itself, for physical applications, and it is known to imply the decay of eigenfunctions (cf. [10]). The decay of the Green’s functions is established by the so‐called multiscale analysis (MSA), an inductive scaling algorithm which we will sketch now (details can be found in [9, 10]). First, fix some notations and give some definitions. Given a ball B=B(L,u)Γand the operator HB=ΔB+V, we denote by GB(E)its resolvent operator HB, and by GB(x,y,E), x,yB, the matrix elements of the resolvent (usually called Green functions) in the standard orthonormal delta‐basis formed by the single‐site indicator functions 1x. Further, given a ball BΛinside a larger connected subgraph ΛΓ, the Green functions satisfy an inequality, often called Simon‐Lieb inequality (sli), easily following from the second resolvent identity: for any xBand yΛ\B, one has


Since |B(L,u)|CdLd, and the coordination numbers are uniformly bounded by Cd1d=Cd, we have |B|Cd2Ld, so the above GRI implies


Here, xis an arbitrary point of B=B(L,u), but we will be mostly interested in the case where x=u, so the first maximum in the above RHS becomes a characteristic of the ball B.

A simple but important observation is that when q:=Cd2LdmaxvB|GB(u,v,E)|<1, we have for the function f:x|GΛ(x,y,E)|a subharmonic‐type inequality:


As long as all points v'at distance L+1from xare centers of L‐balls with the same “subharmonic” property, the GRI can be iterated. If nsteps of iteration can be performed, and fMfor some M<, then the value f(x)admits a small upper bound by Mqn.

Definition 3. Given real numbers Eand m>0, a ball B=B(L,x)is called (E,m)‐nonsingular ((E,m)‐, NS, in short), if for all yB


with a(m,L):=m(1+L18). Otherwise, it is called (E,m)‐singular ((E,m)‐S).

The main result of Ref. [11] is the following

Theorem 2.There exist δ>0, an interval I=[0,E*]with E*>0, and an integer L*such that for all EIand LL*one has


We shall need a positive number β(0,1); tsuffices to set β=1/2, which will be assumed below, but for clarity, sometimes the parameter βwill be used in its symbolic form.

We denote by Sp(HB,V)the spectrum of the operator HB,V.

Definition 4. Given an operator HB,V=ΔB+Vin a ball B=B(L,x), this ball is called E‐nonresonant (E‐NR, in short), if dist(Sp(HB,V)),EeLβ, and E‐resonant (E‐R), otherwise.

Clearly, if a ball is E‐NR, the resolvent is well‐defined at the energy E, and the modulus of all the respective Green functions are upper bounded by eLβ, since the finite‐dimensional operator HB,Vis self‐adjoint. Probabilistic bounds on dist(Sp(HB,V)),Efor random operators are traditionally called Wegner bounds, due to the original work by Wegner [15] who established the first general bound of that kind.

Lemma 3(Wegner estimate). Assume that the random potential of the operator HB,V(ω)=ΔB+V(ω)is i.i.d. and the common marginal probability distribution of V(x,ω)admits a probability density bounded by some CW<. Then for any s[0,1]


Definition 5. Given an operator HB,V=ΔB+Vin a ball B=B(Lk+1,x), this ball is called (E,m)‐bad if it contains at least two nonoverlapping (E,m)‐S balls of radius Lk, and (E,m)‐good, otherwise.

Lemma 4. If a ball B(Lk+1,x)is E‐NR and (E,m)‐good, then it is (E,m)‐NS.

Sketch of the proof. The claim is easily obtained by iterating the Simon‐Lieb inequality (SLI) and using the hypothesis of (E,m)‐goodness; the latter guarantees that in the course of iterated applications of the GRI, one can stumble on an (E,m)‐S ball of size Lkat most once. There may be no singular ball inside B(Lk+1,x), then the subharmonic‐type inequalities easily provide an exponential decay from the center to the boundary of the ball. Furthermore, if there is one singular Lkball, one can approach it from the center and from the boundary, using the SLI on the first or on the second spatial argument of the Green function. The “wasted” distance is of order or O(Lk), so an elementary calculation provides the desired decay bound of the Green’s functions. Technical details can be found in Ref. [16], but it is worth emphasizing the crucial role of the “nonresonance” hypothesis: as was explained, an iterated use of the subharmonic‐type inequality in Eq. (21) only gives the upper bound f(x)qnf, which is absolutely useless without an explicit control of the sup‐norm of the function f, and in our case, one has the functions f:x|GΛ(x,y,E)|.

Theorem 2 can be derived from the following inductive statement.

Theorem 3. Introduce the following notations: for each k0, let


Assume that P0,Q0eLδwith 0<δ<β=1/2, and


Then for all k0one has PkeLkδ.

Sketch of the proof. We proceed by induction, starting with the hypothesis P0eLkδ. Assume the required bound holds for some k0, then we have to prove it for the balls of size Lk+1. By Lemma 4, if a ball B(Lk+1,x)is (E,m)‐S, then either it is E‐R, or it is not (E,m)‐good, i.e., contains at least two disjoint balls B(Lk,u'), B(Lk,u'')which are (E,m)‐S. The number of possible pairs (u',u'')inside B(Lk+1,x)is bounded by 12Cd2Lk+12, and the probability for each pair B(Lk,u'),B(Lk,u'')to be (E,m)‐S is bounded inductively by PkeLkδ. Thus, the probability of existence of at least one such pair is upper‐bounded by


Further, the probability for the ball B(Lk+1,x)to be E‐R is upper‐bounded with the help of the Wegner estimate from Lemma 111, without induction:

Qk+1CWCd2Lk+1deLk+1β,where β=12>δ.



Now the claim follows by a straightforward, albeit somewhat cumbersome calculation, making use of the assumed geometrical condition in Eq. (29). The details can be found in Ref. [16].

Theorem 3 shows that if on some scale L0the Green functions in the balls of radius L0decay—with a sufficiently high probability—exponentially fast from the center to the boundary of the ball, then the same phenomenon is reproduced, with ever higher probability, on any scale Lk+. Such a decay is akin to that of a wave function of a quantum particle in a classically prohibited space where the energy of the particle is below the potential “barrier,” so there is a powerful mechanism, originally discovered by P. W. Anderson in 1958, which reproduces the local tendency of a quantum particle to localization in the disordered environment on any scale. The main problem concerns the mechanisms creating such a tendency for localization. This is where we turn to the spectral analysis in the balls B(L0,x)and seek estimates for the first nonzero eigenvalue of the graph Laplacian in B(L0,x).

Indeed, if we restrict our analysis to the interval of small positive energies (assuming the potential is nonnegative; otherwise we can make a spectral shift), then it is clear that for all energies Ebelow the spectrum of the operator GB,V(x,y,E)must decay exponentially with respect to the distance |xy|, due to the above‐mentioned “under‐the‐barrier” decay well‐known from the elementary exercises in quantum mechanics. Mathematically, there is actually a more general result, the Combes‐Thomas estimate [17] which applies not only to the values Estrictly belowthe spectrum of HB,V, but all Ein the resolvent set, i.e., simply away from the spectrum. Specifically, fix an operator HB,Vrelative to a ball B(L,u), and let ERsatisfy dist(E,Sp(HB,V)η). There exist universal constants C,C'>0such that for all x,yB(L,u)it holds that


Now all the pieces of the puzzle find their place:

  • Using the isoperimetric spectral estimates combined with the Temple inequality, we can find a sufficiently small energy interval [E,E*+η], with E*,η>0, such that in large balls B(L0,u)a random potential takes a very low average value with a very small probability, so that it is highly unlikely for HB,V(ω)to have its lowest eigenvalue below E*+η.

  • Restrict the energy interval to I*:=[E,E*]; then for all EI*we have dist(E,Sp(HB,V)η), so the Combes‐Thomas estimate in Eq. (31) applies and guarantees a fast decay of the Green functions from the center to the boundary of the ball B(L,). Notice that we can have ηlower bounded by a fractional power of L. Indeed, Eq. (19) allows us to take η=L1/4, and the probability for such a bound to hold is at least 1eδ/12, in notations of Eq. (19).

  • We thus have, in a tiny interval of energies close to the bottom of the spectrum, the starting hypothesis of the scale induction fulfilled. Now the roll the induction and prove exponential decay with high probability at any scale Lk, k0.

Once again, it is to be stressed that it is a graph‐theoretic spectral estimate that makes this story possible, and the presented phenomena take place for a rich class of graphs, much larger than just periodic lattices. This general estimate is a far‐going replacement for the elementary consequences of the Fourier analysis on Zd.

Summarizing, the problem of computing exact asymptotics, or at least sharp upper/lower bounds on the limiting distribution function of the eigenvalues for the operatorsHB,V(ω)on various classes of graphs is of course much more general and important than one particular application to the Anderson localization presented above. This if often a difficult problem, and the wealth of knowledge and intuition accumulated in the spectral graph theory would be very welcome to this area of mathematical physics.


3. Symmetric powers of graphs and spectra of fermionic systems

3.1. Motivation and preliminaries

Now we turn to another problem of spectral analysis of quantum Hamiltonians of disordered systems. The presentation will be less technical, and the main message is that the graph theory provides here both an adequate language and technical tools allowing one to treat efficiently difficult problems arising in the recently developed multiparticle localization theory; some of these problems are still open and challenging.

In quantum mechanics, stationary states of a system of several quantum particles are described by the eigenfunctions of their respective Hamiltonians acting in subspaces of either symmetric or antisymmetric functions Ψ(x), x=(x1,,xN), where N1is the number of particles, and each argument xjruns through the single‐particle configuration space. The particles described by antisymmetric functions are called fermions, and those described by symmetric functions are called bosons. Physically speaking, the particles evolve in the three‐dimensional space, but in the framework of the so‐called tight‐binding approximation, they can be restricted to a periodic lattice or, more generally, a locally finite graph embedded in the Euclidean space. In this section, we assume the latter and work with N‐particle systems on a graph Γ. In fact, even the case where Γ=Zdis of interest for us, since we are going now to show how a typical construction of the graph theory, the symmetric power of a graph, can be instrumental for solving a formal yet thorny technical problem encountered in the multiparticle Anderson localization theory.

The quantum particles are physically indistinguishable, so any accurate mathematical model has to reflect this fact. In some situations including the localization analysis of randomly disordered media, it is more convenient to represent the Hilbert space of symmetric or antisymmetric functions on Γas the space of functions on the set of configurations of Nindistinguishable particles, instead of a subspace of (+/−)‐symmetric functions defined directly on Γ. While the two approaches are mathematically equivalent, the latter one has an important technical advantage that can be explained as follows.

Consider for simplicity of a two‐particle fermionic system in a finite subgraph G[0,L]Zwith the graph structure inherited from Z. The wave functions of the two‐particle systems are thus antisymmetric functions Ψ(x)=Ψ(x1,x2)of two variables x1,x2G. We assume the Hamitlonian of this system to ba a discrete Schrödinger operator of the form

Definition 6.Let be given a random potentialV(ω)on a subgraphGof the latticeZ, and a nonrandom functionrU(2)(r)of an integer argument. A two‐particle discrete Schrödinger operator onG is the operator of the form



  • H0=ΔG(1)ΔG(1)(the kinetic energy operator) is the sum of two replicasΔG(j)of the graph Laplacian onG, acting on a functionΨ(x1,x2)as a function of the variablexj,j=1,2;

  • V(x,ω)is the operator of multiplication by the random function(x1,x2)V(x1,ω)+V(x2,ω); and

  • U(x)is the operator of the interaction energy of the two particles at hand, acting as the operator of multiplication by the nonrandom function(x1,x2)U(2)(|x1x2|).

The factor ϵ>0measures the amplitude of the kinetic energy operators and reflects the mobility of the particles. In this section, it is instructive to think of ϵas a small number, so that the potential energy is in a certain sense dominant. V(x,ω)is the operator of random potential energy induced by the disordered media (modeled here by a finite linear chain) acting as operator of multiplication by the real‐valued function

(x1,x2,ω)j=1NV(xj,ω),  N=2,

and V(x,ω)are i.i.d. random variables on G(local potentials produced, e.g., by heavy ions).

The function U(2)(r)is called the two‐body interaction potential.

For the sake of notational clarity, here and below we use boldface notations for various objects related to multiparticle objects.

The onset of Anderson localization manifests itself by a fast (usually exponential) decay of the eigenstates Ψkof the Hamiltonian H(ω)away from some vertex, depending upon the quantum number $j$ (usually referred to as the localization centerof the respective eigenstate Ψk. The quantum transport, on the other hand, may take place due to the tunneling between distant vertices x,yG×Gwith very close local energies. The latter notion can be ambiguous when the kinetic energy is nonnegligent, but pictorially, under the assumption we made above that ϵis small, the local energy at a vertex xis essentially given by V(x,ω)+U(x), thus depends directly upon x.

Now recall that the modulus of an asymmetric function Ψ(x1,x2)is symmetric, thus |Ψ(x)|necessarily takes identical values at vertices x=(x1,x2)and Sx=(x2,x1)in the space of orderedconfigurations of distinguishableparticles. The symmetric vertices xand Sxcan be located at arbitrarily large distances from each other in the original two‐particle configuration space given by the Cartesian product G×G. As a result, one has, formally, consider the possibility of “tunneling” between xand Sx, although there is no physical particle transfer process between these two configurations: from the consistent quantum mechanical point of view, the latter are simply identical! We come therefore to realize that the mathematical model based on the Cartesian square of the “physical,” single‐particle configuration space Ggenerates some formal problems which actually have no physical raison d'être, yet they have to be addressed explicitly to rule out some unwanted phenomena. In particular, this renders substantially more complicated the rigorous localization analysis.

However, the above‐mentioned difficulty disappears as soon as one replaces the Hilbert space of antisymmetric functions Ψ(x1,x2)on G×Gby an isomorphic Hilbert space of functions Φon the set of configurations of indistinguishable pairs of vertices from the basic graph G. The required construction is well‐known in the graph theory: we need a symmetric power G(2)of the graph G. Due to the mathematical complexity of the rigorous multiparticle Anderson localization theory, we can only sketch its general strategy in this chapter, but the main tool, which proves very valuable here, deserves a more detailed discussion. As was said in the introductory part, the main goal of this section is to attract the readers’ attention to some interesting and useful relations between the mathematical physics of disordered media and the notions, tools, and deep results of the graph theory.

3.2. Construction of a symmetric power of a graph

3.2.1. An example in one dimension

Before we turn to general constructions of symmetric powers of locally finite graphs, it seems instructive to consider first a particular case where the underlying, basic graph Gis linear, i.e., isomorphic to a subgraph of the one‐dimensional lattice Z. The existence of a complete linear order makes possible a particularly simple variant of the symmetric square G(2)(indeed, of any symmetric power G(N), N>1).

Consider the triangular subset of lattice square Q(L):=G×G=0,L×0,L(here G=0,Lstands for the integer interval [0,L]Z):


(here (2) reflects the number of “particles”). An example is presented in Figure 1. Any antisymmetric function Ψon Q(L)vanishes at any point of the form (x,x), and its modulus takes identical values on (x1,x2)G(2)and on the symmetric point (x2,x1). It follows that

Figure 1.

Example of a symmetric square. Here the base graphGis a subgraph ofZ, and it can be implemented as a subgraph of the Cartesian squareZ2, owing to the one‐dimensional topology ofZ.


This provides a natural isomorphism between the Hilbert spaces of complex functions on Q(L)and on G(2).Clearly, the same idea works in the N‐particle case, where we can define


except that in the latter case, the factor of 2=2!in Eq. (23) is to be replaced by N!.

Such a simple, transparent geometrical construction is no longer available for general graphs, but an isomorphism similar to that from Eq. (23) can be established for the symmetric powers of graphs. Below we give a variant with a distinctive flavor of quantum mechanics.

3.2.2. General construction

The vertex set. Let be given a connected, locally finite countable graph with the vertex set Gand an edge set E, and an integer N2. Consider the integer‐valued functions n:xn(x){0,1}on Gsuch that xGn(x)=N. The physical meaning of the value n(x)is the number of particles at the vertex x, so it is usually called the occupation number of the site xG. Due to the indistinguishable nature of the particles, only the numbers of particles at each site are physically observable (measurable in experiments). Furthermore, since we are modeling now fermions, the respective wave functions, by their antisymmetry, must vanish on any configuration of Nparticles among which at least two occupy the same position. This was precisely the reason we excluded the “diagonal” from G(2)above. Now we achieve the same effect by the requirement n(x){0,1}. The bottom line is that a configuration of Nparticles admissible for modeling fermions is completely determined by a function n; for all intents and purposes, each nis a (fermionic) configuration.

Hence, we constructed an appropriate vertex set G(N)of the graph that would generalise G(2)for an general underlying graph G. Specifically, there is a projection

Π(N):x=(x1,,xN)nx, where supp nx={x1,,xN}.E31

The points of the support of a function nxwill be called the particles of the configurationnx. Restricted on the set of N‐tuples of pairwise distinct vertices x1,,xN, the projection Π(N)is exactly N!‐fold: the pre‐image (Π(N))1(n)has cardinality N!.

The edge set. Using again a terminology inspired by physics, we say that two configurations n,nform an (unordered) edge if and only if nis obtained by moving exactly one particle of nto a position unoccupied by other particles from n.

Mathematically, we require that


It is not difficult to see that the two definitions are equivalent. Indeed, each term in the above sum equals 0or 1, since 0n(x),n(x)1, and such a term vanishes when either n(x)=n(x)=0, i.e., xis unoccupied by either configuration, or n(x)=n(x)=1, i.e., both configurations have a particle at x. Removing particles from the support of nto produce new configuration n, we have to place them outside the support. Therefore,

each point xwith n(x)=1and n(x)=0(i.e., occupied by nbut unoccupied by n) contributes by a two unit term to the sum: first, n(x)n(x)=1, and second, for the position yto which we move the particle from xwe have n(x)n(x)=1. If we move more than one particle from n, the sum in Eq. (25) will be at least 4. We conclude that the second definition in Eq. (25) is equivalent to the first one.

This completes the construction of the N‐th symmetric power (G(N),E(N))of the graph (G,E).

3.2.3. Hilbert space isomorphism: antisymmetric functions versus symmetric power

Now the isomorphism between of the Hilbert space of square‐summable complex antisymmetric functions on the Cartesian power GNand the Hilbert space of all square‐summable complex functions on G(N)is defined in a natural fashion. Recall that we introduced the projection Π(N), such that (Π(N))1(nx)consists of all N!permutations of the vertices x1,,xNfrom the support of nx. Any function Φ:G(N)Cgenerates a symmetric function Ψ=ΦΠ(N), and each symmetric function Ψ:GNCcan be obtained in this way, as ΦΠ(N). The modulus of any antisymmetric function Ψon the Cartesian power GNtakes identical values on all elements of (Π(N))1(nx). Thus, with ΨΦ:=ΦΠ(N),


Now the required isomorphism is defined by ΨΦ2=N!Φ2.

It might appear that the described isomorphism is just an interesting formal trick, but there is much more to it than a mere mathematical curiosity. As one illustration, we consider now a problem of spectral analysis for multiparticle random Hamiltonians H(ω)above.

3.2.4. An application: KAM‐type analysis of two‐particle fermionic random Hamiltonians

The goal of this subsection is merely to illustrate the key role of the isomorphism between the subspace of antisymmetric square‐summable functions of N>1variables in a graph Gand the space of all square‐summable functions on the symmetric power G(N). The mathematical problem where it is used is quite complex, so we will only sketch the main setting and focus on the role of the symmetric powers.

It is to be emphasized that the spectral analysis of N‐particle quantum Hamiltonians in presence of a random potential field, generated by a disordered media, accurately taking into account a nontrivial interaction between the particles, is a relatively new direction both in theoretical physics and in rigorous mathematical physics. This is an actively developing and challenging area of research. While physicists have finally obtained convincing theoretical results on the stability of localization under the Coulomb interaction, the progress in rigorous mathematical physics is still relatively modest, compared to theoretical physics. The best insight achieved in the last 10 years concerns the systems of a fixed number Nof particles in a large sample of a disordered media. For the purposes of this chapter, we always restrict the analysis to discrete systems on graphs.

As was said in the introductory section, we can only sketch rather complex mathematical constructions involved and illustrate the main mechanisms of stability of localization under interaction. For simplicity, suppose that we have a system of N=2particles in a large but finite connected graph Gon which an i.i.d. random (potential) field xV(x,ω)is defined. One can consider various marginal probability distributions, i.e., identical probability distributions of the random variables V(x,ω),xG. Two models popular in theoretical physics of disordered media suit perfectly our needs here: a standard Gaussian distribution N(0,1)with zero mean and unit variance, and the uniform distribution on the interval [0,1].

Consider first the simplest (yet mathematically nontrivial) case of zero amplitude of interaction. Then the variables in the Hamiltonian H(ω)can be separated, since in this case one has an algebraic representation H(ω)=H(1)(ω)I+IH(2)(ω)where Iis the identity operator, and therefore, the eigenvectors of the operator H(ω)can be chosen in the tensor product form, Ψi,j(ω)=ψi(ω)ψj(ω), where ψi(ω),ψj(ω)are eigenvectors of the single‐particle Hamiltonians H(1)(ω)and H(2)(ω), respectively. The latter are identical replicas acting on their respective variables x1and x2. The eigenvalues are the sums Ei,j(ω)=Ei(1)(ω)+Ej(2)(ω), with H(1,2)(ω)ψi(ω)=Ei(1,2)(ω)ψi(ω).

The main reason why the electron‐electron interaction was consciously neglected even in theoretical physics, is that it is relatively weak as compared to the potential energy of interaction with the ions surrounding the mobile electrons, so we also assume the amplitude of the interaction potential to be small.

Another important assumption can simplify the spectral analysis, at least in an informal treatment of the problem: small amplitude of the factor ϵin front of the kinetic energy operator H0; in physical terms, this corresponds to a low mobility of the particles at hand which, naturally, should favor “localization” of a given particle. Mathematically, already for N=1(isolated particles), with ϵ=0we get a multiplication operator which has the orthonormal eigenbasis composed of the “discrete delta‐functions” φx=1{x}, xG. Similarly, for N2and ϵ=0we have a perator of multiplication by the total potential energy which also has a complete eigenbasis composed of “localized” eigenfunctions.

If we had constructed an eigenbasis of the multiplication operator in the representation on the Cartesian square G2, then we would have obtained the two‐site supported eigenfunctions:


while the representation on the symmetric square G(2)gives rise to single‐site eigenfunctions 1{x}1{y}, where xy. Naïvely, starting with the “ultralocalized” eigenfunctions 1{x}1{y}, one may attempt to use the first‐order perturbation theory. The well‐known formulae of the rigorous perturbation theory for the eigenvectors reveal two problems:

  • “small denominators,” i.e., pairs of very close or equal eigenvalues; and

  • large dimension of the spectral problem, which may also give rise to degenerate eigenvalues or at least to some pairs of close eigenvalues.

Indeed, the eigenvalue associated to the unperturbed eigenfunctions of the potential energy operator Φx,y=1{x}1{y}is given by


Fix now the random field model with uniform marginal distribution, and let the interaction be uniformly bounded, then the above eigenvalues all belong to some fixed, bounded interval, regardless of the dimension D=G(|G|1)of the Hilbert space, growing with the cardinality of G. The larger is G, the closer the Deigenvalues must get, counted with multiplicity and restricted to a fixed interval of R. In the Gaussian model, a similar phenomenon is encountered, with high probability, since large values of the Gaussian random potential V(x,ω)are taken with small probability.

A conclusion we can draw from this elementary analysis is that one cannot expect the perturbation theory for nondegenerate spectra, or for the finite‐dimensional operators with bounded multiplicity, to work efficiently in the model with a large graph G.

Several approaches have been developed in spectral theory of single‐particle random Hamiltonians in the last three decades. Technically, they are based on different mechanisms, and even a brief presentation of these approaches would require an entire book. Interested readers may familiarize themselves with the basic techniques in the monographs [9, 10]. Recently, there has been a wake of growing interest to the technique going back to the celebrated KAM (Kolmogorov‐Arnold‐Moser) theory originally developed for the analysis of stability of invariant tori in some nonlinear dynamical systems

Recently, Imbrie [18] adapted the KAM techniques to the spectral analysis of random lattice Hamiltonians, in any dimension, and to one‐dimensional random spin chains.

In essence, the “linear” version of the KAM method is an inductive, iterated use of the first‐order perturbation theory with an accurate account of the higher‐order terms represented by an infinite number of diagrams. At each step of the induction, one obtains an orthogonal basis for the considered (random) operator H(ω)that is an approximate eigenbasis for the latter, but with better and better accuracy. The error terms on the k‐th step of induction feature a typical Newtonian decay rate like eqk, where q(1,2), which is not surprising since KAM technique is based on one or another form of Newton’s method. Once a new, more accurate eigenbasis of order kis constructed by perturbing its predecessor of order (k1), the matric elements of H(ω)are computed in this (orthonormal) basis, and the process is repeated. KAM type constructions are usually quite complex and cumbersome. One has first to describe in detail the entire set of properties to be assumed on the step k10and then reproduced on the next induction step k.

A synthetic method, employing some ideas of the KAM method and other, simpler techniques elaborated in the spectral theory of single‐particle random Hamiltonians, have been proposed first to the noninteracting random systems [11], and later on to their N‐particle counterparts. The pivot of this method, like in the KAM approach, is an accurate quantitative control of the “small denominators”—minimal distances between distinct random eigenvalues of random Hamiltonians associated with finite but growing subgraphs of a countable graph. It would be difficult to carry out such a program in the representation of distinguishable particles, i.e., on the Cartesian power GN.

Now return to the semiquantitative analysis of a two‐particle Hamiltonian. Restrict ourselves to a case where the size of the underlying graph G, modeling the “physical” space where the two quantum particles evolve, has a fixed size, and allow us to vary the parameter ϵin ϵH0(the mobility amplitude), and to take it as small as needed for an attempt to make one step of application of the perturbation theory for nondegenerate spectra.

With both ϵand hsmall enough, the main contribution comes from the random potential, so we have the eigenfunctions of the unperturbed operator Φx,yΦx,y=1{x}1{y}with eigenvalues λx,y=V(x,ω)+V(y,ω), and we have to assess the difference between two such eigenvalues, labeled by two pairs of sites (x,y),(x',y')of the graph G:


Since the potential is random, there can be no uniform, deterministic lower bound on the absolute value of the above difference: with positive probability, it can be smaller than any δ>0. The randomness, however, is a double‐edged sword: while small values of the difference are certainly possible, they may, or might, be unlikely, so we have to determine, how unlikely is to have |λx,yλx',y'|<δ.

To begin with, notice that we have to deal with different eigenfunctions, hence with two nonidentical pairs (x,y),(x',y'). Thus, card{x,y}  {x,y}1. Consider two cases.

I.   card{x,y}  {x',y'}=0.

In this case, the random variables λx,y=V(x,ω)+V(y,ω)and λx',y'=V(x',ω)+V(y',ω)have no common terms, and therefore they are independent. Moreover, inside each pair we have independence, so the probability distribution of each sum can be easily obtained by convolution. For simplicity, consider the case of standard Gaussian variables, then each eigenvalue is also Gaussian with zero mean and variance 2. The difference λx,yλx',y'is again a sum of two i.i.d. Gaussian variables λx,yand (λx,y), hence it is Gaussian with zero mean and variance 4. Recalling the explicit form of the Gaussian probability density with variance σ2, which is uniformly bounded by 1/2πσ2, we conclude that


II.   card{x,y}  {x',y'}=1.

Now the unordered pairs x,yand x',y'have exactly one common point; let it be x, so we have a pair of eigenvalues λx,yand λx,y'with yy'and the difference given by


so it is again a sum of two independent random variables. Assuming as before the distribution to be Gaussian with zero mean and unit variance, we see that λx,yλx',y'is centered Gaussian with variance 2, so the analog of Eq. (32) is now


The final conclusion is that for small δ>0, the small differences between any two eigenvalues corresponding to two distinct eigenfunctions on the symmetric square of the underlying graph is small, viz., of order of O(δ). Therefore, for a finite graph of size |G|=n, the probability to have at least one pair of eigenvalues at distance smaller than δis bounded by n(n1)δ4π=O(n2δ)(we used the weakest of the two estimates in Eqs. (32) and (33)).

This simple probabilistic analysis provides the logical basis for the KAM approach, where we can rule out “small denominators” which cannot be tolerated in the analytic application of the first‐order perturbation formulae, at some initial scale. The rest of the procedure requires a number of analytic efforts, but the crucial point, viz., the possibility to avoid degenerate eigenvalues at the initial scale, is the direct consequence of the graph‐theoretical construction of a symmetric power of a graph G. Using a Cartesian power of Gwould at best significantly complicate the entire procedure, and perhaps render it impractical. In any case, no replacement for resorting to symmetric powers has been found so far in multiparticle localization theory of fermionic systems on graphs.


4. Combinatorial and metric (quantum) graph

Our final topic also concerns the constructive relations and interactions between the graph theory, in a broad sense, and the mathematical physics of the quantum world. However, the general direction of these interactions will be reversed, for we are going to discuss a very recently developed class of mathematical objects naturally emerged in the analysis of interacting quantum systems. We would like to attract the attention of experts in graph theory and related fields to the new area, where a number of questions are not even properly formulated, and many interesting phenomena are yet to be discovered.

First, recall the notion of a metric graph; due to a wake of interest to the so‐called nanotubes, one often refers to these mathematical objects as “quantum graphs.”

Metric graphs represent an important link between the discrete spaces and manifolds endowed with a rich local structure of a Euclidean space. By definition, a metric graph Q=QΓover a finite or countable unoriented combinatorial graph (Γ,E),with the vertex set Γand the edge set E, is a singular one‐dimensional manifold constructed as follows. Associate with each edge e=(ι,τ)Ean open interval Ie, considered as a Riemannian manifold with the Riemannian metric inherited from R. In some models, all the intervals have the same lengths, so by a change of parameters one usually can assume they are replicas of (0,1). In other models, on the contrary, one allows variable length of these basic intervals. We will assume the former and work with unit intervals. There is a canonical oriented graph associated with the unoriented graph (Γ,E), with the same vertex set and two opposite edges for each edge in E. In some auxiliary constructions, this morphism from the category of unoriented graphs to that of oriented ones can be used, to avoid some ambiguities, but it will be not crucial to our purposes, since we will work with a second‐order differential operator (essentially the second derivative operator), so the orientation will not be really important.

Each open interval Ie(0,1)is canonically compactified by its natural embedding into [0,1]. Taking an edge (x,y)and fixing its orientation in one of the two possible ways, so that (x,y)(ι,τ), we thus can identify its starting point ιwith 0[0,1]and the terminal point τwith 1[0,1]. Next, we define the differential operator L=d2/dt2in the space of twice differentiable functions on (0,1); boundary conditions are discussed below. In other words, L=Δ, where Δis the Laplacian on the Riemannian manifold (0,1). While d/dtrequires a local coordinate, hence a fixed orientation, Lis not sensible to this choice.

Further, consider the disjoint union QΓ(0)of the basic (open) intervals Ie, finite or countable, with the natural structure of the measure space induced by the Lebesgue measure on each interval with the respective sigma‐algebra of measurable subsets. In turn, this allows us to introduce the Hilbert space of square‐integrable functions on QΓ(0); this is not yet an object we had needed, for there is no connections between the restrictions of a given function fon QΓ(0)to different, pairwise disjoint connected components thereof.

Now it is time to choose boundary conditions, having in mind the canonical embedding of QΓ(0)into the union QΓof the compactified intervals I¯e[0,1]. In application to the “quantum” graphs, traditionally one imposes the Kirchhoff conditions. Now, for formal reasons, fix some orientation on each edge, hence, a local coordinate on each I¯e[0,1]. Then we can define the one‐sided first derivatives on each vertex, in the directions of all attached intervals I¯e. Let Debe such a derivative along the local coordinate on I¯e, and set ce=1for outgoing edges and ce=1for the ingoing ones. The Kirchhoff conditions are as follows: a function fmust be continuous at each vertex and obey a conservation law


Below we call the intervals I¯econtinuousedges.

Now, using the standard methods of functional analysis, one can construct a self‐adjoint extension of the “Laplacian” Lwith Kirchhoff boundary conditions, and for any, say, bounded measurable function V:QΓR(a potential), define the Schrödinger operator HVas unbounded self‐adjoint operator in H=L2(QΓ), with the suitable domain.

One can perturb the above, rather idyllic picture in several ways. First, one can consider a random potential V(ω), taking i.i.d. random values on each edge. Further, on can vary the lengths leof the continuous edges, assuming that le(ω)are i.i.d. random variables with a common probability distribution. From the functional analytic point of view, treating unbounded self‐adjoint operators on metric graphs, in the framework of random operators, is substantially more delicate a matter that the analysis of finite‐difference operators on the underlying discrete, combinatorial graphs. One may wonder, whether some properties of the Hamiltonians on the underlying graph can be useful for the analysis of their continuous siblings QΓ. The theory of boundary triples (cf. [19]) provides a powerful and valuable tool of spectral analysis on continuous metric graphs, where an essential part of technical work is carried out in a simpler framework of countable graphs with discrete Schrödinger operators.

Now we turn to a further development in this direction made recently by Sabri [7] who introduced the notion of multiparticle quantum graph. We consider the simplest nontrivial case of N=2quantum particles on a quantum graph QΓ. To be able to refer to existing results and publications, we assume the particles distinguishable.

In the discussion of two‐particle systems on a graph Gin Section 3, the pair (x1,x2)was ranging in the Cartesian (and then symmetric) square of G, and the latter is, topologically, a discrete space, thus essentially of the same nature as the factors in the product G×G. But now that the configuration space QΓfor each particle is a continuous object, viz. a (singular) one‐dimensional Riemannian manifold, the situation changes radically: the configuration space for the pair (x1,x2)is locally a two‐dimensional manifold; in the case of an N‐tuple (x1,,xN)it becomes N‐dimensional. Many specifically 1D methods of spectral analysis are inapplicable in dimension d2.

Shortly after the publication of the first results on N‐particle Anderson localization in periodic lattices and in Euclidean spaces, Sabri [7] proposed an interesting extension of the new techniques and results to the multiparticle systems on quantum graphs. His construction was essentially motivated by a specific goal, but there are various contexts where the construction itself may prove valuable.

For N=2, one has to start again with the building blocks of a 1D quantum graph QΓover a combinatorial graph Γ: the open finite intervals associated with each edge of Γ. Restricting the positions xiof the two particles to their respective continuous edges identified with [0,1], we have the pair (x1,x2)ranging in the unit square [0,1]×[0,1]. For brevity, call such basic squares cells. Each cell is delimited by four continuous edges inherited from the first and from the second particle, and these four (continuous) edges are the loci of contact between the cells. Clearly, this complicates the structure of what was the edge set in the underlying graph Γ, but this is the natural replacement for the notion of the edge set; this is what defines the topology and metric geometry of the new object, called by Sabri a two‐particle (more generally, N‐particle) quantum graph QΓ(2).

Just like the Laplacian Ldefined on the quantum graph, we can define its two‐particle counterpart L(2): first, on the unit squares, and then proceed to self‐adjoint extensions with one or another kind of boundary conditions to be imposed on the 1D continuous edges of the conventional, one‐particle quantum graphs supporting each of the two particles. This inevitable functional analytic work has been done by Sabri. And of course, once the natural Laplacian L(2)is defined as an unbounded self‐adjoint operator with a suitable domain in the Hilbert space of square‐integrable functions on QΓ(2), one can also define the Schrödinger operators HV(2)=L(2)+V, e.g., for bounded measurable functions V. In Figure 2, we give an example of three models based on the same graph structure: a combinatorial graph, a quantum graph, and a two‐dimensional domain surrounding the quantum graph in question.

Figure 2.

Example of (a) physical, thin two‐dimensional areaA; (b) corresponding metric graphQΓ: a mathematical abstraction where the finite width ofAis ignored; and (c) the combinatorial graph with the same vertices asQΓ.

The new construction raises a number of questions, of different nature. One of them concerns the constructive relations between the spectral properties of a Schrödinger operator HV(2)on the continuous, locally two‐dimensional (2D) manifold QΓ(2), and its analog on the Cartesian square of the combinatorial graph Γ.

Another question, of functional analytic nature, raised by Sabri, concerns an explicit description of the self‐adjoint extensions of the 2D Laplacian initially defined, say, on infinitely differentiable functions with support inside an open cell (0,1)2. It appears that the corner points make the explicit analysis difficult, although the existence of the desired extensions poses no serious problem.


5. Conclusion

Mathematical modeling of physical phenomena had provided important motivations for developing various fields of mathematical physics since several centuries; as to the quantum physics, its development was from the beginning of the twentieth century parallel to the development of the functional analysis in general and spectral theory of operators in particular. The remarkable discovery made by P. W. Anderson in 1958 brought to life a synthetic approach to modeling disordered systems based on a fusion of analysis in a broad sense with probability theory. The physical community came to realize that the models based on the idealized picture of perfectly periodic crystals miss some crucial mechanisms responsible for transport (e.g., electrical conductivity) or absence thereof under the Anderson localization. The classical formulae for conductivity and many related phenomena, crucial for the development of modern microelectronics and nanotechnologies, cannot ignore the localization/delocalization problematics. While the most simple models may refer to the integer (and some other periodic) lattices in a Euclidean space where classical Fourier analysis can use the method of separation of variables, the situation can be significantly more complex in the case of quasicrystals, featuring both a local order and long‐range disorder. Mathematically, such structures are described as nonperiodic graphs where the Fourier analysis breaks down, and one needs some efficient, constructive replacements. Furthermore, large and complex molecules studied in organic chemistry and molecular biology also require a versatile toolbox not limited to a commutative Fourier analysis. Also, the crystalline media in presence of structural (e.g., mechanical) defects are not stricto sensuperiodic, so again one needs robust eigenvalue distribution bounds not relying on the exactly periodic geometry of the media. In Section 2, we have seen that the isoperimetric inequalities, appeared in the graph theory under the influence of its diverse applications, provide indeed adequate tools for an asymptotic analysis of the limiting eigenvalue distribution for discrete quantum Hamiltonians used in physics in the framework of the so‐called tight‐binding approximation effective for the “low” energies. The term “low” actually refers to the energies lost important to the quantum processes exploited in modern microdevices (e.g., CPU having diameter of a few millimeters and width of order of a few dozens of atomic layers), in biological tissues and technologically created organic substances.

In 2008, The Isaac Newton Institute for Mathematical Sciences in Cambridge, Great Britain, has organized a semiannual program “Mathematics and Physics of Anderson Localization: 50 Years Later” aiming to summarize the impact of Anderson’s theory on physical theories and applications as well as on the mathematical physics. The general conclusion many participants and younger researchers could draw from numerous and diverse presentations was that the paradigm of quantum localization/delocalization provides today both a language and a general theoretic background for many specific directions of research; it is not an isolated pragmatic physical model or abstract mathematical problem. The program in question also revealed to the physics and mathematics communities the importance of the interparticle interaction which was briefly discussed in Section 3; the need for such theory was emphasized already by Anderson in his early papers, but one had to wait almost half a century to see its emergence in independent physical and rigorous mathematical works. Shortly after the program, the Anderson localization theory for interactive disordered systems has been applied (in mathematical works) to the nanotubes modeled by quantum graphs. While the size limitations of the present work do not allows us to present mathematical details of the new theory, there is no doubt that many of its mathematical aspects are closely related to the methods of the graph theory. Further reading, along with an extensive bibliography, can be found in the first monograph [4] dedicated to localization phenomena in interactive systems. This new direction of mathematical physics still is at its early stage of development. The language and toolbox of the graph theory proved to be very useful here, as we have seen in Section 3. On the other hand, new structures discussed in Section 4, emerging from the analysis of multiparticle quantum graphs open new problems and propose new types of models to the graph theory. This chapter was written in the hope to bring closer the communities of researchers, particularly the younger ones, working in functional analysis, graph theory in a broad sense, and in probability theory.

© 2017 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution 3.0 License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Victor Chulaevsky (December 20th 2017). Spectra and Quantum Transport on Graphs, Graph Theory - Advanced Algorithms and Applications, Beril Sirmacek, IntechOpen, DOI: 10.5772/intechopen.68480. Available from:

chapter statistics

1159total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Math Words and Their Dendrograms

By Francisco Casanova‐del‐Angel

Related Book

First chapter

Introductory Chapter: Traveling Salesman Problem - An Overview

By Donald Davendra and Magdalena Bialic-Davendra

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More About Us