English
Related papers

Related papers: Levinson's theorem for graphs II

200 papers

Effective Hamiltonians can explain in a much simpler way the physics behind a scattering process. Chaotic scattering is directly related to Lorentzian Hamiltonians which, because of their properties, can be reduced to a $2\times 2$ matrix…

Disordered Systems and Neural Networks · Physics 2013-04-03 Adel Abbout , Peng Mei

We consider the Vlasov-Poisson system with initial data a small, radial, absolutely continuous perturbation of a point charge. We show that the solution is global and disperses to infinity via a modified scattering along trajectories of the…

Analysis of PDEs · Mathematics 2021-06-30 Benoit Pausader , Klaus Widmayer

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

Combinatorics · Mathematics 2023-06-21 Richard Lang , Nicolás Sanhueza-Matamala

We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…

Mathematical Physics · Physics 2013-05-30 Z. Pluhar , H. A. Weidenmueller

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

Combinatorics · Mathematics 2007-05-23 Zoltan Furedi , Dhruv Mubayi , Douglas B. West

A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…

Probability · Mathematics 2007-05-23 Alexey M. Kulik

The matrix Schr\"odinger equation is considered on the half line with the general selfadjoint boundary condition at the origin described by two boundary matrices satisfying certain appropriate conditions. It is assumed that the matrix…

Mathematical Physics · Physics 2017-08-15 Tuncay Aktosun , Ricardo Weder

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…

Probability · Mathematics 2020-08-11 Yizhe Zhu

Due to spectral obstructions, a scattering theory in the Lax-Phillips sense for the wave equation for differential p-forms on H^{n+1} cannot be developed. As a consequence, Huygens' principle for the wave equation in this context does not…

Differential Geometry · Mathematics 2007-05-23 Francesca Antoci

A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…

Combinatorics · Mathematics 2026-04-01 Richard Lang , Nicolás Sanhueza-Matamala

Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of…

Differential Geometry · Mathematics 2007-05-23 Steffen Froehlich

For integers $k\geq 1$ and $n\geq 2k+1$, the Schrijver graph $S(n,k)$ has as vertices all $k$-element subsets of $[n]:=\{1,2,\ldots,n\}$ that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More…

Combinatorics · Mathematics 2024-06-03 Torsten Mütze , Namrata

In this paper we prove a sufficient condition for the existence of a Hamilton cycle, which is applicable to a wide variety of graphs, including relatively sparse graphs. In contrast to previous criteria, ours is based on only two…

Combinatorics · Mathematics 2007-05-23 Dan Hefetz , Michael Krivelevich , Tibor Szabo

We prove the discrete Lusternik-Schnirelmann theorem telling that tcat(G) less or equal to crit(G) for a general simple graph G=(V,E). It relates the minimal number tcat(G) of in G contractible graphs covering G, with crit(G), the minimal…

Algebraic Topology · Mathematics 2012-11-15 Frank Josellis , Oliver Knill

A scattering process can be described by suitably closing the system and considering the first return map from the entrance onto itself. This scattering map may be singular and discontinuous, but it will be measure preserving as a…

chao-dyn · Physics 2015-06-24 Alfredo M. Ozorio de Almeida , Raul O. Vallejos

Bound and scattering states of a non-central extension of the three-dimensional Kepler-Coulomb Hamiltonian are worked out analytically within the framework of the potential groups of the problem, SO(7) for bound states and SO(6,1) for…

Mathematical Physics · Physics 2015-05-18 Gul-Mirza Kerimov , Alberto Ventura

We prove that every properly edge-colored $n$-vertex graph with average degree at least $100(\log n)^2$ contains a rainbow cycle, improving upon $(\log n)^{2+o(1)}$ bound due to Tomon. We also prove that every properly colored $n$-vertex…

Combinatorics · Mathematics 2022-11-08 Jaehoon Kim , Joonkyung Lee , Hong Liu , Tuan Tran

The Hamiltonian theory of zero-curvature equations with spectral parameter on an arbitrary compact Riemann surface is constructed. It is shown that the equations can be seen as commuting flows of an infinite-dimensional field generalization…

High Energy Physics - Theory · Physics 2009-11-07 Igor Krichever

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…

Statistics Theory · Mathematics 2014-02-04 V. Cekanavicius , P. Vellaisamy

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.…

Quantum Physics · Physics 2010-05-20 L. Jin , Z. Song