Network information theory and statistical mechanics (especially percolation theory)

course: Random directed spanning trees

speaker: Rahul Roy (Indian Statistical Institute)

abstract: We study a random directed spanning trees. Here we show that depending on the dimension of the underlying space, the graph is either one connnected tree or a forest of trees. The tools needed for the study of these geometric properties random walks and percolation theory.

<< Go back