The original motivation for finding expander families was to build economical robust networks for telephone and computer communication. Over the past three decades, expander families have been developed into a powerful tool with wide applications in many areas such as fast distributed routing algorithms, storage schemes, telecommunication, and cryptography. This thesis focuses on the theoretical aspects of expander families. The primary goal is to apply spectral graph theory to show the non-existence of an expander family within the class of circulant graphs. There are other proofs out there, but this is a fundamental approach. Another part of this thesis uses the adjacency matrix and its properties to prove Cheeger's inequalities and determine when the equalities hold.
"synopsis" may belong to another edition of this title.
I graduated from University of California-Davis with a BS in Mathematics and obtained an MS in Mathematics at San Jose State University. I'm currently teaching at College of San Mateo and San Jose City College in California, USA.
"About this title" may belong to another edition of this title.
Shipping:
US$ 26.20
From Germany to U.S.A.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The original motivation for finding expander families was to build economical robust networks for telephone and computer communication. Over the past three decades, expander families have been developed into a powerful tool with wide applications in many areas such as fast distributed routing algorithms, storage schemes, telecommunication, and cryptography. This thesis focuses on the theoretical aspects of expander families. The primary goal is to apply spectral graph theory to show the non-existence of an expander family within the class of circulant graphs. There are other proofs out there, but this is a fundamental approach. Another part of this thesis uses the adjacency matrix and its properties to prove Cheeger's inequalities and determine when the equalities hold. 76 pp. Englisch. Seller Inventory # 9783846590416
Quantity: 2 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The original motivation for finding expander families was to build economical robust networks for telephone and computer communication. Over the past three decades, expander families have been developed into a powerful tool with wide applications in many areas such as fast distributed routing algorithms, storage schemes, telecommunication, and cryptography. This thesis focuses on the theoretical aspects of expander families. The primary goal is to apply spectral graph theory to show the non-existence of an expander family within the class of circulant graphs. There are other proofs out there, but this is a fundamental approach. Another part of this thesis uses the adjacency matrix and its properties to prove Cheeger's inequalities and determine when the equalities hold. Seller Inventory # 9783846590416
Quantity: 1 available
Seller: moluna, Greven, Germany
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Nguyen Vinh KhaI graduated from University of California-Davis with a BS in Mathematics and obtained an MS in Mathematics at San Jose State University. I m currently teaching at College of San Mateo and San Jose City College in Calif. Seller Inventory # 5501693
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 76 pages. 8.66x0.18x5.91 inches. In Stock. Seller Inventory # __384659041X
Quantity: 1 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 76 pages. 8.66x0.18x5.91 inches. In Stock. Seller Inventory # 384659041X
Quantity: 1 available
Seller: dsmbooks, Liverpool, United Kingdom
paperback. Condition: New. New. book. Seller Inventory # D8S0-3-M-384659041X-6
Quantity: 1 available