Pages that link to "Item:Q1700399"

The following pages link to Limit theorems for longest monotone subsequences in random Mallows permutations (Q1700399):

Displaying 17 items.

• On the cycle structure of Mallows permutations (Q1746151) (← links)
• Block size in geometric(\(p\))-biased permutations (Q1990049) (← links)
• The height of Mallows trees (Q2057202) (← links)
• Clustering of consecutive numbers in permutations under Mallows distributions and super-clustering under general \(p\)-shifted distributions (Q2082650) (← links)
• Statistical enumeration of groups by double cosets (Q2153309) (← links)
• A central limit theorem for descents of a Mallows permutation and its inverse (Q2155509) (← links)
• First passage percolation on hyperbolic groups (Q2172231) (← links)
• Mallows permutations and finite dependence (Q2184821) (← links)
• Permutations avoiding 312 and another pattern, Chebyshev polynomials and longest increasing subsequences (Q2300588) (← links)
• Regenerative random permutations of integers (Q2421818) (← links)
• Poisson percolation on the square lattice (Q3121503) (← links)
• Arcsine laws for random walks generated from random permutations with applications to genomics (Q5014297) (← links)
• Mallows permutations as stable matchings (Q5021256) (← links)
• Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions (Q5026474) (← links)
• Cycles in Mallows random permutations (Q6063350) (← links)
• Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels (Q6074662) (← links)
• Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons (Q6201178) (← links)