English
Related papers

Related papers: Heat kernels are not uniform expanders

200 papers

In this paper, we prove two-sided heat kernel estimates on what we call "book-like" graphs. These are graphs consisting of pieces that satisfy the parabolic Harnack inequality that are glued together in a sufficiently nice way over a…

Probability · Mathematics 2026-03-06 Emily Dautenhahn , Laurent Saloff-Coste

The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…

Combinatorics · Mathematics 2025-04-29 Uriya A. First , Tali Kaufman

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…

Probability · Mathematics 2018-02-13 Bhaswar B. Bhattacharya , Persi Diaconis , Sumit Mukherjee

In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in the design of wireless networks, we study the computational…

Computational Complexity · Computer Science 2022-04-13 Pierre Bergé , Anthony Busson , Carl Feghali , Rémi Watrigant

Motivated by the renormalization method in statistical physics, Itai Benjamini defined a finitely generated infinite group G to be scale-invariant if there is a nested sequence of finite index subgroups G_n that are all isomorphic to G and…

Group Theory · Mathematics 2012-08-23 Volodymyr Nekrashevych , Gábor Pete

Benjamini and Papasoglou (2011) showed that planar graphs with uniform polynomial volume growth admit $1$-dimensional annular separators: The vertices at graph distance $R$ from any vertex can be separated from those at distance $2R$ by…

Combinatorics · Mathematics 2021-07-22 Farzam Ebrahimnejad , James R. Lee

We prove the monotonic normalized heat diffusion property on distance-regular graphs with classical parameters of diameter $3$. Regev and Shinkar found a Cayley graph for which this property fails. On the other hand, this property has been…

Combinatorics · Mathematics 2025-08-26 Shiping Liu , Heng Zhang

We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…

Mathematical Physics · Physics 2021-02-09 Nalini Anantharaman , Maxime Ingremeau , Mostafa Sabri , Brian Winn

This paper presents a detailed analysis of the heat kernel on an $(\mathbb{N}\times\mathbb{N})$-parameter family of compact metric measure spaces, which do not satisfy the volume doubling property. In particular, uniform bounds of the heat…

Probability · Mathematics 2020-03-06 Patricia Alonso Ruiz

Settling Kahn's conjecture (2001), we prove the following upper bound on the number $i(G)$ of independent sets in a graph $G$ without isolated vertices: \[ i(G) \le \prod_{uv \in E(G)} i(K_{d_u,d_v})^{1/(d_u d_v)}, \] where $d_u$ is the…

Combinatorics · Mathematics 2019-08-19 Ashwin Sah , Mehtaab Sawhney , David Stoner , Yufei Zhao

For a Banach space $X$, we show that any family of graphs quasi-isometric to levels of a warped cone $\mathcal O_\Gamma Y$ is an expander with respect to $X$ if and only if the induced $\Gamma$-representation on $L^2(Y;X)$ has a spectral…

Metric Geometry · Mathematics 2021-04-21 Damian Sawicki

In this paper, we use geometric tools to study the structure of asymptotic expanders and show that a sequence of asymptotic expanders always admits a "uniform exhaustion by expanders". It follows that asymptotic expanders cannot be coarsely…

Metric Geometry · Mathematics 2021-10-06 Ana Khukhro , Kang Li , Federico Vigolo , Jiawen Zhang

In this paper, we prove that the L^2 Betti numbers of an amenable covering space can be approximated by the average Betti numbers of a regular exhaustion, under some hypotheses. We also prove that some L^2 spectral invariants can be…

dg-ga · Mathematics 2008-02-03 Jozef Dodziuk , Varghese Mathai

In this paper, first we consider the uniform complex time heat kernel estimates of $e^{-z(-\Delta)^{\frac{\alpha}{2}}}$ for $\alpha>0, z\in \mathbb{C}^+$. When $\frac{\alpha}{2}$ is not an integer, generally the heat kernel doest not have…

Classical Analysis and ODEs · Mathematics 2022-09-28 Shiliang Zhao , Quan Zheng

We introduce the first graph kernels for metric graphs via tropical algebraic geometry. In contrast to conventional graph kernels based on graph combinatorics such as nodes, edges, and subgraphs, our metric graph kernels are purely based on…

Machine Learning · Computer Science 2026-01-30 Yueqi Cao , Anthea Monod

We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…

Group Theory · Mathematics 2007-05-23 Martin Kassabov

The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…

Mathematical Physics · Physics 2017-11-16 Pavel Exner , Ondřej Turek

We prove that bounded-degree expanders with non-negative Ollivier-Ricci curvature do not exist, thereby solving a long-standing open problem suggested by Naor and Milman and publicized by Ollivier (2010). In fact, this remains true even if…

Probability · Mathematics 2021-02-02 Justin Salez

In this work, we establish the uniform heat kernel asymptotics as well as sharp bounds for its derivatives on the free step-two Carnot group with $3$ generators. As a by-product, on this highly non-trivial toy model, we completely solve the…

Analysis of PDEs · Mathematics 2023-12-27 Hong-Quan Li , Sheng-Chen Mao , Ye Zhang

Given an underlying undirected simple graph, we consider the set of all acyclic orientations of its edges. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear…

Combinatorics · Mathematics 2015-02-17 Benjamin Iriarte Giraldo