English
Related papers

Related papers: Heat kernels are not uniform expanders

200 papers

We prove non-amenability of the product replacement graphs \Gamma_n(G) for uniformly non-amenable groups. We also prove it for Z-large groups, when n is sufficiently large. It follows that \Gamma_n(G) is non-amenable when n is sufficiently…

Group Theory · Mathematics 2013-05-13 Anton Malyshev

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite…

Geometric Topology · Mathematics 2015-11-11 Javier Aramayona , Ariadna Fossas , Hugo Parlier

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…

Logic · Mathematics 2007-05-23 Jaroslav Nešetřil , Saharon Shelah

We construct explicit generating sets S_n and \tilde S_n of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), S_n) and C(Sym(n), \tilde S_n) into a family of bounded degree expanders for all n. This…

Group Theory · Mathematics 2007-05-23 Martin Kassabov

We introduce a class of non-commutative Heisenberg like infinite dimensional Lie groups based on an abstract Wiener space. The Ricci curvature tensor for these groups is computed and shown to be bounded. Brownian motion and the…

Probability · Mathematics 2008-05-13 Bruce Driver , Maria Gordina

We define a broad class of graphs that generalize the Gordian graph of knots. These knot graphs take into account unknotting operations, the concordance relation, and equivalence relations generated by knot invariants. We prove that…

Geometric Topology · Mathematics 2021-11-24 Stanislav Jabuka , Beibei Liu , Allison H. Moore

We use the combination of ideas and results from the theory of graph limits and nonlinear evolution equations to provide a rigorous mathematical justification for taking continuum limit for certain nonlocally coupled networks and to extend…

Adaptation and Self-Organizing Systems · Physics 2013-11-25 Georgi S. Medvedev

We prove large-time Gaussian upper bounds for continuous-time heat kernels of Laplacians on graphs with unbounded geometry. Our estimates hold for centers of large balls satisfying a Sobolev inequality and volume doubling. Distances are…

Analysis of PDEs · Mathematics 2022-12-27 Matthias Keller , Christian Rose

We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong…

Spectral Theory · Mathematics 2026-02-11 Charles Bordenave , Cyril Letrouit , Mostafa Sabri

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs,…

Combinatorics · Mathematics 2021-09-30 Aida Abiad , Wouter Castryck , Maarten De Boeck , Jack H. Koolen , Sjanne Zeijlemaker

We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish…

Group Theory · Mathematics 2021-08-06 Tobias Rossmann , Christopher Voll

We study regular coverings of graphs and manifolds with a focus on properties of the heat equation. In particular, we look at stochastic incompleteness, the Feller property and uniform transience; and investigate the connection between the…

Functional Analysis · Mathematics 2018-02-21 Bobo Hua , Florentin Münch , Radosław K. Wojciechowski

We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…

Probability · Mathematics 2022-03-07 Zhongyang Li

We prove genuinely sharp two-sided global estimates for heat kernels on all compact rank-one symmetric spaces. This generalizes the authors' recent result obtained for a Euclidean sphere of arbitrary dimension. Furthermore, similar heat…

Classical Analysis and ODEs · Mathematics 2022-09-09 Adam Nowak , Peter Sjögren , Tomasz Z. Szarek

We say that a $d$-regular graph is a $\gamma$-expander if for every not too large set of vertices $S$, there are at least $\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\gamma$-far from bipartite if at least $\gamma e(G)$…

Combinatorics · Mathematics 2026-05-15 Domagoj Bradač , Oliver Janzer

Given a family of hypergraphs $\mathcal{H}$, we say that a hypergraph $\Gamma$ is $\mathcal{H}$-universal if it contains every $H \in \mathcal{H}$ as a subgraph. For $D, r \in \mathbb{N}$, we construct an $r$-uniform hypergraph with…

Combinatorics · Mathematics 2024-12-02 Rajko Nenadov

We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs…

Probability · Mathematics 2016-08-14 Adám Timár

We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…

Differential Geometry · Mathematics 2019-03-26 Shiping Liu , Florentin Münch , Norbert Peyerimhoff , Christian Rose

This paper studies the empirical measures of eigenvalues and singular values for random matrices drawn from the heat kernel measures on the unitary groups $\mathbb{U}_N$ and the general linear groups $\mathbb{GL}_N$, for $N\in\mathbb{N}$.…

Probability · Mathematics 2013-06-11 Todd Kemp

In this paper we determine all singular endomorphisms of the Hamming graph and other related graphs. The Hamming graph has vertices $\mathbb{Z}^{m}_n$ where two vertices are adjacent, if their Hamming distance is $1$. We show that its…

Combinatorics · Mathematics 2016-02-09 Artur Schaefer
‹ Prev 1 4 5 6 7 8 10 Next ›