Related papers: On the sampling entropy of permutons

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…

For some discretely observed path of oscillating Brownian motion with level of self-organized criticality $\rho_0$, we prove in the infill asymptotics that the MLE is $n$-consistent, where $n$ denotes the sample size, and derive its limit…

In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph $H$ in a random graph $G_n$ sampled from a sparse graphon model. Specifically, we provide a refined analysis that separates the contributions of…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

Every k entries in a permutation can have one of k! different relative orders, called patterns. How many times does each pattern occur in a large random permutation of size n? The distribution of this k!-dimensional vector of pattern…

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…

Let $(X,\mu)$ be a standard probability space. An automorphism $T$ of $(X,\mu)$ has the weak Pinsker property if for every $\varepsilon > 0$ it has a splitting into a direct product of a Bernoulli shift and an automorphism of entropy less…

Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can…

We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…

Consider a random directed graph on $n$ vertices with independent identically distributed outdegrees with distribution $F$ having mean $\mu$, and destinations of arcs selected uniformly at random. We show that if $\mu >1$ then for large $n$…

We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…

Shannon's entropy is one of the building blocks of information theory and an essential aspect of Machine Learning methods (e.g., Random Forests). Yet, it is only finitely defined for distributions with fast decaying tails on a countable…

We study Haar unitary random matrices with permuted entries. For a sequence of permutations $\left(\sigma_N\right)_N$, where $\sigma_N$ acts on $N\times N$ matrices we identify conditions under which the $\ast$--distribution of permuted…

Classical two-sample permutation tests for equality of distributions have exact size in finite samples, but they fail to control size for testing equality of parameters that summarize each distribution. This paper proposes permutation tests…

For each $n$, let $A_n=(\sigma_{ij})$ be an $n\times n$ deterministic matrix and let $X_n=(X_{ij})$ be an $n\times n$ random matrix with i.i.d. centered entries of unit variance. In the companion article Cook et al., we considered the…

We discuss the concept of entropy applied to the infinite-N Kuramoto model and derive an expression for its time derivative. The time derivative of the entropy functional is shown to depend on the synchronization order parameter in a very…

An infinite sequence $\alpha$ over an alphabet $\Sigma$ is $\mu$-distributed w.r.t. a probability map $\mu$ if, for every finite string $w$, the limiting frequency of $w$ in $\alpha$ exists and equals $\mu(w)$. %We raise the question of how…

Let $T\_n$ denote the set of unrooted labeled trees of size $n$ and let $T\_n$ be a particular (finite, unlabeled) tree. Assuming that every tree of $T\_n$ is equally likely, it is shown that the limiting distribution as $n$ goes to…

Consider a sample of size $N$ from a population governed by a hierarchical species sampling model. We study the large $N$ asymptotic behavior of the number ${\bf K}_N$ of clusters and the number ${\bf M}_{r,N}$ of clusters with frequency…

In this paper we consider the question of sampling for spaces of entire functions of exponential type in several variables. The novelty resides in the growth condition we impose, that is, that their restriction to a hypersurface is square…