COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Random walks on decorated Galton-Watson treesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Perla Sousi. Random trees are the building blocks for a range of probabilistic structures, including percolation clusters on the lattice and a range of statistical physics models on random planar maps. In this talk we consider a random walk on a critical “decorated” Galton-Watson tree, by which we mean that we first sample a critical Galton-Watson tree T, replace each vertex of degree n with an independent copy of a graph G(n), and then glue these inserted graphs along the tree structure of T. We will determine the random walk exponents for this decorated tree model in terms of the exponents for the underlying tree and the exponents for the inserted graphs. We will see that the model undergoes several phase transitions depending on how these exponents balance out. This talk is part of the Probability series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsmp3 , net worth , banks ussd Climate Histories Interdisciplinary Seminar Series Martin Centre Research Seminars: 51st SeriesOther talksThe Unexpected Side of Entropy A Better Future through Art - A talk by Hilary Cox Condron Renaissance eugenics Therapies for hereditary retinal diseases Designing brighter dyes for advanced fluorescence microscopy Finite element modelling of hot compression testing of titanium alloys |