Related papers: Quantizing graphs, one way or two?
We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…
The question of self-adjoint realizations of sign-indefinite second order differential operators is discussed in terms of a model problem. Operators of the type $-\frac{d}{dx} \sgn (x) \frac{d}{dx}$ are generalized to finite, not…
This paper derives master equations for an atomic two-level system for a large set of unitarily equivalent Hamiltonians without employing the rotating wave and certain Markovian approximations. Each Hamiltonian refers to physically…
Quantum computers are ideally set up to solve linear systems which are of a form similar to the Schrodinger/Dirac equation of quantum mechanics. In the framework of linear response theory, the propagation and scattering of electromagnetic…
Design of filters for graph signal processing benefits from knowledge of the spectral decomposition of matrices that encode graphs, such as the adjacency matrix and the Laplacian matrix, used to define the shift operator. For shift matrices…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
In this work we show that the simple Hamiltonians used in Quantum Graphity models are highly degenerate, having multiple ground states that are not lattices. In order to assess the distance of the resulting graphs from a lattice graph, we…
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…
The method of self-adjoint extensions is employed to determine the vacuum quantum numbers induced by a singular static magnetic vortex in $2+1$-dimensional spinor electrodynamics. The results obtained are gauge-invariant and, for certain…
Coin and scattering are the two major formulations for discrete quantum walks models, each believed to have its own advantages in different applications. Although they are related in some cases, it was an open question their equivalence in…
Instead of using local field equations - like the Dirac equation for spin-1/2 and the Klein-Gordon equation for spin-0 particles - one could try to use non-local field equations in order to describe scattering processes. The latter…
A number of physical processes occurring in a flat one-dimensional graphene structure under the action of strong time-dependent electric fields are considered. It is assumed that the Dirac model can be applied to the graphene as a subsystem…
There has been quite some activity and progress concerning spectral asymptotics of random operators that are defined on percolation subgraphs of different types of graphs. In this short survey we record some of these results and explain the…
The representation of the resolvent as an integral operator, the $m$ function, and the associated spectral representation are fundamental topics in the spectral theory of self-adjoint ordinary differential operators. Versions of these are…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
Inspired by the natural piezoelectric effect, we introduce hybrid-wave electromechanical meta-atoms and meta-molecules that consist of coupled electrical and mechanical oscillators with similar resonance frequencies. We propose an…
Graphs are ubiquitous data structures for representing interactions between entities. With an emphasis on the use of graphs to represent chemical molecules, we explore the task of learning to generate graphs that conform to a distribution…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
We uncover the very rich graph topology of generic bounded non-Hermitian spectra, distinct from the topology of conventional band invariants and complex spectral winding. The graph configuration of complex spectra are characterized by the…
There were many attempts to geometrize electromagnetic field and find out new interpretation for quantum mechanics formalism. The distinctive feature of this work is that it combines geometrization of electromagnetic field and…