相关论文: Edge switching transformations of quantum graphs

We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…

Let $X=(V,E)$ be a finite simple connected graph with $n$ vertices and $m$ edges. A configuration is an assignment of one of two colors, black or white, to each edge of $X.$ A move applied to a configuration is to select a black edge…

We probe quantum Hall effect in a tunable 1-D lateral superlattice (SL) in graphene created using electrostatic gates. Lack of equilibration is observed along edge states formed by electrostatic gates inside the superlattice. We create…

In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

We study the point spectrum of a periodic quantum tree equipped with a Schr\"odinger type differential operator with delta-type vertex conditions, using subsets of the compact graph that generates the tree. We prove analogs of existing…

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…

We discuss discrete one-dimensional Schr\"odinger operators whose potentials are generated by an invertible ergodic transformation of a compact metric space and a continuous real-valued sampling function. We pay particular attention to the…

At an interface between contacts and graphene, the mathematical equation that governs the propagation of electrons transforms from the Schrodinger to the Dirac equation. The condition of current probability conservation at such an interface…

We suggest a method for calculating electronic spectra in ordered and disordered semiconductor structures (superlattices) forming double quantum wells (QW). In our method, we represent the solution of Schr\"odinger equation for QW potential…

We consider a two-dimensional periodic Schr\"odinger operator $H=-\Delta+W$ with $\Gamma$ being the lattice of periods. We investigate the structure of the edges of open gaps in the spectrum of $H$. We show that under arbitrary small…

The spectral properties of two-dimensional Schr\"odinger operators with $\delta'$-potentials supported on star graphs are discussed. We describe the essential spectrum and give a complete description of situations in which the discrete…

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…

The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study…

It is shown that every quantum principal bundle is braided, in the sense that there exists an intrinsic braid operator twisting the functions on the bundle. A detailed algebraic analysis of this operator is performed. In particular, it…

We study experimentation under endogenous network interference. Interference patterns are mediated by an endogenous graph, where edges can be formed or eliminated as a result of treatment. We show that conventional estimators are biased in…

Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…

We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues $E_n$ is computable analytically, explicitly, and individually for any given $n$. This is surprising, since quantum graphs are…

We demonstrate that any self-adjoint coupling in a quantum graph vertex can be approximated by a family of magnetic Schroedinger operators on a tubular network built over the graph. If such a manifold has a boundary, Neumann conditions are…

We examine quantum transport in periodic quantum graphs with a vertex coupling non-invariant with respect to time reversal. It is shown that the graph topology may play a decisive role in the conductivity properties illustrating this claim…