Preprint
Preprints and early-stage research may not have been peer reviewed yet.
To read the file of this research, you can request a copy directly from the authors.

Abstract

Let G=(V,E) be a finite graph. For vVv\in V we denote by GvG_v the subgraph of G that is induced by v's neighbor set. We say that G is (a,b)-regular for a>b>0a>b>0 integers, if G is a-regular and GvG_v is b-regular for every vVv\in V. Recent advances in PCP theory call for the construction of infinitely many (a,b)-regular expander graphs G that are expanders also locally. Namely, all the graphs {GvvV}\{G_v|v\in V\} should be expanders as well. While random regular graphs are expanders with high probability, they almost surely fail to expand locally. Here we construct two families of (a,b)-regular graphs that expand both locally and globally. We also analyze the possible local and global spectral gaps of (a,b)-regular graphs. In addition, we examine our constructions vis-a-vis properties which are considered characteristic of high-dimensional expanders.

No file available

Request Full-text Paper PDF

To read the file of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
We prove vanishing of cohomology with coefficients in representations on a large class of Banach space for a group acting ``nicely'' on a simplicial complexes based on spectral properties of the 1-dimensional links of the simplicial complex.
Article
Full-text available
Article
Full-text available
We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs (constructed in [LPS]). They are obtained as quotients of the buildings of typeà d−1 associated with PGL d (F) whereF is a local field of positive characteristic.
Article
Full-text available
We compute the mixing rate of a non-backtracking random walk on a regular expander. Using some properties of Chebyshev polynomials of the second kind, we show that this rate may be up to twice as fast as the mixing rate of the simple random walk. The closer the expander is to a Ramanujan graph, the higher the ratio between the above two mixing rates is. As an application, we show that if G is a high-girth regular expander on n vertices, then a typical non-backtracking random walk of length n on G does not visit a vertex more than (1+o(1))lognloglogn(1+o(1))\frac{\log n}{\log\log n} times, and this result is tight. In this sense, the multi-set of visited vertices is analogous to the result of throwing n balls to n bins uniformly, in contrast to the simple random walk on G, which almost surely visits some vertex Ω(logn)\Omega(\log n) times.
Article
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on an analysis of the expected characteristic polynomial of a union of random perfect matchings and involves three ingredients: (1) a formula for the expected characteristic polynomial of the sum of a regular graph with a random permutation of another regular graph, (2) a proof that this expected polynomial is real-rooted and that the family of polynomials considered in this sum is an interlacing family, and (3) strong bounds on the roots of the expected characteristic polynomial of a union of random perfect matchings, established using the framework of finite free convolutions introduced recently by the authors. Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
Article
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 Z2t\mathbb{Z}_2^t 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.
Conference Paper
In recent years a high dimensional theory of expanders has emerged. The notion of combinatorial expansion of graphs (i.e. the Cheeger constant of a graph) has seen two generalizations to high dimensional simplicial complexes. One generalization, known as coboundary expansion, is due to Linial and Meshulem; the other, which we term here cosystolic expansion, is due to Gromov, who showed that cosystolic expanders have the topological overlapping property. No construction (either random or explicit) of bounded degree combinational expanders (according to either definition) were known until a recent work of Kaufman, Kazhdan and Lubotzky, which provided the first bounded degree cosystolic expanders of dimension two. No bounded degree combinatorial expanders are known in higher dimensions. In this work we present explicit bounded degree cosystolic expanders of every dimension. This solves affirmatively an open question raised by Gromov, who asked whether there exist bounded degree complexes with the topological overlapping property in every dimension. Moreover, we provide a local to global criterion on a complex that implies cosystolic expansion: Namely, for a d-dimensional complex, X, if its underlying graph is a good expander, and all its links are both coboundary expanders and good expander graphs, then the (d-1)-dimensional skeleton of the complex is a cosystolic expander.
Article
Random walks on expander graphs have been extensively studied. We define a high order {\em combinatorial random walk} on high dimensional simplicial complexes. This walk moves at random between neighboring i-dimensional faces (e.g. edges) of the complex, where two i-dimensional faces are considered neighbors if they share a common (i+1)-dimensional face (e.g. a triangle). We prove that if the links of the complex are good spectral expanders, then the high order combinatorial random walk converges quickly. We derive our result about the convergence of the high order random walk by defining a new notion of high dimensional combinatorial expansion of a complex, which we term {\em colorful expansion}. We show that spectral expansion of the links of the complex imply colorful expansion of the complex, which in turn implies fast convergence of the high order random walk. We further show the existence of bounded degree high dimensional simplicial complexes which satisfy our criterion, and thus form an {\em explicit} family of high dimensional simplicial complexes in which the high order random walk converges rapidly. Our high order combinatorial random walk is different than the high order topological random walk that has recently been defined in \cite{PR}. The topological random walk is associated with the concentration of the spectrum of the high order laplacian on the space that is {\em orthogonal to the coboundaries}, while we, in a sense, need to argue about the concentration of the spectrum on the space that is orthogonal to the constant functions, which is a much larger space.
Article
This is an expository paper on Garland’s vanishing theorem specialized to the case when the linear algebraic group is SLn\mathrm {SL}_n. Garland’s theorem can be stated as a vanishing of cohomology groups of certain finite simplicial complexes. The method of the proof is quite interesting on its own. It relates the vanishing of cohomology to the assertion that the minimal positive eigenvalue of a certain combinatorial Laplacian is sufficiently large. Since the 1970s, this idea has found applications in a variety of problems in representation theory, group theory, and combinatorics, so the paper might be of interest to a wide audience. The paper is intended for non-specialists and graduate students.
Article
Probabilistically checkable proofs are proofs that can checked probabilistically by reading very few bits of the proof. In the early 1990's, it was shown that proofs could be transformed into probabilistically checkable ones with only a modest increase in their size. The initial transformations, though elementary, were a little too complex. A recent work due to Irit Dinur gives a dramatically simple (and radically new) con- struction of probabilistically checkable proofs. This article explains the notion of a probabilistically checkable proof, presents the formal definition and then introduces the reader to Dinur's work along with some of the context.
Article
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three ingredients: (1) a formula for the expected characteristic polynomial of the sum of a regular graph with a random permutation of another regular graph, (2) a proof that this expected polynomial is real rooted and that the family of polynomials considered in this sum is an interlacing family, and (3) strong bounds on the roots of the expected characteristic polynomial of a union of random perfect matchings, established using the framework of finite free convolutions we recently introduced.
Article
It is well known that the smallest eigenvalue of the adjacency matrix of a connected d-regular graph is at least − d and is strictly greater than − d if the graph is not bipartite. More generally, for any connected graph G = (V, E), consider the matrix Q = D + A where D is the diagonal matrix of degrees in the graph G and A is the adjacency matrix of G. Then Q is positive semidefinite, and the smallest eigenvalue of Q is 0 if and only if G is bipartite. We will study the separation of this eigenvalue from 0 in terms of the following measure of nonbipartiteness of G. For any S ⊆ V, we denote by emin(S) the minimum number of edges that need to be removed from the induced subgraph on S to make it bipartite. Also, we denote by cut(S) the set of edges with one end in S and the other in V − S. We define the parameter Ψ as. The parameter Ψ is a measure of the nonbipartiteness of the graph G. We will show that the smallest eigenvalue of Q is bounded above and below by functions of Ψ. For d-regular graphs, this characterizes the separation of the smallest eigenvalue of the adjacency matrix from −d. These results can be easily extended to weighted graphs.
Article
An equivelar polyhedral 2-manifold in the class ℳp,q is one embedded inE 3 in which every face is a convexp-gon and every vertex isq-valent. In this paper, examples are constructed, to show that each of the classes ℳ3,q (q≧7), ℳ4,q (q≧5) and ℳp,4 (p≧5) contains infinitely many distinct combinatorial types. As particular examples, there are polyhedral 2-manifolds with 576 vertices and genus 577, and with 4096 faces and genus 4097. A modification of one construction shows that there is a constantk, such that for eachg≧2, there exists a closed polyhedral 2-manifold inE 3 of genusg with at mostkg/logg vertices.
Article
Let G be a k-regular graph, , with girth g. We prove that every embedding has distortion . Two proofs are given, one based on Markov type [B] and the other on quadratic programming. In the core of both proofs are some Poincaré-type inequalities on graph metrics.
Article
An equivelar polyhedral 2-manifold in the classM p,q is one embedded inE 3 in which every face is a convexp-gon and every vertex isq-valent. Various constructions for equivelar manifolds are described, and it is shown that, in certain classesM p,q, there is a manifold of given genusg≧2 for all but finitely manyg.
Article
Lower bounds on the subdominant eigenvalue of regular graphs of given girth are derived. Our approach is to approximate the discrete spectrum of a finite regular graph by the continuous spectrum of an infinite regular tree. We interpret these spectra as probability distributions and the girth condition as equalities between the moments of these distributions. Then the associated orthogonal polynomials coincide up to a degree equal to half the girth, and their extremal zeroes provide bounds on the supports of these distributions.
Article
We give a simpler proof of the result of Boros and Füredi that for any finite set of points in the plane in general position there is a point lying in 2/9 ofallthe triangles determined by these points.
Conlon's construction of hypergraph expanders
  • M Chapman
M. Chapman, Conlon's construction of hypergraph expanders. Available at https://cs.huji.ac.il/~michaelchapman/Lecture_11-6-18_HDE.pdf.
  • H Garland
H. Garland, p-adic curvature and the cohomology of discrete subgroups of p-adic groups, Annals of Mathematics 97 (1973), no. 3, 375-423.