相关论文: Local Friedel sum rule on graphs
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
The local Larmor clock is used to derive a hierarchy of local densities of states. At the bottom of this hierarchy are the partial density of states for which represent the contribution to the local density of states if both the incident…
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled…
Scattering off a potential is a fundamental problem in quantum physics. It has been studied extensively with amplitudes derived for various potentials. In this article, we explore a setting with no potentials, where scattering occurs off a…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
We investigate the particle trapping and scattering properties in a tight-binding network which consists of several subgraphs. The particle trapping condition is proved under which particles can be trapped in a subgraph without leaking.…
This paper is about the scattering theory for one-dimensional matrix Schr\"odinger operators with a matrix potential having a finite first moment. The transmission coefficients are analytically continued and extended to the band edges. An…
We study spectral densities for systems on lattices, which, at a phase transition display, power-law spatial correlations. Constructing the spatial correlation matrix we prove that its eigenvalue density shows a power law that can be…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some…
Electrical transport in graphene offers a fascinating parallel to spin transport in semiconductors including the spin-Hall effect. In the weak momentum scattering regime the steady-state density matrix contains two contributions, one linear…
Minimally twisted bilayer graphene in the presence of an interlayer bias develops a triangular network of valley chiral modes that propagate along the $AB/BA$ interfaces and scatter at the $AA$ regions. The low energy physics of the…
Soliton transport in tube-like networks is studied by solving the nonlinear Schroedinger equation (NLSE) on finite thickness ("fat") graphs. The dependence of the solution and of the reflection at vertices on the graph thickness and on the…
The electronic states of an electrostatically confined cylindrical graphene quantum dot and the electric transport through this device are studied theoretically within the continuum Dirac-equation approximation and compared with numerical…
In a fractional coloring, vertices of a graph are assigned measurable subsets of the real line and adjacent vertices receive disjoint subsets; the fractional chromatic number of a graph is at most $k$ if it has a fractional coloring in…
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…
The Shor-Laflamme distribution (SLD) of a quantum state is a collection of local unitary invariants that quantify $k$-body correlations. We show that the SLD of graph states can be derived by solving a graph-theoretical problem. In this…
Consider a set of $n$ vertices, where each vertex has a location in $\mathbb{R}^d$ that is sampled uniformly from the unit cube in $\mathbb{R}^d$, and a weight associated to it. Construct a random graph by placing edges independently for…
Motivated by quantum chemistry calculations, showing that molecular adsorption in graphene takes place on preferential sites of the honeycomb lattice, we study the effect of an isolated impurity on the local electronic properties of a…
In this paper we introduce the edge inducibility problem. This is a common refinement of both the well known Kruskal--Katona theorem and the inducibility question introduced by Pippenger and Golumbic. Our first result is a hardness result.…