Related papers: A trace formula for metric graphs with piecewise c…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…
We extend the generalize conservation law of light propagating in a one-dimensional $\cal PT$-symmetric system, i.e., $|T-1|=\sqrt{R_LR_R}$ for the transmittance $T$ and the reflectance $R_{L,R}$ from the left and right, to a multimode…
With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of…
In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…
Trace formulas play a central role in the study of spectral geometry and in particular of quantum graphs. The basis of our work is the result by Kurasov which links the Euler characteristic $\chi$ of metric graphs to the spectrum of their…
A detailed discussion of semiclassical trace formulae is presented and it is demonstrated how a regularized trace formula can be derived while dealing only with finite and convergent expressions. Furthermore, several applications of trace…
The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…
Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign…
The scattering amplitude in simple quantum graphs is a well-known process which may be highly complex. In this work, motivated by the Shannon entropy, we propose a methodology that associates to a graph a scattering entropy, which we call…
We propose a simple random process inducing various types of random graphs and the scale free random graphs among others. The model is of a threshold nature and differs from the preferential attachment approach discussed in the literature…
We formulate and prove a Gelfand-Levitan trace formula for general quantum graphs with arbitrary edge lengths and coupling conditions which cover all self-adjoint operators on quantum graphs, except for a set of measure zero. The formula is…
Few-mode models have been a cornerstone of the theoretical work in quantum optics, with the famous single-mode Jaynes-Cummings model being only the most prominent example. In this work, we develop ab initio few-mode theory, a framework…
We developed an open-source scalar wave transport model to estimate the generalized scattering matrix (S matrix) of a disordered medium in the diffusion regime. Here, the term generalization refers to the incorporation of evanescent wave…
We present application examples of a graphical method for the efficient construction of potential matrix elements in quantum physics or quantum chemistry. The simplicity and power of this method are illustrated through several examples. In…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
Using the theory of diffusion in graphs, we propose a model to study mesoscopic transport through a diffusive quantum dot. The graph consists of three quasi-1D regions: a central region describing the dot, and two identical left- and right-…
We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…
We consider the effects of plane-wave states scattering off finite graphs, as an approach to implementing single-qubit unitary operations within the continuous-time quantum walk framework of universal quantum computation. Four semi-infinite…
The problem of electron scattering on the one-dimensional complexes is considered. We propose a novel theoretical approach to solution of the transport problem for a quantum graph. In the frame of the developed approach the solution of the…