Probability and Real Trees [electronic resource] : École d'Été de Probabilités de Saint-Flour XXXV - 2005 / by Steven Neil Evans.

By: Evans, Steven Neil [author.]Contributor(s): SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Mathematics ; 1920Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Description: XI, 201 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540747987Subject(s): Mathematics | Combinatorics | Geometry | Distribution (Probability theory) | Mathematics | Probability Theory and Stochastic Processes | Combinatorics | GeometryAdditional physical formats: Printed edition:: No titleDDC classification: 519.2 LOC classification: QA273.A1-274.9QA274-274.9Online resources: Click here to access online
Contents:
Around the Continuum Random Tree -- R-Trees and 0-Hyperbolic Spaces -- Hausdorff and Gromov–Hausdorff Distance -- Root Growth with Re-Grafting -- The Wild Chain and other Bipartite Chains -- Diffusions on a R-Tree without Leaves: Snakes and Spiders -- R–Trees from Coalescing Particle Systems -- Subtree Prune and Re-Graft.
In: Springer eBooksSummary: Random trees and tree-valued stochastic processes are of particular importance in combinatorics, computer science, phylogenetics, and mathematical population genetics. Using the framework of abstract "tree-like" metric spaces (so-called real trees) and ideas from metric geometry such as the Gromov-Hausdorff distance, Evans and his collaborators have recently pioneered an approach to studying the asymptotic behaviour of such objects when the number of vertices goes to infinity. These notes survey the relevant mathematical background and present some selected applications of the theory.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK1876

Around the Continuum Random Tree -- R-Trees and 0-Hyperbolic Spaces -- Hausdorff and Gromov–Hausdorff Distance -- Root Growth with Re-Grafting -- The Wild Chain and other Bipartite Chains -- Diffusions on a R-Tree without Leaves: Snakes and Spiders -- R–Trees from Coalescing Particle Systems -- Subtree Prune and Re-Graft.

Random trees and tree-valued stochastic processes are of particular importance in combinatorics, computer science, phylogenetics, and mathematical population genetics. Using the framework of abstract "tree-like" metric spaces (so-called real trees) and ideas from metric geometry such as the Gromov-Hausdorff distance, Evans and his collaborators have recently pioneered an approach to studying the asymptotic behaviour of such objects when the number of vertices goes to infinity. These notes survey the relevant mathematical background and present some selected applications of the theory.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha