English
Related papers

Related papers: Absolutely Continuous Spectra of Quantum Tree Grap…

200 papers

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

Combinatorics · Mathematics 2015-10-08 Xiao-Dong Zhang

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Probability · Mathematics 2007-05-23 Anna Rudas , Balint Toth , Benedek Valko

We consider the spectrum of the Fibonacci Hamiltonian for small values of the coupling constant. It is known that this set is a Cantor set of zero Lebesgue measure. Here we study the limit, as the value of the coupling constant approaches…

Spectral Theory · Mathematics 2015-05-18 David Damanik , Anton Gorodetski

Quantum walks have been shown to have impressive transport properties compared to classical random walks. However, imperfections in the quantum walk algorithm can destroy any quantum mechanical speed-up due to Anderson localization. We…

Quantum Physics · Physics 2013-05-30 Steven R. Jackson , Teng Jian Khoo , Frederick W. Strauch

In earlier work by den Hollander, K\"onig, and dos Santos, the asymptotics of the total mass of the solution to the parabolic Anderson model was studied on an almost surely infinite Galton-Watson tree with an i.i.d. potential having a…

Probability · Mathematics 2023-10-10 Daoyi Wang

We study the spectral implications of re-weighting a graph by the $\ell_\infty$-Lewis weights of its edges. Our main motivation is the ER-Minimization problem (Saberi et al., SIAM'08): Given an undirected graph $G$, the goal is to find…

Data Structures and Algorithms · Computer Science 2023-02-14 Amit Suliman , Omri Weinstein

The primary objective of this paper is to generalize the results of [arXiv:2111.03548] to the case of quasi-smooth Berkovich curves by establishing a connection between the spectrum and the radii of convergence. To achieve this, we…

Number Theory · Mathematics 2024-04-11 Tinhinane A. Azzouz

We show that for every $n$-vertex graph with at least one edge, its treewidth is greater than or equal to $n \lambda_{2} / (\Delta + \lambda_{2}) - 1$, where $\Delta$ and $\lambda_{2}$ are the maximum degree and the second smallest…

Combinatorics · Mathematics 2024-04-15 Tatsuya Gima , Tesshu Hanaka , Kohei Noro , Hirotaka Ono , Yota Otachi

We prove that, for an analytic family of ``weakly tame'' regular functions on an affine manifold, the spectrum at infinity of each function of the family is semicontinuous in the sense of Varchenko.

Algebraic Geometry · Mathematics 2011-01-04 Andras Nemethi , Claude Sabbah

A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated…

Combinatorics · Mathematics 2024-04-15 Manosij Ghosh Dastidar , Michael Wallner

Single-particle tracking offers detailed information about the motion of molecules in complex environments such as those encountered in live cells, but the interpretation of experimental data is challenging. One of the most powerful tools…

Statistical Mechanics · Physics 2022-01-12 Zachary R Fox , Eli Barkai , Diego Krapf

We consider perturbations of quasi-periodic Schr\"odinger operators on the integer lattice with analytic sampling functions by decaying potentials and seek decay conditions under which various spectral properties are preserved. In the…

Spectral Theory · Mathematics 2022-12-07 David Damanik , Xianzhe Li , Jiangong You , Qi Zhou

We are interested in various aspects of spectral rigidity of Cayley and Schreier graphs of finitely generated groups. For each pair of integers $d\geq 2$ and $m \ge 1$, we consider an uncountable family of groups of automorphisms of the…

Group Theory · Mathematics 2025-12-19 Rostislav Grigorchuk , Tatiana Nagnibeda , Aitor Pérez

We study how to establish $\textit{spectral independence}$, a key concept in sampling, without relying on total influence bounds, by applying an $\textit{approximate inverse}$ of the influence matrix. Our method gives constant upper bounds…

Data Structures and Algorithms · Computer Science 2024-04-09 Xiaoyu Chen , Xiongxin Yang , Yitong Yin , Xinyuan Zhang

This paper considers the asymptotic distribution of the longest edge of the minimal spanning tree and nearest neighbor graph on X_1,...,X_{N_n} where X_1,X_2,... are i.i.d. in \Re^2 with distribution F and N_n is independent of the X_i and…

Probability · Mathematics 2007-05-23 Tailen Hsing , Holger Rootzen

The subject of the paper are Schr\"odinger operators on tree graphs which are radial having the branching number $b_n$ at all the vertices at the distance $t_n$ from the root. We consider a family of coupling conditions at the vertices…

Mathematical Physics · Physics 2015-05-18 Pavel Exner , Jiri Lipovsky

The spectrum of an arbitrary self-adjoint extension of the minimal linear relation associated with the discrete symplectic system in the limit point case is completely characterized by using the limiting Weyl--Titchmarsh…

Spectral Theory · Mathematics 2024-12-24 Petr Zemánek

We study the spectral Tur\'an problem for trees. To avoid limiting our perspective to specific families of trees, we parametrize trees in terms of their unique bipartition. We say $T \in \mathcal{T}_{m,l+1}^{\delta}$ if $T$ is a tree of…

Combinatorics · Mathematics 2025-05-22 Dheer Noal Desai , Hemanshu Kaul , Bahareh Kudarzi

Four-particle tree-level scattering amplitudes in string theory are magically consistent with unitarity, reflected in the non-trivial fact that beneath the critical dimension, the residues of the amplitudes on massive poles can be expanded…

High Energy Physics - Theory · Physics 2022-03-14 Nima Arkani-Hamed , Lorenz Eberhardt , Yu-tin Huang , Sebastian Mizera

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Computational Complexity · Computer Science 2026-01-01 Alice Moayyedi