English
Related papers

Related papers: Multi-way expanders and imprimitive group actions …

200 papers

In this paper, we consider a relation between $k$-way expansion constant of a finite graph and the expansion constants of subgraphs in a $k$-partition of the graph. Using this relation, we show that a sequence of finite graphs which have…

Combinatorics · Mathematics 2013-06-06 Mamoru Tanaka

Hypergraph expanders are hypergraphs with surprising, non-intuitive expansion properties. In a recent paper, the first author gave a simple construction, which can be randomized, of $3$-uniform hypergraph expanders with polylogarithmic…

Combinatorics · Mathematics 2020-07-27 David Conlon , Jonathan Tidor , Yufei Zhao

The Cayley graphs of finite groups are known to provide several examples of families of expanders, and some of them are Ramanujan graphs. Babai studied isospectral non-isomorphic Cayley graphs of the dihedral groups. Lubotzky, Samuels and…

Combinatorics · Mathematics 2022-02-09 Arindam Biswas , Jyoti Prakash Saha

In this paper we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the $n$th mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set…

Combinatorics · Mathematics 2015-02-03 Amir Daneshgar , Hossein Hajiabolhassan , Ramin Javadi

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 establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…

Combinatorics · Mathematics 2009-10-19 Julia Böttcher , Klaas P. Pruessmann , Anusch Taraz , Andreas Würfl

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

We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…

Spectral Theory · Mathematics 2014-10-14 Shiping Liu

The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective…

Combinatorics · Mathematics 2014-04-25 Geoffrey R. Grimmett , Zhongyang Li

The idea of applying isoperimetric functions to group theory is due to M.Gromov. We introduce the concept of a ``bicombing of narrow shape'' which generalizes the usual notion of bicombing. Our bicombing is related to but different from the…

Group Theory · Mathematics 2008-02-03 Guenther Huck , Stephan Rosebrock

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

Group Theory · Mathematics 2007-05-23 Marc Lackenby

We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…

Group Theory · Mathematics 2025-05-27 Valeriy G. Bardakov , Tatyana A. Kozlovskaya , Matvei N. Zonov

We define a way of approximating actions on measure spaces using finite graphs; we then show that in quite general settings these graphs form a family of expanders if and only if the action is expanding in measure. This provides a somewhat…

Geometric Topology · Mathematics 2021-01-13 Federico Vigolo

We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph…

Combinatorics · Mathematics 2012-11-13 Endre Csoka , Gabor Lippner

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Combinatorics · Mathematics 2020-07-21 Hendrik Heine

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

We introduce the extension graph of graph product of groups and study its geometry. This enables us to study properties of graph product by exploiting large scale geometry of its defining graph. In particular, we show that the extension…

Group Theory · Mathematics 2026-03-17 Koichi Oyakawa

Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…

Combinatorics · Mathematics 2014-10-28 Tali Kaufman , David Kazhdan , Alexander Lubotzky

In this paper, we study new Cayley graphs over the additive group of Galois rings. First we prove that they are expander graphs by using a Weil-Carlitz-Uchiyama type estimation of character sums for Galois rings. We also show that Cayley…

Combinatorics · Mathematics 2019-03-05 Shohei Satake

In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley…

Probability · Mathematics 2018-04-24 Itai Benjamini , Siu-On Chan , Ryan O'Donnell , Omer Tamuz , Li-Yang Tan
‹ Prev 1 2 3 10 Next ›