Related papers: Sorting probability for large Young diagrams

Let $(X,Y)$ be a random vector whose conditional excess probability $\theta(x,y):=P(Y\leq y | X>x)$ is of interest. Estimating this kind of probability is a delicate problem as soon as $x$ tends to be large, since the conditioning event…

In this paper we establish an order statistics model of Young tableaux. Multiple integration over nested simplexes is applied to the enumeration of Young tableaux. A brief proof of Frobenius-Young's and Aitken's formulas is given. Partially…

Consider two sequences of $n$ independent and identically distributed fair coin tosses, $X=(X_1,\ldots,X_n)$ and $Y=(Y_1,\ldots,Y_n)$, which are $\rho$-correlated for each $j$, i.e. $\mathbb{P}[X_j=Y_j] = {1+\rho\over 2}$. We study the…

Let $\theta_0,\theta_1 \in \mathbb{R}^d$ be the population risk minimizers associated to some loss $\ell:\mathbb{R}^d\times \mathcal{Z}\to\mathbb{R}$ and two distributions $\mathbb{P}_0,\mathbb{P}_1$ on $\mathcal{Z}$. The models…

We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…

Let $A$ be a limsup random fractal with indices $\gamma_1, ~\gamma_2 ~$and $\delta$ on $[0,1]^d$. We determine the hitting probability $\mathbb{P}(A\cap G)$ for any analytic set $G$ with the condition $(\star)$$\colon$ $\dim_{\rm…

For a number field K and a finite abelian group G, we determine the probabilities of various local completions of a random G-extension of K when extensions are ordered by conductor. In particular, for a fixed prime p of K, we determine the…

In this note, we explicitly compute the probability that a given cell in a random standard Young tableau of the shifted staircase shape $(2n-1, 2n-3, \ldots, 3,1)$ contains the maximal label. We also show that the asymptotic distribution of…

For each certain "nice" piecewise linear function $f:[0,1] \to [0,1]$, we consider a family of growing Young diagrams $\{\lambda(f,N)\}_{N=1}^{\infty}$ by enlarging the region under the graph of $f$. We compute asymptotic formulas for the…

Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…

Given a wave-function minimizing the Levy-Lieb functional, the intent of this short note is to give an estimate of the probability of the particles being in positions $(x_1, \ldots, x_N)$ in the $\delta$-close regime $D_{\delta}= \cup_{i…

Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…

D.Happel and L.Unger defined a partial order on the set of basic tilting modules. We study the poset of basic pre-projective tilting modules over path algebra of infinite type. We give an equivalent condition for that this poset is a…

Recent approaches to the problem of inferring a continuous probability distribution from a finite set of data have used a scalar field theory for the form of the prior probability distribution. This letter presents a more general form for…

Learning joint probability distributions on n random variables requires exponential sample size in the generic case. Here we consider the case that a temporal (or causal) order of the variables is known and that the (unknown) graph of…

Stochastic ordering among distributions has been considered in a variety of scenarios. Economic studies often involve research about the ordering of investment strategies or social welfare. However, as noted in the literature, stochastic…

Let $G=G(n)$ be a graph on $n$ vertices with maximum degree $\Delta=\Delta(n)$. Assign to each vertex $v$ of $G$ a list $L(v)$ of colors by choosing each list independently and uniformly at random from all $k$-subsets of a color set…

We introduce a random matrix model where the entries are dependent across both rows and columns. More precisely, we investigate matrices of the form $\X=(X_{(i-1)n+t})_{it}\in\R^{p\times n}$ derived from a linear process $X_t=\sum_j c_j…

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…

We study the problem of finding Young diagrams of maximum dimension, i. e. those with the largest number of Young tableaux of their shapes. Consider a class of Young diagrams that differ from a symmetric diagram by no more than one box…