加载中…
We study the asymptotics of the -mapping model of random mappings on as gets large, under a large class of asymptotic regimes for the underlying distribution . We encode these random mappings in random walks which are shown to converge to a functional of the exploration process of inhomogeneous random trees, this exploration process being derived (Aldous-Miermont-Pitman 2003) from a bridge with exchangeable increments. Our setting generalizes previous results by allowing a finite number of ``attracting points’’ to emerge.

生成讲解博客的中文版本

生成AI智能校验的中文版本