Event Type:

Probability Seminar

Date/Time:

Tuesday, April 18, 2017 - 16:00 to 17:00

Location:

GILK 100

Local Speaker:

Abstract:

We devise a method of finding the limiting mean length of a minimal spanning tree for a random graph via the Smoluchowski coagulation equations for the corresponding coalescent process. In particular, we use this approach for finding the limiting mean length of a minimal spanning tree for the Erdos-Renyi random graph on an asymmetric bipartite graph, producing a completely new formula yet consistent with the previously known formula for the symmetric bipartite graph.

Joint work with Peter T. Otto of Willamette University and Anatoly Yambartsev of University of São Paulo.