An introduction to expander graphs
Par :Formats :
- Paiement en ligne :
- Livraison à domicile ou en point Mondial Relay entre le 24 juin et le 27 juinCet article sera commandé chez un fournisseur et vous sera envoyé 3 à 6 jours après la date de votre commande.
- Retrait Click and Collect en magasin gratuit
- Livraison à domicile ou en point Mondial Relay entre le 24 juin et le 27 juin
- Réservation en ligne avec paiement en magasin :
- Indisponible pour réserver et payer en magasin
- Nombre de pages276
- PrésentationRelié
- FormatGrand Format
- Poids0.75 kg
- Dimensions18,0 cm × 24,5 cm × 1,6 cm
- ISBN978-2-85629-898-5
- EAN9782856298985
- Date de parution01/04/2019
- CollectionCollection SMF. Cours spéciali
- ÉditeurSociété Mathématique de France
Résumé
Expander graphs are families of finite graphs that are simultaneously relatively sparse and highly connected. Since their discovery in the fates 1960s, they have appeared in many seemingly unrelated areas of mathematics, from theoretical computer science to arithmetic and algebraic geometry, from representation theory to number theory. The goal of this book is to present the theory of expander graphs and to explore some of these rich connections.
Besides a careful exposition of the basic parts of the theory, including the Cheeger constant, random walks and spectral gap characterizations of expander graphs, it contains many different constructions of various families of expander graphs. The applications that are surveyed in the last chapter try to communicate the remarkable reach of expander graphs in the modern mathematics.
Besides a careful exposition of the basic parts of the theory, including the Cheeger constant, random walks and spectral gap characterizations of expander graphs, it contains many different constructions of various families of expander graphs. The applications that are surveyed in the last chapter try to communicate the remarkable reach of expander graphs in the modern mathematics.
Expander graphs are families of finite graphs that are simultaneously relatively sparse and highly connected. Since their discovery in the fates 1960s, they have appeared in many seemingly unrelated areas of mathematics, from theoretical computer science to arithmetic and algebraic geometry, from representation theory to number theory. The goal of this book is to present the theory of expander graphs and to explore some of these rich connections.
Besides a careful exposition of the basic parts of the theory, including the Cheeger constant, random walks and spectral gap characterizations of expander graphs, it contains many different constructions of various families of expander graphs. The applications that are surveyed in the last chapter try to communicate the remarkable reach of expander graphs in the modern mathematics.
Besides a careful exposition of the basic parts of the theory, including the Cheeger constant, random walks and spectral gap characterizations of expander graphs, it contains many different constructions of various families of expander graphs. The applications that are surveyed in the last chapter try to communicate the remarkable reach of expander graphs in the modern mathematics.
