# AN INTRODUCTION TO EXPANDER GRAPHS

@inproceedings{Nielsen2005ANIT, title={AN INTRODUCTION TO EXPANDER GRAPHS}, author={Michael A. Nielsen}, year={2005} }

We will begin by discussing some of the basic facts about graph theory in view towards understanding this thesis. We then will derive bounds on the spectrum of a k-regular graph, and understand the relation between the spectrum, and the bipartiteness and connectivity of such a graph. Following a brief introduction to group actions on graphs, we will establish that all Cayley graphs are vertex-transitive.We will then introduce Ramanujan Graphs, and establish that the undirected n-cycle is…

## 25 Citations

Parameterized (Modular) Counting and Cayley Graph Expanders

- Mathematics, Computer ScienceMFCS
- 2021

The main result is an exhaustive and fine-grained complexity classification of #EdgeSub(Φ) for minor-closed properties Φ, closing the missing gap in previous work by Roth, Schmitt and Wellnitz (ICALP 21).

Horospherical random graphs

- Mathematics, Computer Science
- 2021

A model of random graphs is given and it is shown that completely closing medium and long distance travel to slow down the spread of a random walk is more efficient than than local restrictions.

On the Spectral Gap and the Diameter of Cayley Graphs

- MathematicsProceedings of the Steklov Institute of Mathematics
- 2021

We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs,…

Factor-of-iid balanced orientation of non-amenable graphs

- Mathematics
- 2021

We show that if a non-amenable, quasi-transitive, unimodular graph G has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal inand outdegree. This result…

Finding Structure in Sequences of Real Numbers via Graph Theory: a Problem List

- Mathematics
- 2020

We investigate a method of generating a graph $G=(V,E)$ out of an ordered list of $n$ distinct real numbers $a_1, \dots, a_n$. These graphs can be used to test for the presence of interesting…

Unlikely Intersections with ExCM curves in A2

- MathematicsANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE
- 2021

The Zilber--Pink conjecture predicts that an algebraic curve in A2 has only finitely many intersections with the special curves, unless it is contained in a proper special subvariety. Under a large…

Toward super‐approximation in positive characteristic

- MathematicsJournal of the London Mathematical Society
- 2022

In this note, we show that the family of Cayley graphs of a finitely generated subgroup of GLn0(Fp(t))$\operatorname{GL}_{n_0}(\mathbb {F}_p(t))$ modulo some admissible square‐free polynomials is a…

Origami expanders

- Mathematics
- 2021

We construct a new type of expanders, from measure-preserving affine actions with spectral gap on origami surfaces, in each genus g > 1. These actions are the first examples of actions with spectral…

UNIFORM RESONANCE FREE REGIONS FOR CONVEX COCOMPACT HYPERBOLIC SURFACES AND EXPANDERS

- Mathematics
- 2021

Let X = Γ\H be a convex cocompact hyperbolic surface, let Xn = Γn\H 2 be a family of finite regular covers of X, and let Gn be the associated family of Cayley graphs of the covering groups Gn = Γ/Γn…

A Class of Real Expander Codes Based on Projective- Geometrically Constructed Ramanujan Graphs

- Computer Science
- 2011

Novel real cycle codes based on expander graphs based on Ramanujan graphs constructed using incidence matrices of the appropriate projective-geometric objects are proposed and guaranteed to correct three erasures.

## References

SHOWING 1-5 OF 5 REFERENCES

Ramanujan Graphs

- Mathematics
- 1965

In the last two decades, the theory of Ramanujan graphs has gained prominence primarily for two reasons. First, from a practical viewpoint, these graphs resolve an extremal problem in communication…

Algebraic Graph Theory

- MathematicsGraduate texts in mathematics
- 2001

The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.

Graphs and Matrices

- Mathematics
- 1999

In order to store a graph or digraph in a computer, we need something other than the diagram or the formal definition. This something is the adjacency matrix, a matrix of O’s and l’s. The l’s…

Algebraic graph theory, volume 207 of Graduate Texts in Mathematics

- 2001

Algebraic graph theory. Cambridge Mathematical Library

- 1993