We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over Zt2 and have vertex degree which is polylogarithmic in the number of vertices. Their expansion properties, which are derived from the underlying Cayley graphs, include analogues of vertex and edge expansion in graphs, rapid mixing of the random walk on the edges of the skeleton graph, uniform distribution of edges on large vertex subsets and the geometric overlap property
Abstract. This paper gives a new way of showing that certain constant degree graphs are graph expand...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
© 2020 The Authors. The publishing rights in this article are licensed to the London Mathematical So...
Hypergraph expanders are hypergraphs with surprising, non‐intuitive expansion properties. In a recen...
Hypergraph expanders are hypergraphs with surprising, non‐intuitive expansion properties. In a recen...
We prove a general large sieve statement in the context of random walks on subgraphs of a given grap...
We prove that Cayley graphs of SL2(Fp) are expanders with respect to the projection of any fixed ele...
International audienceWe prove a general large sieve statement in the context of random walks on sub...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
Expander graphs have been studied in various definitions and approaches. We show some relationships ...
Expander graphs have been studied in various definitions and approaches. We show some relationships ...
Abstract. This paper gives a new way of showing that certain constant degree graphs are graph expand...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraph...
© 2020 The Authors. The publishing rights in this article are licensed to the London Mathematical So...
Hypergraph expanders are hypergraphs with surprising, non‐intuitive expansion properties. In a recen...
Hypergraph expanders are hypergraphs with surprising, non‐intuitive expansion properties. In a recen...
We prove a general large sieve statement in the context of random walks on subgraphs of a given grap...
We prove that Cayley graphs of SL2(Fp) are expanders with respect to the projection of any fixed ele...
International audienceWe prove a general large sieve statement in the context of random walks on sub...
This research paper was completed and submitted at Nipissing University, and is made freely accessib...
Expander graphs have been studied in various definitions and approaches. We show some relationships ...
Expander graphs have been studied in various definitions and approaches. We show some relationships ...
Abstract. This paper gives a new way of showing that certain constant degree graphs are graph expand...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...