RomainAbraham ,Jean-Franc¸oisDelmas TheforestassociatedwiththerecordprocessonaL´evytree

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

We consider a modified version of the biased random walk on a tree constructed from the set of finite self-avoiding walks on the hexagonal lattice, and use it to construct

Our ontributions. The memory bounds of [Cha07a ℄ are not tight in general, even for 2-player arenas. Outline of the paper. Se tion 2 re alls the lassi al notions in the area, while

1.4. Organization of the paper. We first recall in the next Section the construction of the exploration process, how it codes a CRT and its main properties we shall use. We also

We prove that any such tree can be mapped to a random, compact ultrametric tree called coalescent point process, endowed with a ‘uniform’ measure on its boundary which is the limit as

Our paper focuses on the almost sure asymp- totic behaviours of a recurrent random walk (X n ) in random environment on a regular tree, which is closely related to Mandelbrot

Hausdorff dimension, Random sparse sampling, Thermodynamic formalism, Phase transitions, Ubiquity theory, Multifractals, Large

This yields, by redoing the “special construction” of Aldous [2], a stick-breaking construction of the tree T F , by now considering the trees R(k) as R -trees obtained as finite