Random graph-homomorphisms and logarithmic degree.
Random -sat: the limiting probability for satisfiability for moderately growing .
Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.
Random matching problems on the complete graph.
Random matrices and permutations, matrix integrals and integrable systems
Random networks with sublinear preferential attachment: degree evolutions.
Random orders and gambler's ruin.
Random Packings and Coverings in Random Trees
Random real trees
We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in particular of the relations between discrete Galton-Watson trees and continuous random trees. We then discuss the particular class of self-similar random real trees called stable trees, which generalize the CRT. We review several important results concerning stable...
Random recursive trees and the Bolthausen-Sznitman coalescent.
Random selection of mutally exclusive samples
Random subnetworks of random sorting networks.
Random trees and applications.
Random walk on a building of type Ãr and brownian motion of the Weyl chamber
In this paper we study a random walk on an affine building of type Ãr, whose radial part, when suitably normalized, converges toward the brownian motion of the Weyl chamber. This gives a new discrete approximation of this process, alternative to the one of Biane (Probab. Theory Related Fields89 (1991) 117–129). This extends also the link at the probabilistic level between riemannian symmetric spaces of the noncompact type and their discrete counterpart, which had been previously discovered by Bougerol...
Random walks on finite groups with few random generators.
Random walks on graphs with volume and time doubling.
This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.
Random walks on infinite self-similar graphs.
Record indices and age-ordered frequencies in exchangeable Gibbs partitions.
Recurrent graphs where two independent random walks collide finitely often.
Reformed permutations in mousetrap and its generalizations.