Skip to main content Accessibility help
×
Home
Hostname: page-component-684899dbb8-7wlv9 Total loading time: 0.251 Render date: 2022-05-17T15:38:26.438Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

9 - Expanders and Ramanujan graphs

from Part III - Graphs and expanders

Published online by Cambridge University Press:  01 June 2018

Tullio Ceccherini-Silberstein
Affiliation:
Università degli Studi del Sannio, Italy
Fabio Scarabotti
Affiliation:
Università degli Studi di Roma 'La Sapienza', Italy
Filippo Tolli
Affiliation:
Università Roma Tre, Italy
Get access

Summary

This chapter is an introduction to the theory of expanders and Ramanujan graphs. It is based mainly on the exposition in the monograph by Davidoff- Sarnak-Valette [49] and the paper [74]. First of all, we present the basic theorems of Alon-Milman and Dodziuk, and of Alon-Boppana-Serre, on the isoperimetric constant and the spectral gap of a (finite, undirected, connected) regular graph, and their connections. We discuss a few examples with explicit computations showing optimality of the bounds given by the above theorems. Then we give the basic definitions of expanders and describe three fundamental constructions due to Margulis, Alon-Schwartz-Schapira (based on the replacement product, cf. Section 8.12), and Reingold-Vadhan-Wigderson [128] (based on the zig-zag product, cf. Section 8.13). In these constructions, the harmonic analysis on finite Abelian groups (cf. Chapter 2) and finite fields (cf. Chapter 6) we developed so far, plays a crucial role.

The original motivation for expander graphs was to build economical robust networks (e.g. for phones or computers): an expander with bounded valence is precisely an asymptotic robust graph with the number of edges growing linearly with size (number of vertices), for all subsets. Since their definition, expanders have found extensive applications in several branches of science and technology, for instance: in computer science, in designing algorithms, error correcting codes, extractors, pseudorandom generators, sorting networks (Ajtai, Komlos, and Szemerédi, [6]), robust computer networks (as in their initial motivation), and in cryptography (in order to construct hash functions: these are used in hash tables to quickly locate a data record given its search key). From a more theoretical viewpoint, they have also been used in proofs of many important results in computational complexity theory, such as SL = L (Reingold, [126]) and the PCP theorem (Dinur, [56]).

The Alon-Milman-Dodziuk theorem

In this section we present the discrete analogues, due to Dodziuk [57] and Alon-Milman [9], of the well-known Cheeger-Buser inequalities in Riemannian geometry (cf. [38] and [26, 27]).

Type
Chapter
Information
Discrete Harmonic Analysis
Representations, Number Theory, Expanders, and the Fourier Transform
, pp. 283 - 340
Publisher: Cambridge University Press
Print publication year: 2018

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×