Related papers: Local Friedel sum rule on graphs
Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
We present calculations of the thermal and electric linear response in graphene, including disorder in the self-consistent t-matrix approximation. For strong impurity scattering, near the unitary limit, the formation of a band of impurity…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
In this article we formulate and discuss one particle quantum scattering theory on an arbitrary finite graph with $n$ open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general boundary conditions at the…
Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives…
Recent efforts have focused on characterizing the set of separable states that cannot be made entangled by any global unitary transformation. Here we characterize the set of states whose entanglement content cannot be increased under any…
We discuss spectral properties of a charged quantum particle confined to a chain graph consisting of an infinite array of rings under influence of a magnetic field assuming a $\delta$-coupling at the points where the rings touch. We start…
We give an explicit construction of the weak local limit of a class of preferential attachment graphs. This limit contains all local information and allows several computations that are otherwise hard, for example, joint degree…
We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired…
In this paper we study the convergence in distribution and the local limit theorem for the partial sums of linear random fields with i.i.d. innovations that have infinite second moment and belong to the domain of attraction of a stable law…
We examine the local density of states of an impurity level or a quantum dot coupled to a fractional quantum Hall edge, or to the end of a single one-dimensional Luttinger-liquid lead. Effects of an Ohmic dissipative bath are also taken…
The effects of doping on a one-dimensional wire in a charge density wave state are studied using the density-matrix renormalization group method. We show that for a finite number of extra electrons the ground state becomes conducting but…
Paper proposes a model of large networks based on a random preferential attachment graph with addition of complete subgraphs (cliques). The proposed model refers to models of random graphs following the nonlinear preferential attachment…
We consider a countable system of interacting (possibly non-Markovian) stochastic differential equations driven by independent Brownian motions and indexed by the vertices of a locally finite graph $G = (V,E)$. The drift of the process at…
Let G be a finite graph or an infinite graph on which Z^d acts with finite fundamental domain. If G is finite, let T be a random spanning tree chosen uniformly from all spanning trees of G; if G is infinite, known methods show that this…
We consider arbitrary quantum wire networks modelled by finite, noncompact, connected quantum graphs in the presence of an external magnetic field. We find a general formula for the total scattering matrix of the network in terms of its…
It is known that the vertex connectivity of a planar graph can be computed in linear time. We extend this result to the class of locally maximal 1-plane graphs: graphs that have an embedding with at most one crossing per edge such that the…
We consider a square lattice configuration of circular gate-defined quantum dots in an unbiased graphene sheet and calculate the electronic, particularly spectral properties of finite albeit actual sample sized systems by means of a…
We investigate the effect of both strong and weak potential scattering caused by local impurities and extended (line) defects in the array of Luttinger liquid wires. We find that in both cases a finite range inter-wire interaction…