相关论文: Sawtooth models and asymptotic independence in lar…

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

This paper combines the decomposition technique ($\sigma$-stability) in random functional analysis with the deterministic theory of asymptotically pointwise contractions to provide a complete self-contained derivation of a fixed point…

Compositional data are common in many fields, both as outcomes and predictor variables. The inventory of models for the case when both the outcome and predictor variables are compositional is limited and the existing models are difficult to…

The purpose of this article is to present a general method to find limiting laws for some renormalized statistics on random permutations. The model considered here is Ewens sampling model, which generalizes uniform random permutations. We…

In this paper, a robust non-parametric measure of statistical dependence, or correlation, between two random variables is presented. The proposed coefficient is a permutation-like statistic that quantifies how much the observed sample S_n :…

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

We give a short, operator-theoretic proof of the asymptotic independence (including a first correction term) of the minimal and maximal eigenvalue of the n \times n Gaussian Unitary Ensemble in the large matrix limit n \to \infty. This is…

A Bayesian nonparametric method of James, Lijoi \& Prunster (2009) used to predict future values of observations from normalized random measures with independent increments is modified to a class of models based on negative binomial…

For a given permutation $\tau$, let $P_N^{\tau}$ be the uniform probability distribution on the set of $N$-element permutations $\sigma$ that avoid the pattern $\tau$. For $\tau=\mu_k:=123\cdots k$, we consider $P_N^{\mu_k}(\sigma_I=J)$…

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

We consider the asymptotic joint distributions among several families of well-known metrics on $S_n$, the symmetric group. These include the bi-invariant metrics such as the Cayley and Hamming distance, and the left-invariant metrics such…

Observational entropy -- a quantity that unifies Boltzmann's entropy, Gibbs' entropy, von Neumann's macroscopic entropy, and the diagonal entropy -- has recently been argued to play a key role in a modern formulation of statistical…

Given a sequence of deterministic matrices $A = A_N$ and a sequence of deterministic nonnegative matrices $\Sigma=\Sigma_N$ such that $A\to a$ and $\Sigma\to \sigma$ in $\ast$-distribution for some operators $a$ and $\sigma$ in a finite von…

Dependency networks (Heckerman et al., 2000) provide a flexible framework for modeling complex systems with many variables by combining independently learned local conditional distributions through pseudo-Gibbs sampling. Despite their…

Let $E$ be a homogeneous compact set, for instance a Cantor set of positive length. Further let $\sigma$ be a positive measure with $\text{supp}(\sigma)=E$. Under the condition that the absolutely continuous part of $\sigma$ satisfies a…

We study the long-term average evolution of the random ensemble along integrable Hamiltonian systems with time $T$-periodic transitions. More precisely, for any observable $G$, it is demonstrated that the ensemble under $G$ in long time…

We establish new estimates for the number of $m$-smooth polynomials of degree $n$ over a finite field $\mathbb{F}_q$, where the main term involves the number of $m$-smooth permutations on $n$ elements. Our estimates imply that the…

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…