Related papers: Levinson's theorem for graphs
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
The inducibility of a graph $H$ is about the maximum number of induced copies of $H$ in a graph on $n$ vertices. We consider its edge version, that is, the maximum number of induced copies of $H$ in a graph with $m$ edges. Let $c(G,H)$ be…
We establish the long time soliton asymptotics for the translation invariant nonlinear system consisting of the Klein-Gordon equation coupled to a charged relativistic particle. The coupled system has a six dimensional invariant manifold of…
Scattering of time-harmonic plane wave by two parallel semi-infinite rows, but with staggered edges, is considered on square lattice. The condition imposed on the semi-infinite rows is a discrete analogue of Neumann boundary condition. A…
Graph $G$ is $F$-saturated if $G$ contains no copy of graph $F$ but any edge added to $G$ produces at least one copy of $F$. One common variant of saturation is to remove the former restriction: $G$ is $F$-semi-saturated if any edge added…
For a wide class of noninteracting tight-binding models in one dimension we present an analytical solution for all scattering and edge states on a half-infinite system. Without assuming any symmetry constraints we consider models with…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
The law of reflection states that smooth surfaces reflect waves specularly, thereby acting as a mirror. This law is insensitive to disorder as long as its length scale is smaller than the wavelength. Monolayer graphene exhibits a linear…
We consider the Schr\"odinger operator on a star shaped graph with $n$ edges joined at a single vertex. We derive an expression for the trace of the difference of the perturbed and unperturbed resolvent in terms of a Wronskian. This leads…
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
We present a new approach, based on graphon theory, to finding the limiting spectral distributions of general Wigner-type matrices. This approach determines the moments of the limiting measures and the equations of their Stieltjes…
Consider the linear Boltzmann equation of radiative transfer in a half-space, with constant scattering coefficient $\sigma$. Assume that, on the boundary of the half-space, the radiation intensity satisfies the Lambert (i.e. diffuse)…
Given an edge colouring of a graph with a set of $m$ colours, we say that the graph is (exactly) $m$-coloured if each of the colours is used. We consider edge colourings of the complete graph on $\mathbb{N}$ with infinitely many colours and…
In this paper we prove the following Liouville-type theorem: any anisotropic minimal graph with free boundary in the half-space must be flat, provided that the graph function has at most one-sided linear growth. This extends the classical…
The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$. A necessary and sufficient condition under…
We transform the two-dimensional Dirac-Weyl equation, which governs the charge carriers in graphene, into a non-linear first-order differential equation for scattering phase shift, using the so-called variable phase method. This allows us…
This paper develops an adaptive version of Mallat's scattering transform for signals on graphs. The main results are norm bounds for the layers of the transform, obtained from a version of a Beurling-Deny inequality that permits to remove…
We study a class of semilinear diffusion equations on infinite, connected, weighted graphs, focusing on two types of nonlinearities: monotone decreasing and Lipschitz continuous. Under minimal structural assumptions on the graph, we…
A classical theorem of Simonovits from the 1980s asserts that every graph $G$ satisfying ${e(G) \gg v(G)^{1+1/k}}$ must contain $\gtrsim \left(\frac{e(G)}{v(G)}\right)^{2k}$ copies of $C_{2k}$. Recently, Morris and Saxton established a…
We show that, for each fixed $k$, an $n$-vertex graph not containing a cycle of length $2k$ has at most $80\sqrt{k}\log k\cdot n^{1+1/k}+O(n)$ edges.