Page 1

Displaying 1 – 7 of 7

Showing per page

Determinantal probability measures

Russell Lyons (2003)

Publications Mathématiques de l'IHÉS

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,...

Digital search trees and chaos game representation*

Peggy Cénac, Brigitte Chauvin, Stéphane Ginouillac, Nicolas Pouyanne (2009)

ESAIM: Probability and Statistics

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

Eugenijus Manstavičius (2005)

Acta Mathematica Universitatis Ostraviensis

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.

Currently displaying 1 – 7 of 7

Page 1