Statistics Seminars: Random sequential deposition onto trees and lattices
4 March 2005 14:00 in CM107
"Suppose G is a finite graph, and particles arrive at the vertices of G, in random order. A particle is accepted at a vertex if no particle has previously been accepted there or at any adjacent vertex; otherwise it is discarded. This is a model for chemical adsorption. Graphs of interest include trees and lattices. We describe some qualitative and quantitatitive results. "
Contact email@example.com for more information