SearcharxivSearch

arXiv subjects

G. Berkolaiko

Publications and source records attributed to G. Berkolaiko.

18 recordsLinked to original sources

Spectral shift via "lateral" perturbation

We consider a compact perturbation $H_0 = S + K_0^* K_0$ of a self-adjoint operator $S$ with an eigenvalue $λ^\circ$ below its essential spectrum and the corresponding eigenfunction $f$. The perturbation is assumed to be "along" the eigenfunction $f$, namely $K_0f=0$. The eigenvalue $λ^\circ$ belongs to the spectra of both $H_0$ and $S$. Let $S$ have $σ$ more eigenvalues below $λ^\circ$ than $H_0$; $σ$ is known as the spectral shift at $λ^\circ$. We now allow the perturbation to vary in a suitable operator space and study the continuation of the eigenvalue $λ^\circ$ in the spectrum of $H(K)=S + K^* K$. We show that the eigenvalue as a function of $K$ has a critical point at $K=K_0$ and the Morse index of this critical point is the spectral shift $σ$. A version of this theorem also holds for some non-positive perturbations.

math.SP

Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions

We prove an analogue of the magnetic nodal theorem on quantum graphs: the number of zeros $ϕ$ of the $n$-th eigenfunction of the Schrödinger operator on a quantum graph is related to the stability of the $n$-th eigenvalue of the perturbation of the operator by magnetic potential. More precisely, we consider the $n$-th eigenvalue as a function of the magnetic perturbation and show that its Morse index at zero magnetic field is equal to $ϕ- (n-1)$.

math-ph

Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, transport moments reduce to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders higher than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.

math-ph

Combinatorial theory of the semiclassical evaluation of transport moments I: Equivalence with the random matrix approach

To study electronic transport through chaotic quantum dots, there are two main theoretical approachs. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other treats the transport in the semiclassical approximation and studies correlations among sets of classical trajectories. There are established evaluation procedures within the semiclassical evaluation that, for several linear and non-linear transport moments to which they were applied, have always resulted in the agreement with random matrix predictions. We prove that this agreement is universal: any semiclassical evaluation within the accepted procedures is equivalent to the evaluation within random matrix theory. The equivalence is shown by developing a combinatorial interpretation of the trajectory sets as ribbon graphs (maps) with certain properties and exhibiting systematic cancellations among their contributions. Remaining trajectory sets can be identified with primitive (palindromic) factorisations whose number gives the coefficients in the corresponding expansion of the moments of random matrices. The equivalence is proved for systems with and without time reversal symmetry.

math-ph

On inequivalent factorizations of a cycle

We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the factorizations with a given number of different commuting factors that can appear in the first and in the last positions, a problem which has found applications in physics. We also provide a necessary and sufficient condition for a set of cycles to be arrangeable into a product evaluating to (1 2 ... n).

math.CO

Mathematical Aspects of Vacuum Energy on Quantum Graphs

We use quantum graphs as a model to study various mathematical aspects of the vacuum energy, such as convergence of periodic path expansions, consistency among different methods (trace formulae versus method of images) and the possible connection with the underlying classical dynamics. We derive an expansion for the vacuum energy in terms of periodic paths on the graph and prove its convergence and smooth dependence on the bond lengths of the graph. For an important special case of graphs with equal bond lengths, we derive a simpler explicit formula. The main results are derived using the trace formula. We also discuss an alternative approach using the method of images and prove that the results are consistent. This may have important consequences for other systems, since the method of images, unlike the trace formula, includes a sum over special ``bounce paths''. We succeed in showing that in our model bounce paths do not contribute to the vacuum energy. Finally, we discuss the proposed possible link between the magnitude of the vacuum energy and the type (chaotic vs. integrable) of the underlying classical dynamics. Within a random matrix model we calculate the variance of the vacuum energy over several ensembles and find evidence that the level repulsion leads to suppression of the vacuum energy.

math-ph

Full counting statistics of chaotic cavities from classical action correlations

We present a trajectory-based semiclassical calculation of the full counting statistics of quantum transport through chaotic cavities, in the regime of many open channels. Our method to obtain the $m$th moment of the density of transmission eigenvalues requires two correlated sets of $m$ classical trajectories, therefore generalizing previous works on conductance and shot noise. The semiclassical results agree, for all values of $m$, with the corresponding predictions from random matrix theory.

cond-mat.mes-hall

Relationship between scattering matrix and spectrum of quantum graphs

We investigate the equivalence between spectral characteristics of the Laplace operator on a metric graph, and the associated unitary scattering operator. We prove that the statistics of level spacings, and moments of observations in the eigenbases coincide in the limit that all bond lengths approach a positive constant value.

math-ph

Non-exponential stability and decay rates in nonlinear stochastic difference equation with unbounded noises

We consider stochastic difference equation x_{n+1} = x_n (1 - h f(x_n) + \sqrt{h} g(x_n) ξ_{n+1}), where functions f and g are nonlinear and bounded, random variables ξ_i are independent and h>0 is a nonrandom parameter. We establish results on asymptotic stability and instability of the trivial solution x_n=0. We also show, that for some natural choices of the nonlinearities f and g, the rate of decay of x_n is approximately polynomial: we find α>0 such that x_n decay faster than n^{-α+ε} but slower than n^{-α-ε} for any ε>0. It also turns out that if g(x) decays faster than f(x) as x->0, the polynomial rate of decay can be established exactly, x_n n^α-> const. On the other hand, if the coefficient by the noise does not decay fast enough, the approximate decay rate is the best possible result.

math.PR

Quantum ergodicity for graphs related to interval maps

We prove quantum ergodicity for a family of graphs that are obtained from ergodic one-dimensional maps of an interval using a procedure introduced by Pakonski et al (J. Phys. A, v. 34, 9303-9317 (2001)). As observables we take the L^2 functions on the interval. The proof is based on the periodic orbit expansion of a majorant of the quantum variance. Specifically, given a one-dimensional, Lebesgue-measure-preserving map of an interval, we consider an increasingly refined sequence of partitions of the interval. To this sequence we associate a sequence of graphs, whose directed edges correspond to elements of the partitions and on which the classical dynamics approximates the Perron-Frobenius operator corresponding to the map. We show that, except possibly for subsequences of density 0, the eigenstates of the quantum graphs equidistribute in the limit of large graphs. For a smaller class of observables we also show that the Egorov property, a correspondence between classical and quantum evolution in the semiclassical limit, holds for the quantum graphs in question.

math-ph

Diagonal approximation of the form factor of the unitary group

The form factor of the unitary group U(N) endowed with the Haar measure characterizes the correlations within the spectrum of a typical unitary matrix. It can be decomposed into a sum over pairs of ``periodic orbits'', where by periodic orbit we understand any sequence of matrix indices. From here the diagonal approximation can be defined in the usual fashion as a sum only over pairs of identical orbits. We prove that as we take the dimension $N$ to infinity, the diagonal approximation becomes ``exact'', that is converges to the full form factor.

nlin.CD

Form factor for large quantum graphs: evaluating orbits with time-reversal

It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time τusing periodic-orbit theory. Two types of contributing pairs of orbits were identified, those which require time-reversal symmetry and those which do not. We present a new technique of dealing with contribution from the former type of orbits. The technique allows us to derive the third order term of the expansion for general graphs. Although the derivation is rather technical, the advantages of the technique are obvious: it makes the derivation tractable, it identifies explicitly the orbit configurations which give the correct contribution, it is more algorithmical and more system-independent, making possible future applications of the technique to systems other than quantum graphs.

nlin.CD

No quantum ergodicity for star graphs

We investigate statistical properties of the eigenfunctions of the Schrodinger operator on families of star graphs with incommensurate bond lengths. We show that these eigenfunctions are not quantum ergodic in the limit as the number of bonds tends to infinity by finding an observable for which the quantum matrix elements do not converge to the classical average. We further show that for a given fixed graph there are subsequences of eigenfunctions which localise on pairs of bonds. We describe how to construct such subsequences explicitly. These constructions are analogous to scars on short unstable periodic orbits.

math-ph

Intermediate wave-function statistics

We calculate statistical properties of the eigenfunctions of two quantum systems that exhibit intermediate spectral statistics: star graphs and Seba billiards. First, we show that these eigenfunctions are not quantum ergodic, and calculate the corresponding limit distribution. Second, we find that they can be strongly scarred by short periodic orbits, and construct sequences of states which have such a limit. Our results are illustrated by numerical computations.

nlin.CD

Spectral gap of doubly stochastic matrices generated from equidistributed unitary matrices

To a unitary matrix U we associate a doubly stochastic matrix M by taking the modulus squared of each element of U. To study the connection between onset of quantum chaos on graphs and ergodicity of the underlying Markov chain, specified by M, we study the limiting distribution of the spectral gap of M when U is taken from the Circular Unitary Ensemble and the dimension N of U is taken to infinity. We prove that the limiting distribution is degenerate: the gap tends to its maximal value 1. The shape of the gap distribution for finite N is also discussed.

nlin.CD

Structural Properties of Self-Attracting Walks

Self-attracting walks (SATW) with attractive interaction u > 0 display a swelling-collapse transition at a critical u_{\mathrm{c}} for dimensions d >= 2, analogous to the Θtransition of polymers. We are interested in the structure of the clusters generated by SATW below u_{\mathrm{c}} (swollen walk), above u_{\mathrm{c}} (collapsed walk), and at u_{\mathrm{c}}, which can be characterized by the fractal dimensions of the clusters d_{\mathrm{f}} and their interface d_{\mathrm{I}}. Using scaling arguments and Monte Carlo simulations, we find that for u u_{\mathrm{c}}, the clusters are compact, i.e. d_{\mathrm{f}}=d and d_{\mathrm{I}}=d-1. At u_{\mathrm{c}}, the SATW is in a new universality class. The clusters are compact in both d=2 and d=3, but their interface is fractal: d_{\mathrm{I}}=1.50\pm0.01 and 2.73\pm0.03 in d=2 and d=3, respectively. In d=1, where the walk is collapsed for all u and no swelling-collapse transition exists, we derive analytical expressions for the average number of visited sites and the mean time to visit S sites.

cond-mat

Star graphs and Seba billiards

We derive an exact expression for the two-point correlation function for quantum star graphs in the limit as the number of bonds tends to infinity. This turns out to be identical to the corresponding result for certain Seba billiards in the semiclassical limit. Reasons for this are discussed. The formula we derive is also shown to be equivalent to a series expansion for the form factor - the Fourier transform of the two-point correlation function - previously calculated using periodic orbit theory.

nlin.CD

Swelling-collapse transition of self-attracting walks

We study the structural properties of self-attracting walks in d dimensions using scaling arguments and Monte Carlo simulations. We find evidence for a transition analogous to the Θtransition of polymers. Above a critical attractive interaction u_c, the walk collapses and the exponents νand k, characterising the scaling with time t of the mean square end-to-end distance ~ t^{2 ν} and the average number of visited sites ~ t^k, are universal and given by ν=1/(d+1) and k=d/(d+1). Below u_c, the walk swells and the exponents are as with no interaction, i.e. ν=1/2 for all d, k=1/2 for d=1 and k=1 for d >= 2. At u_c, the exponents are found to be in a different universality class.

cond-mat