__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2011 Claremont Center for the Mathematical Sciences

When

Start: 12/07/2015 - 4:15pm

End : 12/07/2015 - 5:15pm

End : 12/07/2015 - 5:15pm

Category

Applied Math Seminar

Speaker

Angelica Gonzalez (University of Arizona)

Abstract

Thinking of a graph as a network, the expansion constant measures how efficient a graph is

with respect to optimization of cost, connectivity, and robustness. The expansion constant of a graph

measures the sparsity (in terms of the number of edges, relative to the number of vertices) while still

maintaining connectivity of a graph. In this talk we explore the notion of the expansion constant of

a graph and it's relationship to the spectrum of the adjacency matrix of a graph. This will lead to

a discussion of how some geometric and probabilistic techniques are useful in the study of expansion.

We will conclude by investigating some of these notions for a specific class of 3-regular graphs.

Where

Emmy Noether Room, Millikan 1021, Pomona College