UW Combinatorics Talk
Title: Coverage and percolation in random geometric graphs
Western Washington University
April 4, 4:00pm
refreshments at 3:30pm
Pre-Seminar at 2:30pm in Padelford C-401
For classical random graphs, the vertex set is fixed and finite, and the edges are inserted randomly. For random geometric graphs, the vertices are randomly located in space, and the edges are then inserted using some deterministic rule. A simple example is the Gilbert model, in which two vertices are joined if they lie within distance r of each other. For many such graphs, there is also a related coverage process: for instance, corresponding to the Gilbert model, we place a solid ball of radius r/2 around each randomly placed vertex. I'll discuss some recent results on such coverage processes, and on percolation in the underlying random graphs.
This is joint work with Paul Balister, Bela Bollobas, Martin Haenggi and Mark Walters.
Speaker's Contact Info:
Return to seminar home page
Page loaded on March 30, 2012 at 04:59 PM.
Copyright © 1998-99, Sara C. Billey.
All rights reserved.