Profiles of permutations.
Displaying 181 – 200 of 274
Pseudoquestionnaires
D. Chenais, M. Terrenoire (1971)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Question de probabilité
M. Weill (1886)
Bulletin de la Société Mathématique de France
Random graph-homomorphisms and logarithmic degree.
Benjamini, Itai, Yadin, Ariel, Yehudayoff, Amir (2007)
Electronic Journal of Probability [electronic only]
Random -sat: the limiting probability for satisfiability for moderately growing .
Coja-Oghlan, Amin, Frieze, Alan (2008)
The Electronic Journal of Combinatorics [electronic only]
Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.
Pitman, Jim (2001)
Séminaire Lotharingien de Combinatoire [electronic only]
Random matching problems on the complete graph.
Wästlund, Johan (2008)
Electronic Communications in Probability [electronic only]
Random matrices and permutations, matrix integrals and integrable systems
Pierre van Moerbeke (1999/2000)
Séminaire Bourbaki
Random networks with sublinear preferential attachment: degree evolutions.
Dereich, Steffen, Mörters, Peter (2009)
Electronic Journal of Probability [electronic only]
Random orders and gambler's ruin.
Blass, Andreas, Braun, Gábor (2005)
The Electronic Journal of Combinatorics [electronic only]
Random Packings and Coverings in Random Trees
A. MEIR, J.W. MOON (1973)
Aequationes mathematicae
Random real trees
Jean-François Le Gall (2006)
Annales de la faculté des sciences de Toulouse Mathématiques
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.
Goldschmidt, Christina, Martin, James B. (2005)
Electronic Journal of Probability [electronic only]
Random selection of mutally exclusive samples
J. B. Ukšanović (1981)
Matematički Vesnik
Random subnetworks of random sorting networks.
Angel, Omer, Holroyd, Alexander E. (2010)
The Electronic Journal of Combinatorics [electronic only]
Random trees and applications.
Le Gall, Jean-François (2005)
Probability Surveys [electronic only]
Random walk on a building of type Ãr and brownian motion of the Weyl chamber
Bruno Schapira (2009)
Annales de l'I.H.P. Probabilités et statistiques
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.
Pak, Igor (1999)
Electronic Journal of Probability [electronic only]
Random walks on graphs with volume and time doubling.
András Telcs (2006)
Revista Matemática Iberoamericana
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.
Neunhäuserer, Jörg (2007)
Electronic Journal of Probability [electronic only]