Related papers: Levinson's theorem for graphs
We obtain the Phragm\`en-Lindel\"of principle on combinatorial infinite weighted graphs for the Cauchy problem associated to a certain class of parabolic equations with a variable density. We show that the hypothesis made on the density is…
Let $G=(V,E)$ be a graph with unit-length edges and nonnegative costs assigned to its vertices. Being given a list of pairwise different vertices $S=(s_1,s_2,\ldots,s_p)$, the {\em prioritized Voronoi diagram} of $G$ with respect to $S$ is…
In the paper we state and prove theorem describing the upper bound on number of the graphs that have fixed number of vertices |V| and can be colored with the fixed number of n colors. The bound relates both numbers using power of 2, while…
We consider a pair of parallel straight quantum waveguides coupled laterally through a window of a width $ \ell $ in the common boundary. We show that such a system has at least one bound state for any $ \ell>0 $. We find the corresponding…
We prove the Simons-Johnson theorem for the sums $S_n$ of $m$-dependent random variables, with exponential weights and limiting compound Poisson distribution $\CP(s,\lambda)$. More precisely, we give sufficient conditions for…
The brightness theorem---brightness is nonincreasing in passive systems---is a foundational conservation law, with applications ranging from photovoltaics to displays, yet it is restricted to the field of ray optics. For general linear wave…
In this note Levinson theorems for Schroedinger operators in R^n with one point interaction at 0 are derived using the concept of winding numbers. These results are based on new expressions for the associated wave operators.
Our goal is to investigate a close relative of the independent transversal problem in the class of infinite $K_n$-free graphs: we show that for any infinite $K_n$-free graph $G=(V,E)$ and $m\in \mathbb N$ there is a minimal $r=r(G,m)$ such…
We consider reflectionless wave propagation in networks modeled in terms of the nonlocal nonlinear Schr\"odinger (NNLS) equation on metric graphs, for which transparent boundary conditions are imposed at the vertices. By employing the…
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
We study viscosity solutions to the classical one-phase problem and its thin counterpart. In low dimensions, we show that when the free boundary is the graph of a continuous function, the solution is the half-plane solution. This answers,…
We consider diffusion processes on metric graphs with semipermeable sticky membranes in each vertex. We prove that the process is governed by a Feller semigroup and find its asymptotic behavior as diffusion's speed increases to infinity…
Graph-based methods have been quite successful in solving unsupervised and semi-supervised learning problems, as they provide a means to capture the underlying geometry of the dataset. It is often desirable for the constructed graph to…
A weighted area estimate for entire graphs with bounded weighted mean curvature in Gauss space is given by a simple proof. Bernstein type theorems for self shrinkers (\cite {wa}) as well as for graphic $\lambda$-hypersurfaces (\cite{…
We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…
We introduce a class of partial differential equations on metric graphs associated with mixed evolution: on some edges we consider diffusion processes, on other ones transport phenomena. This yields a system of equations with possibly…
We give a new proof of well posedness of the inverse modified scattering problem for the Vlasov--Poisson system: for every suitable scattering profile there exists a solution of Vlasov--Poisson which disperses and scatters, in a modified…
Scattering theory has been suggested as a convenient method to identify topological phases of matter, in particular of disordered systems for which the Bloch band-theory approach is inapplicable. Here we examine this idea, employing as a…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.