Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.

DOI10.4171/OWR/2014/50MaRDI QIDQ347231zbMATH OpenOpenAlexFDO

Authors

Publication date 30 November 2016

Published in Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/owr/2014/50

Mathematics Subject Classification ID

Collections of abstracts of lectures (00B05) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Proceedings, conferences, collections, etc. pertaining to probability theory (60-06) Combinatorial probability (60C05) Central limit and other weak theorems (60F05) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Searching and sorting (68P10) Analysis of algorithms (68W40)

Review text

Summary: The subject of this workshop were probabilistic aspects of algorithms for fundamental problems such as sorting, searching, selecting of and within data, random permutations, algorithms based on combinatorial trees or search trees, continuous limits of random trees and random graphs as well as random geometric graphs. The deeper understanding of the complexity of such algorithms and of shape characteristics of large discrete structures require probabilistic models and an asymptotic analysis of random discrete structures. The talks of this workshop focused on probabilistic, combinatorial and analytic techniques to study asymptotic properties of large random combinatorial structures.

Recommendations

• Mini-workshop: Random trees, information and algorithms. Abstracts from the mini-workshop held April 24--30, 2011
• Random trees. Abstracts from the workshop held January 18th -- January 24th, 2009.
• A probabilistic analysis of some tree algorithms
• scientific article; zbMATH DE number 53861
• Algorithms, random tree models and combinatorial objects

Cites work

• Fires on trees
• Reversing the cut tree of the Brownian continuum random tree
• Scaling limits of Markov branching trees with applications to Galton-Watson and random unordered trees
• The cut-tree of large Galton-Watson trees and the Brownian CRT
• The cut-tree of large recursive trees
• The vertex-cut-tree of Galton-Watson trees converging to a stable tree

Cited in

(3)

• Random trees. Abstracts from the workshop held January 18th -- January 24th, 2009.
• Mini-workshop: Random trees, information and algorithms. Abstracts from the mini-workshop held April 24--30, 2011
• scientific article; zbMATH DE number 2207482 (Why is no real title available?)

This page was built for publication: Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347231)