Combinatorial stochastic processes

From AcaWiki
Jump to: navigation, search

Citation: Jim Pitman (2006) Combinatorial stochastic processes. Springer Lecture Notes in Mathematics (Volume 1875) (RSS)
DOI (original publisher): 10.1007/b11601500
Semantic Scholar (metadata): 10.1007/b11601500
Sci-Hub (fulltext): 10.1007/b11601500
Internet Archive Scholar (search for fulltext): Combinatorial stochastic processes
Download: http://bibserver.berkeley.edu/csp/april05/bookcsp.pdf
Tagged: Mathematics (RSS) combinatorics (RSS), probability (RSS), stochastic processes (RSS)

Summary

Lectures from the 32nd Summer School on Probability Theory held in Saint-Flour, July 7–24, 2002, With a foreword by Jean Picard.

This is a set of lecture notes for a course given at the St. Flour summer school in July 2002.

The theme of the course is the study of various combinatorial models of random partitions and random trees, and the asymptotics of these models related to continuous parameter stochastic processes. Following is a list of the main topics treated: models for random combinatorial structures, such as trees, forests, permutations, mappings, and partitions; probabilistic interpretations of various combinatorial notions e.g. Bell polynomials, Stirling numbers, polynomials of binomial type, Lagrange inversion; Kingman's theory of exchangeable random partitions and random discrete distributions; connections between random combinatorial structures and processes with independent increments: Poisson-Dirichlet limits; random partitions derived from subordinators; asymptotics of random trees, graphs and mappings related to excursions of Brownian motion; continuum random trees embedded in Brownian motion; Brownian local times and squares of Bessel processes; various processes of fragmentation and coagulation, including Kingman's coalescent, the additive and multiplicative coalescents.