Permutations without long decreasing subsequences and random matrices.

Śniady, Piotr

Displaying similar documents to “Permutations without long decreasing subsequences and random matrices.”

Jack deformations of Plancherel measures and traceless Gaussian random matrices.

Matsumoto, Sho (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Longest increasing subsequences of random colored permutations.

Borodin, Alexei (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Expected values in the alternative set theory and their applications to some limit theorems

Martin Kalina (1994)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

This article presents an alternative approach to statistical moments within non-standard models and by the help of these moments some limit theorems are reformulated and proved.

Orthogonal polynomial ensembles in probability theory.

König, Wolfgang (2005)

Probability Surveys [electronic only]

Similarity:

Central limit theorems for the products of random matrices sampled by a random walk.

Duheille-Bienvenüe, Frédérique, Guillotin-Plantard, Nadine (2003)

Electronic Communications in Probability [electronic only]

Similarity:

Sojourn times.

Takács, Lajos (1996)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

Poisson statistics for the largest eigenvalues of Wigner random matrices with heavy tails.

Soshnikov, Alexander (2004)

Electronic Communications in Probability [electronic only]

Similarity:

On a probability problem connected with railway traffic.

Takács, Lajos (1991)

Journal of Applied Mathematics and Stochastic Analysis

Similarity:

An observation about submatrices.

Chatterjee, Sourav, Ledoux, Michel (2009)

Electronic Communications in Probability [electronic only]

Similarity:

Spectrum of random Toeplitz matrices with band structure.

Kargin, Vladislav (2009)

Electronic Communications in Probability [electronic only]

Similarity: