Related papers: Correlation for permutations
We study the length of the longest increasing and longest decreasing subsequences of random permutations drawn from the Mallows measure. Under this measure, the probability of a permutation pi in S_n is proportional to q^{inv(pi)} where q…
We study violations of n particle Bell inequalities (as developed by Mermin and Klyshko) under the assumption that suitable partial transposes of the density operator are positive. If all transposes with respect to a partition of the system…
We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…
We impose the uniform probability measure on the set of all discrete Gelfand-Tsetlin patterns of depth $n$ with the particles on row $n$ in deterministic positions. These systems equivalently describe a broad class of random tilings models,…
In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…
Motivated by Alain-Sol Sznitman's interlacement process, we consider the set of $\{0,1\}$-valued processes which can be constructed in an analogous way, namely as a union of sets coming from a Poisson process on a collection of sets. Our…
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
We resolve an apparent contradiction between numeric and analytic results for one-dimensional disordered systems with power-law spectral correlations. The conflict arises when considering rigorous results that constrain the set of…
We study the set of almost quantum correlations and their refinements in the simplest tripartite Bell scenario where each party is allowed to perform two dichotomic measurements. In contrast to its bipartite counterpart, we find that there…
Measuring the correlation (association) between two random variables is one of the important goals in statistical applications. In the literature, the covariance between two random variables is a widely used criterion in measuring the…
Based on recent progress in research on copula based dependence measures, we review the original Renyi's axioms on symmetric measures and propose a new set of axioms that applies to nonsymmetric measures. We show that nonsymmetric measures…
In [Berta 2014 Entanglement], uncertainty relations in the presence of quantum memory was formulated for mutually unbiased bases using conditional collision entropy. In this paper, we generalize their results to the mutually unbiased…
For $n \in \mathbb{N}$ and $\varepsilon > 0$, given a sufficiently long sequence of events in a probability space all of measure at least $\varepsilon$, some $n$ of them will have a common intersection. A more subtle pattern: for any $0 < p…
A sequence $f\colon\{1,\dots,n\}\to\mathbb{R}$ contains a permutation $\pi$ of length $k$ if there exist $i_1<\dots<i_k$ such that, for all $x,y$, $f(i_x)<f(i_y)$ if and only if $\pi(x)<\pi(y)$; otherwise, $f$ is said to be $\pi$-free. In…
Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…
The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…
We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\sigma$ is a pair of consecutive elements $\sigma(i), \sigma(i+1)$ such that $\sigma(i) >…
In measurement design, it is common to engineer anti-contrast readouts -- two measurements that respond as differently as possible to the same inputs so that contributions that affect both readouts in the same way are suppressed. To assess…
Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree {dependencies} between neighbouring nodes. One of the problems with the…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…