Fragmentations and tree-like fractals: a functional fixed-point approach
I will review some models and recent results where ``fixed-points'' approach or the ``contraction method'' have played a central role. Recursive partitioning schemes are central to many applications, starting with efficient data structures based on the divide-and-conquer paradygm. For more than 25 years now, arguments based on Banach fixed theorem have long been used to prove ``softly'' the convergence in distribution of associated real-valued random variables in the context of analysis of algorithms. I will review a number of questions that call for a more general approach for random functions. The applications include the quantification of the cost of partial match search queries in data data such as quad trees and k-trees, the construction of natural fractal tree-like objects such as Aldous' continuum random trees, or certain trees that are dual to recursive geometric partitions, and extend to the convergence of certain random fields. This is based on a collection of joint works with Henning Sulzbach and Ralph Neininger.