Cycle lengths in a permutation are typically Poisson.
Cycle structure of percolation on high-dimensional tori
In the past years, many properties of the largest connected components of critical percolation on the high-dimensional torus, such as their sizes and diameter, have been established. The order of magnitude of these quantities equals the one for percolation on the complete graph or Erdős–Rényi random graph, raising the question whether the scaling limits of the largest connected components, as identified by Aldous (1997), are also equal. In this paper, we investigate the cycle structureof the largest...
Das Problem der drei Würfel in der Vorgeschichte der Stochastik.
Degree distribution nearby the origin of a preferential attachment graph.
Determinantal probability measures
Determinantal point processes have arisen in diverse settings in recent years and have been investigated intensively. We study basic combinatorial and probabilistic aspects in the discrete case. Our main results concern relationships with matroids, stochastic domination, negative association, completeness for infinite matroids, tail triviality, and a method for extension of results from orthogonal projections to positive contractions. We also present several new avenues for further investigation,...
Diagonal sums of boxed plane partitions.
Die seltsamen Würfel des Herrn Efron und eine Verallgemeinerung.
Digital search trees and chaos game representation*
In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which one can visualize repetitions of subwords (seen as suffixes of subsequences). The CGR-tree turns a sequence of letters into a Digital Search Tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height, the insertion depth for DST built from independent successive random sequences having the same distribution. Here the successive inserted words...
Discrete limit laws for additive functions on the symmetric group
Inspired by probabilistic number theory, we establish necessary and sufficient conditions under which the numbers of cycles with lengths in arbitrary sets posses an asymptotic limit law. The approach can be extended to deal with the counts of components with the size constraints for other random combinatorial structures.
Edge cover time for regular graphs.
Eine Untersuchung der Olympia-Lotterie Â?Glücksspirale 1971" .
e-Nets and Simplex Range Queries.
Entropy of Schur–Weyl measures
Relative dimensions of isotypic components of th order tensor representations of the symmetric group on letters give a Plancherel-type measure on the space of Young diagrams with cells and at most rows. It was conjectured by G. Olshanski that dimensions of isotypic components of tensor representations of finite symmetric groups, after appropriate normalization, converge to a constant with respect to this family of Plancherel-type measures in the limit when converges to a constant. The main...
Exact distribution under independence of the diagonal section of the empirical copula
In this paper we analyze some properties of the empirical diagonal and we obtain its exact distribution under independence for the two and three- dimensional cases, but the ideas proposed in this paper can be carried out to higher dimensions. The results obtained are useful in designing a nonparametric test for independence, and therefore giving solution to an open problem proposed by Alsina, Frank and Schweizer [2].
Exchangeable pairs and Poisson approximation.
Expected lengths of minimum spanning trees for non-identical edge distributions.
Exponential tail bounds for max-recursive sequences.
Extended Fibonacci numbers and polynomials with probability applications.
Fragmenting random permutations.
Free cumulants of some probability measures