Amazon cover image
Image from Amazon.com
Image from Google Jackets

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

By: Contributor(s): Material type: TextTextSeries: École d'Été de Probabilités de Saint-Flour ; 1920Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008Description: XI, 201 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540747987
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 519.2 23
LOC classification:
  • QA273.A1-274.9
  • QA274-274.9
Online resources:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

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.
(C) Powered by Koha

Powered by Koha