arXiv subjects

J. M. Harrison

Publications and source records attributed to J. M. Harrison.

17 recordsLinked to original sources

arXiv2018

Lyndon word decompositions and pseudo orbits on q-nary graphs

A foundational result in the theory of Lyndon words (words that are strictly earlier in lexicographic order than their cyclic permutations) is the Chen-Fox-Lyndon theorem which states that every word has a unique non-increasing decomposition into Lyndon words. This article extends this factorization theorem, obtaining the proportion of these decompositions that are strictly decreasing. This result is then used to count primitive pseudo orbits (sets of primitive periodic orbits) on q-nary graphs. As an application we obtain a diagonal approximation to the variance of the characteristic polynomial coefficients q-nary quantum graphs.

math-ph↗

arXiv2016

Zeta Functions of the Dirac Operator on Quantum Graphs

We construct spectral zeta functions for the Dirac operator on metric graphs. We start with the case of a rose graph, a graph with a single vertex where every edge is a loop. The technique is then developed to cover any finite graph with general energy independent matching conditions at the vertices. The regularized spectral determinant of the Dirac operator is also obtained as the derivative of the zeta function at a special value. In each case the zeta function is formulated using a contour integral method, which extends results obtained for Laplace and Schrodinger operators on graphs.

math-ph↗

arXiv2012

Intermediate statistics for a system with symplectic symmetry: the Dirac rose graph

We study the spectral statistics of the Dirac operator on a rose-shaped graph---a graph with a single vertex and all bonds connected at both ends to the vertex. We formulate a secular equation that generically determines the eigenvalues of the Dirac rose graph, which is seen to generalise the secular equation for a star graph with Neumann boundary conditions. We derive approximations to the spectral pair correlation function at large and small values of spectral spacings, in the limit as the number of bonds approaches infinity, and compare these predictions with results of numerical calculations. Our results represent the first example of intermediate statistics from the symplectic symmetry class.

math-ph↗

arXiv2012

Vacuum energy of Schrödinger operators on metric graphs

We present an integral formulation of the vacuum energy of Schrödinger operators on finite metric graphs. Local vertex matching conditions on the graph are classified according to the general scheme of Kostrykin and Schrader. While the vacuum energy of the graph can contain finite ambiguities the Casimir force on a bond with compactly supported potential is well defined. The vacuum energy is determined from the zeta function of the graph Schrödinger operator which is derived from an appropriate secular equation via the argument principle. A quantum graph has an associated probabilistic classical dynamics which is generically both ergodic and mixing. The results therefore present an analytic formulation of the vacuum energy of this quasi-one-dimensional quantum system which is classically chaotic.

math-ph↗

arXiv2011

Spectral determinants and zeta functions of Schrödinger operators on metric graphs

A derivation of the spectral determinant of the Schrödinger operator on a metric graph is presented where the local matching conditions at the vertices are of the general form classified according to the scheme of Kostrykin and Schrader. To formulate the spectral determinant we first derive the spectral zeta function of the Schrödinger operator using an appropriate secular equation. The result obtained for the spectral determinant is along the lines of the recent conjecture.

math-ph↗

arXiv2010

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↗

arXiv2010

Zeta functions of quantum graphs

In this article we construct zeta functions of quantum graphs using a contour integral technique based on the argument principle. We start by considering the special case of the star graph with Neumann matching conditions at the center of the star. We then extend the technique to allow any matching conditions at the center for which the Laplace operator is self-adjoint and finally obtain an expression for the zeta function of any graph with general vertex matching conditions. In the process it is convenient to work with new forms for the secular equation of a quantum graph that extend the well known secular equation of the Neumann star graph. In the second half of the article we apply the zeta function to obtain new results for the spectral determinant, vacuum energy and heat kernel coefficients of quantum graphs. These have all been topics of current research in their own right and in each case this unified approach significantly expands results in the literature.

math-ph↗

arXiv2010

Positive recurrence of reflecting Brownian motion in three dimensions

Consider a semimartingale reflecting Brownian motion (SRBM) $Z$ whose state space is the $d$-dimensional nonnegative orthant. The data for such a process are a drift vector $θ$, a nonsingular $d\times d$ covariance matrix $Σ$, and a $d\times d$ reflection matrix $R$ that specifies the boundary behavior of $Z$. We say that $Z$ is positive recurrent, or stable, if the expected time to hit an arbitrary open neighborhood of the origin is finite for every starting state. In dimension $d=2$, necessary and sufficient conditions for stability are known, but fundamentally new phenomena arise in higher dimensions. Building on prior work by El Kharroubi, Ben Tahar and Yaacoubi [Stochastics Stochastics Rep. 68 (2000) 229--253, Math. Methods Oper. Res. 56 (2002) 243--258], we provide necessary and sufficient conditions for stability of SRBMs in three dimensions; to verify or refute these conditions is a simple computational task. As a byproduct, we find that the fluid-based criterion of Dupuis and Williams [Ann. Probab. 22 (1994) 680--702] is not only sufficient but also necessary for stability of SRBMs in three dimensions. That is, an SRBM in three dimensions is positive recurrent if and only if every path of the associated fluid model is attracted to the origin. The problem of recurrence classification for SRBMs in four and higher dimensions remains open.

math.PR↗

arXiv2010

Vacuum energy, spectral determinant and heat kernel asymptotics of graph Laplacians with general vertex matching conditions

We consider Laplace operators on metric graphs, networks of one-dimensional line segments (bonds), with matching conditions at the vertices that make the operator self-adjoint. Such quantum graphs provide a simple model of quantum mechanics in a classically chaotic system with multiple scales corresponding to the lengths of the bonds. For graph Laplacians we briefly report results for the spectral determinant, vacuum energy and heat kernel asymptotics of general graphs in terms of the vertex matching conditions.

math-ph↗

arXiv2008

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↗

arXiv2008

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↗

arXiv2008

Quantum graphs with spin Hamiltonians

The article surveys quantization schemes for metric graphs with spin. Typically quantum graphs are defined with the Laplace or Schrodinger operator which describe particles whose intrinsic angular momentum (spin) is zero. However, in many applications, for example modeling an electron (which has spin-1/2) on a network of thin wires, it is necessary to consider operators which allow spin-orbit interaction. The article presents a review of quantization schemes for graphs with three such Hamiltonian operators, the Dirac, Pauli and Rashba Hamiltonians. Comparing results for the trace formula, spectral statistics and spin-orbit localization on quantum graphs with spin Hamiltonians.

math-ph↗

arXiv2007

Quantum graphs where back-scattering is prohibited

We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.

math-ph↗

arXiv2007

On occurrence of spectral edges for periodic operators inside the Brillouin zone

The article discusses the following frequently arising question on the spectral structure of periodic operators of mathematical physics (e.g., Schroedinger, Maxwell, waveguide operators, etc.). Is it true that one can obtain the correct spectrum by using the values of the quasimomentum running over the boundary of the (reduced) Brillouin zone only, rather than the whole zone? Or, do the edges of the spectrum occur necessarily at the set of ``corner'' high symmetry points? This is known to be true in 1D, while no apparent reasons exist for this to be happening in higher dimensions. In many practical cases, though, this appears to be correct, which sometimes leads to the claims that this is always true. There seems to be no definite answer in the literature, and one encounters different opinions about this problem in the community. In this paper, starting with simple discrete graph operators, we construct a variety of convincing multiply-periodic examples showing that the spectral edges might occur deeply inside the Brillouin zone. On the other hand, it is also shown that in a ``generic'' case, the situation of spectral edges appearing at high symmetry points is stable under small perturbations. This explains to some degree why in many (maybe even most) practical cases the statement still holds.

math-ph↗

arXiv2006

Workload reduction of a generalized Brownian network

We consider a dynamic control problem associated with a generalized Brownian network, the objective being to minimize expected discounted cost over an infinite planning horizon. In this Brownian control problem (BCP), both the system manager's control and the associated cumulative cost process may be locally of unbounded variation. Due to this aspect of the cost process, both the precise statement of the problem and its analysis involve delicate technical issues. We show that the BCP is equivalent, in a certain sense, to a reduced Brownian control problem (RBCP) of lower dimension. The RBCP is a singular stochastic control problem, in which both the controls and the cumulative cost process are locally of bounded variation.

math.PR↗

arXiv2005

Drift rate control of a Brownian processing system

A system manager dynamically controls a diffusion process Z that lives in a finite interval [0,b]. Control takes the form of a negative drift rate θthat is chosen from a fixed set A of available values. The controlled process evolves according to the differential relationship dZ=dX-θ(Z) dt+dL-dU, where X is a (0,σ) Brownian motion, and L and U are increasing processes that enforce a lower reflecting barrier at Z=0 and an upper reflecting barrier at Z=b, respectively. The cumulative cost process increases according to the differential relationship dξ=c(θ(Z)) dt+p dU, where c(\cdot) is a nondecreasing cost of control and p>0 is a penalty rate associated with displacement at the upper boundary. The objective is to minimize long-run average cost. This problem is solved explicitly, which allows one to also solve the following, essentially equivalent formulation: minimize the long-run average cost of control subject to an upper bound constraint on the average rate at which U increases. The two special problem features that allow an explicit solution are the use of a long-run average cost criterion, as opposed to a discounted cost criterion, and the lack of state-related costs other than boundary displacement penalties. The application of this theory to power control in wireless communication is discussed.

math.PR↗

arXiv2004

Quantum indistinguishability from general representations of SU(2n)

A treatment of the spin-statistics relation in nonrelativistic quantum mechanics due to Berry and Robbins [Proc. R. Soc. Lond. A (1997) 453, 1771-1790] is generalised within a group-theoretical framework. The construction of Berry and Robbins is re-formulated in terms of certain locally flat vector bundles over n-particle configuration space. It is shown how families of such bundles can be constructed from irreducible representations of the group SU(2n). The construction of Berry and Robbins, which leads to a definite connection between spin and statistics (the physically correct connection), is shown to correspond to the completely symmetric representations. The spin-statistics connection is typically broken for general SU(2n) representations, which may admit, for a given value of spin, both bose and fermi statistics, as well as parastatistics. The determination of the allowed values of the spin and statistics reduces to the decomposition of certain zero-weight representations of a (generalised) Weyl group of SU(2n). A formula for this decomposition is obtained using the Littlewood-Richardson theorem for the decomposition of representations of U(m+n) into representations of U(m)*U(n).

math-ph↗