English
Related papers

Related papers: Scattering the geometry of weighted graphs

200 papers

The graphs with all equal negative or positive eigenvalues are special kind in the spectral graph theory. In this article, several iterated line graphs $\mathcal{L}^k(G)$ with all equal negative eigenvalues $-2$ are characterized for $k\ge…

Combinatorics · Mathematics 2025-11-25 Harishchandra S. Ramane , B. Parvathalu , Daneshwari Patil , K. Ashoka

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

Combinatorics · Mathematics 2016-10-26 Huda Chuangpishit , Jeannette Janssen

The $k$-sample $\mathbb{G}(k,W)$ from a graphon $W:[0,1]^2\to [0,1]$ is the random graph on $\{1,\dots,k\}$, where we sample $x_1,\dots,x_k\in [0,1]$ uniformly at random and make each pair $\{i,j\}\subseteq \{1,\dots,k\}$ an edge with…

Combinatorics · Mathematics 2022-07-26 Oliver Cooley , Mihyun Kang , Oleg Pikhurko

We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…

Computational Geometry · Computer Science 2013-10-11 Éric Colin de Verdière , Arnaud de Mesmay

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Combinatorics · Mathematics 2019-12-19 Jakub Przybyło

Using the Kato-Rosenblum theorem, we describe the absolutely continuous spectrum of a class of weighted integral Hankel operators in $L^2(\mathbb R_+)$. These self-adjoint operators generalise the explicitly diagonalisable operator with the…

Spectral Theory · Mathematics 2019-10-03 Emilio Fedele , Alexander Pushnitski

For a class of semilinear elliptic equations, we establish criteria that guarantee that the linearized operator associated with a solution satisfies certain spectral assumptions that are widely used in the analysis of the stability of…

Analysis of PDEs · Mathematics 2026-03-26 John Albert , Steven Levandosky

Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…

Combinatorics · Mathematics 2025-04-08 Stefan Steinerberger , Rekha R. Thomas

We give two characterizations for the essential self-adjointness of the weighted Laplacian on birth-death chains. The first involves the edge weights and vertex measure and is classically known; however, we give another proof using…

Functional Analysis · Mathematics 2024-04-22 Atsushi Inoue , Sean Ku , Jun Masamune , Radosław K. Wojciechowski

This paper is devoted to the study of propagation phenomena for $2$--hyponormal, quadratically hyponormal, and cubically hyponormal operator-valued weighted shifts. \ First, we show that every {\it quadratically} hyponormal matrix-valued…

Functional Analysis · Mathematics 2026-05-12 Raul E. Curto , Abderrazzak Ech-charyfy , Hamza El Azhar , El Hassan Zerouali

A graph is $k$-vertex-critical if $\chi(G)=k$ but $\chi(G-v)<k$ for all $v\in V(G)$ and $(G,H)$-free if it contains no induced subgraph isomorphic to $G$ or $H$. We show that there are only finitely many $k$-vertex-critical $(2P_2,H)$-free…

Combinatorics · Mathematics 2024-02-27 Melvin Adekanye , Christopher Bury , Ben Cameron , Thaler Knodel

For a given subcritical discrete Schr\"odinger operator $H$ on a weighted infinite graph $X$, we construct a Hardy-weight $w$ which is optimal in the following sense. The operator $H - \lambda w$ is subcritical in $X$ for all $\lambda < 1$,…

Spectral Theory · Mathematics 2017-09-01 Matthias Keller , Yehuda Pinchover , Felix Pogorzelski

For two dimensional Schr\"odinger operator $H$ with point interactions, We prove that wave operators of scattering for the pair $(H,H_0)$, $H_0$ being the free Schr\"odinger operator, are bounded in the Lebesgue space $L^p(\R^2)$ for…

Mathematical Physics · Physics 2020-06-18 Kenji Yajima

A graph $G$ is called an $L_1$-graph if $d(u)+d(v)\ge|N(u)\cup N(v)\cup N(w)|-1$ for every triple of vertices $u,v,w$ where $u$ and $v$ are at distance 2 and $w\in N(u)\cap N(v)$. Asratian et al. (1996) proved that all finite connected…

Combinatorics · Mathematics 2019-04-16 Jonas B. Granholm

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…

Combinatorics · Mathematics 2015-10-06 Tsai-Lien Wong , Xuding Zhu

We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…

Quantum Physics · Physics 2026-05-15 Allan John Gerrard , Ryo Asaka , Kazumitsu Sakai

We give a criterion of asymptotic completeness and provide a representation of the scattering matrix for the scattering couple $(A_{0},A)$, where $A_{0}$ and $A$ are semi-bounded self-adjoint operators in $L^{2}(M,{\mathscr B},m)$ such that…

Mathematical Physics · Physics 2019-01-29 Andrea Mantile , Andrea Posilicano

Let $H_0$, $H$ be a pair of self-adjoint operators for which the standard assumptions of the smooth version of scattering theory hold true. We give an explicit description of the absolutely continuous spectrum of the operator…

Spectral Theory · Mathematics 2018-05-16 Alexander Pushnitski , Dmitri Yafaev

The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…

Combinatorics · Mathematics 2018-11-01 Yuejian Peng , Zilong Yan

We consider the problem of existence of perfect $2$-colorings (equitable $2$-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we…