中文
相关论文

相关论文: The asymptotics of monotone subsequences of involu…

200 篇论文

We study the distribution of the length of longest monotone subsequences in random (fixed-point free) involutions of $n$ integers as $n$ grows large, establishing asymptotic expansions in powers of $n^{-1/6}$ in the general case and in…

概率论 · 数学 2025-11-21 Folkmar Bornemann

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

组合数学 · 数学 2007-05-23 Jinho Baik , Eric M. Rains

For a variety of pattern-avoiding classes, we describe the limiting distribution for the number of fixed points for involutions chosen uniformly at random from that class. In particular we consider monotone patterns of arbitrary length as…

组合数学 · 数学 2023-06-22 Samuel Miner , Douglas Rizzolo , Erik Slivken

We study the distribution of the length of longest increasing subsequences in random permutations of $n$ integers as $n$ grows large and establish an asymptotic expansion in powers of $n^{-1/3}$. Whilst the limit law was already shown by…

概率论 · 数学 2024-03-19 Folkmar Bornemann

It is known from the work of Baik, Deift, and Johansson [1999] that we have Tracy-Widom fluctuations for the longest increasing subsequence of uniform permutations. In this paper, we prove that this result holds also in the case of the…

概率论 · 数学 2021-01-26 Mohamed Slim Kammoun

For the Erd\H{o}s-R\'enyi random graph G(n,p), we give a precise asymptotic formula for the size of a largest vertex subset in G(n,p) that induces a subgraph with average degree at most t, provided that p = p(n) is not too small and t =…

组合数学 · 数学 2013-09-04 Nikolaos Fountoulakis , Ross J. Kang , Colin McDiarmid

The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…

组合数学 · 数学 2007-05-23 Jinho Baik , Percy Deift , Kurt Johansson

We study the lengths of monotone subsequences for permutations drawn from the Mallows measure. The Mallows measure was introduced by Mallows in connection with ranking problems in statistics. Under this measure, the probability of a…

概率论 · 数学 2016-06-29 Riddhipratim Basu , Nayantara Bhatnagar

We analyze the left-tail asymptotics of deformed Tracy-Widom distribution functions describing the fluctuations of the largest eigenvalue in invariant random matrix ensembles after removing each soft edge eigenvalue independently with…

数学物理 · 物理学 2022-10-19 Thomas Bothner , Robert Buckingham

A bijection is given between fixed point free involutions of $\{1,2,...,2N\}$ with maximum decreasing subsequence size $2p$ and two classes of vicious (non-intersecting) random walker configurations confined to the half line lattice points…

组合数学 · 数学 2009-11-07 T. H. Baker , P. J. Forrester

We establish the relation between two objects: an integrable system related to Painlev\'e II equation, and the symplectic invariants of a certain plane curve S(TW). This curve describes the average eigenvalue density of a random hermitian…

可精确求解与可积系统 · 物理学 2010-12-14 Gaetan Borot , Bertrand Eynard

We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…

概率论 · 数学 2020-02-04 Dirk Zeindler

A famous result by Hammersley and Versik-Kerov states that the length $L_n$ of the longest increasing subsequence among $n$ iid continuous random variables grows like $2\sqrt{n}$. We investigate here the asymptotic behavior of $L_n$ for…

组合数学 · 数学 2025-11-24 Anne-Laure Basdevant , Lucas Gerin , Maxime Marivain

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

概率论 · 数学 2009-01-16 Florent Benaych-Georges

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

组合数学 · 数学 2025-08-22 Charles Burnette

We consider statistics on permutations chosen uniformly at random from fixed parabolic double cosets of the symmetric group. We show that the distribution of fixed points is asymptotically Poisson and establish central limit theorems for…

概率论 · 数学 2023-04-20 J. E. Paguyo

We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…

概率论 · 数学 2013-08-26 Takis Konstantopoulos , Katja Trinajstić

In this paper, we examine the asymptotic behavior of the longest increasing subsequence (LIS) in a uniformly random permutation of $n$ elements. We rely on the Robinson--Schensted--Knuth correspondence, Young tableaux, and key classical…

历史与综述 · 数学 2025-11-04 Mihir Gupta

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

We consider the asymptotic fluctuation behavior of the largest eigenvalue of certain sample covariance matrices in the asymptotic regime where both dimensions of the corresponding data matrix go to infinity. More precisely, let $X$ be an…

概率论 · 数学 2009-09-29 Noureddine El Karoui
‹ 上一页 1 2 3 10 下一页 ›