arXiv subjects

Sven Gnutzmann

Publications and source records attributed to Sven Gnutzmann.

At least 37 records · Page 2Linked to original sources

arXiv2013

A sub-determinant approach for pseudo-orbit expansions of spectral determinants in quantum maps and quantum graphs

We study implications of unitarity for pseudo-orbit expansions of the spectral determinants of quantum maps and quantum graphs. In particular, we advocate to group pseudo-orbits into sub-determinants. We show explicitly that the cancellation of long orbits is elegantly described on this level and that unitarity can be built in using a simple sub-determinant identity which has a non-trivial interpretation in terms of pseudo-orbits. This identity yields much more detailed relations between pseudo orbits of different length than known previously. We reformulate Newton identities and the spectral density in terms of sub-determinant expansions and point out the implications of the sub-determinant identity for these expressions. We analyse furthermore the effect of the identity on spectral correlation functions such as the auto-correlation and parametric cross correlation functions of the spectral determinant and the spectral form factor.

nlin.CD↗

arXiv2012

Remarks on nodal volume statistics for regular and chaotic wave functions in various dimensions

We discuss the statistical properties of the volume of the nodal set of wave function for two paradigmatic model systems which we consider in arbitrary dimension $s\ge 2$: the cuboid as a paradigm for a regular shape with separable wave functions, planar random waves as an established model for chaotic wave functions in irregular shapes. We give explicit results for the mean and variance of the nodal volume in arbitrary dimension, and for their limiting distribution. For the mean nodal volume we calculate the effect of the boundary of the cuboid where Dirichlet boundary conditions reduce the nodal volume compared to the bulk. Boundary effects for chaotic wave functions are calculated using random waves which satisfy a Dirichlet boundary condition on a hyperplane. We put forward several conjectures what properties of cuboids generalise to general regular shapes with separable wave functions and what properties of random waves can be expected for general irregular shapes. These universal features clearly distinct between the two cases.

math-ph↗

arXiv2012

Topological Resonances in Scattering on Networks (Graphs)

We report on a hitherto unnoticed type of resonances occurring in scattering from networks (quantum graphs) which are due to the complex connectivity of the graph - its topology. We consider generic open graphs and show that any cycle leads to narrow resonances which do not fit in any of the prominent paradigms for narrow resonances (classical barriers, localization due to disorder, chaotic scattering). We call these resonances `topological' to emphasize their origin in the non-trivial connectivity. Topological resonances have a clear and unique signature which is apparent in the statistics of the resonance parameters (such as e.g., the width, the delay time or the wave-function intensity in the graph). We discuss this phenomenon by providing analytical arguments supported by numerical simulation, and identify the features of the above distributions which depend on genuine topological quantities such as the length of the shortest cycle (girth). These signatures cannot be explained using any of the other paradigms for narrow resonances. Finally, we propose an experimental setting where the topological resonances could be demonstrated, and study the stability of the relevant distribution functions to moderate dissipation.

nlin.CD↗

arXiv2012

On the Nodal Count Statistics for Separable Systems in any Dimension

We consider the statistics of the number of nodal domains aka nodal counts for eigenfunctions of separable wave equations in arbitrary dimension. We give an explicit expression for the limiting distribution of normalised nodal counts and analyse some of its universal properties. Our results are illustrated by detailed discussion of simple examples and numerical nodal count distributions.

math-ph↗

arXiv2011

Nodal domains of a non-separable problem - the right angled isosceles triangle

We study the nodal set of eigenfunctions of the Laplace operator on the right angled isosceles triangle. A local analysis of the nodal pattern provides an algorithm for computing the number of nodal domains for any eigenfunction. In addition, an exact recursive formula for the number of nodal domains is found to reproduce all existing data. Eventually we use the recursion formula to analyse a large sequence of nodal counts statistically. Our analysis shows that the distribution of nodal counts for this triangular shape has a much richer structure than the known cases of regular separable shapes or completely irregular shapes. Furthermore we demonstrate that the nodal count sequence contains information about the periodic orbits of the corresponding classical ray dynamics.

math-ph↗

arXiv2011

Stationary scattering from a nonlinear network

Transmission through a complex network of nonlinear one-dimensional leads is discussed by extending the stationary scattering theory on quantum graphs to the nonlinear regime. We show that the existence of cycles inside the graph leads to a large number of sharp resonances that dominate scattering. The latter resonances are then shown to be extremely sensitive to the nonlinearity and display multi-stability and hysteresis. This work provides a framework for the study of light propagation in complex optical networks.

nlin.CD↗

arXiv2008

Spectra of graphs and semi-conducting polymers

We study the band gap in some semi-conducting polymers with two models: Hückel molecular orbital theory and the so-called free electron model. The two models are directly related to spectral theory on combinatorial and metric graphs.

math-ph↗

arXiv2007

On the spectral gap in Andreev graphs

We introduce Andreev scattering (electron-hole conversion at an interface of a normal conductor to a superconductor) at the outer vertices of a quantum star graph and examine its effect on the spectrum. More specifically we show that the density of states in Andreev graphs is suppressed near the Fermi energy where a spectral gap may occur. The size and existence of such a gap depends on one side on the Andreev scattering amplitudes and, on the other side,on the properties of the electron-electron scattering matrix at the central vertex. We also show that the bond length fluctuations have a minor effect on the spectrum near the Fermi energy.

cond-mat.supr-con↗

arXiv2007

Geometric characterization of nodal domains: the area-to-perimeter ratio

In an attempt to characterize the distribution of forms and shapes of nodal domains in wave functions, we define a geometric parameter - the ratio $ρ$ between the area of a domain and its perimeter, measured in units of the wavelength $1/\sqrt{E}$. We show that the distribution function $P(ρ)$ can distinguish between domains in which the classical dynamics is regular or chaotic. For separable surfaces, we compute the limiting distribution, and show that it is supported by an interval, which is independent of the properties of the surface. In systems which are chaotic, or in random-waves, the area-to-perimeter distribution has substantially different features which we study numerically. We compare the features of the distribution for chaotic wave functions with the predictions of the percolation model to find agreement, but only for nodal domains which are big with respect to the wavelength scale. This work is also closely related to, and provides a new point of view on isoperimetric inequalities.

nlin.CD↗

arXiv2006

Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics

During the last years quantum graphs have become a paradigm of quantum chaos with applications from spectral statistics to chaotic scattering and wave function statistics. In the first part of this review we give a detailed introduction to the spectral theory of quantum graphs and discuss exact trace formulae for the spectrum and the quantum-to-classical correspondence. The second part of this review is devoted to the spectral statistics of quantum graphs as an application to quantum chaos. Especially, we summarise recent developments on the spectral statistics of generic large quantum graphs based on two approaches: the periodic-orbit approach and the supersymmetry approach. The latter provides a condition and a proof for universal spectral statistics as predicted by random-matrix theory.

nlin.CD↗

arXiv2006

Can one count the shape of a drum?

Sequences of nodal counts store information on the geometry (metric) of the domain where the wave equation is considered. To demonstrate this statement, we consider the eigenfunctions of the Laplace-Beltrami operator on surfaces of revolution. Arranging the wave functions by increasing values of the eigenvalues, and counting the number of their nodal domains, we obtain the nodal sequence whose properties we study. This sequence is expressed as a trace formula, which consists of a smooth (Weyl-like) part which depends on global geometrical parameters, and a fluctuating part which involves the classical periodic orbits on the torus and their actions (lengths). The geometrical content of the nodal sequence is thus explicitly revealed.

nlin.CD↗

arXiv2005

Spectral correlations of individual quantum graphs

We investigate the spectral properties of chaotic quantum graphs. We demonstrate that the `energy'--average over the spectrum of individual graphs can be traded for the functional average over a supersymmetric non--linear $σ$--model action. This proves that spectral correlations of individual quantum graphs behave according to the predictions of Wigner--Dyson random matrix theory. We explore the stability of the universal random matrix behavior with regard to perturbations, and discuss the crossover between different types of symmetries.

nlin.CD↗

arXiv2005

Resolving isospectral "drums" by counting nodal domains

Several types of systems were put forward during the past decades to show that there exist {\it isospectral} systems which are {\it metrically} different. One important class consists of Laplace Beltrami operators for pairs of flat tori in $\mathbb{R}^n$ with $n\geq 4$. We propose that the spectral ambiguity can be resolved by comparing the nodal sequences (the numbers of nodal domains of eigenfunctions, arranged by increasing eigenvalues). In the case of isospectral flat tori in four dimensions - where a 4-parameters family of isospectral pairs is known- we provide heuristic arguments supported by numerical simulations to support the conjecture that the isospectrality is resolved by the nodal count. Thus - one can {\it count} the shape of a drum (if it is designed as a flat torus in four dimensions...).

nlin.CD↗

arXiv2004

The morphology of nodal lines-random waves versus percolation

In this paper we investigate the properties of nodal structures in random wave fields, and in particular we scrutinize their recently proposed connection with short-range percolation models. We propose a measure which shows the difference between monochromatic random waves, which are characterized by long-range correlations, and Gaussian fields with short-range correlations, which are naturally assumed to be better modelled by percolation theory. We also study the relevance of the quantities which we compute to the probability that nodal lines are in the vicinity of a given reference line.

nlin.CD↗

arXiv2004

Universal spectral statistics in quantum graphs

We prove that the spectrum of an individual chaotic quantum graph shows universal spectral correlations, as predicted by random--matrix theory. The stability of these correlations with regard to non--universal corrections is analyzed in terms of the linear operator governing the classical dynamics on the graph.

nlin.CD↗

arXiv2003

Universal spectral statistics in Wigner-Dyson, chiral and Andreev star graphs I: construction and numerical results

In a series of two papers we investigate the universal spectral statistics of chaotic quantum systems in the ten known symmetry classes of quantum mechanics. In this first paper we focus on the construction of appropriate ensembles of star graphs in the ten symmetry classes. A generalization of the Bohigas-Giannoni-Schmit conjecture is given that covers all these symmetry classes. The conjecture is supported by numerical results that demonstrate the fidelity of the spectral statistics of star graphs to the corresponding Gaussian random-matrix theories.

nlin.CD↗

arXiv2003

Universal spectral statistics in Wigner-Dyson, chiral and Andreev star graphs II: semiclassical approach

A semiclassical approach to the universal ergodic spectral statistics in quantum star graphs is presented for all known ten symmetry classes of quantum systems. The approach is based on periodic orbit theory, the exact semiclassical trace formula for star graphs and on diagrammatic techniques. The appropriate spectral form factors are calculated upto one order beyond the diagonal and self-dual approximations. The results are in accordance with the corresponding random-matrix theories which supports a properly generalized Bohigas-Giannoni-Schmit conjecture.

nlin.CD↗

arXiv2003

Nodal domains on quantum graphs

We consider the real eigenfunctions of the Schrödinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds $B$. For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit when the number of vertices is large. The approach to this limit is not simple, and we discuss it in detail. At the same time we define a random wave model for graphs, and compare the predictions of this model with analytic and numerical computations.

nlin.CD↗