Related papers: Anti-concentration with respect to random permutat…

Fix a probability $p\in(0,1)$. Let $s_i$ denote the transposition in the symmetric group $\mathfrak{S}_n$ that swaps $i$ and $i+1$. Given a word $\mathsf{w}$ over the alphabet $\{s_1,\ldots,s_{n-1}\}$, we can generate a random subword by…

In this letter we derive the $(n-1)$-dimensional distribution corresponding to a $n$-dimensional i.i.d. Normal standard vector $Z=(Z_1,Z_2,\ldots,Z_n)$ subjected to the weighted sum constraint $\sum_{i=1}^n w_i Z_i=c$, $w_i\neq 0$. We first…

We provide a characterization for anti-concentration of inhomogeneous random walks in non-abelian groups. In application we extend the classical bounds by Erdos-Littlewood-Offord and Sarkozy-Szemeredi to non-abelian settings.

The topic of this paper is the typical behavior of the spectral measures of large random matrices drawn from several ensembles of interest, including in particular matrices drawn from Haar measure on the classical Lie groups, random…

Let $S_{\rm lcm}(n)$ denote the set of permutations $\pi$ of $[n]=\{1,2,\dots,n\}$ such that ${\rm lcm}[j,\pi(j)]\le n$ for each $j\in[n]$. Further, let $S_{\rm div}(n)$ denote the number of permutations $\pi$ of $[n]$ such that…

This study focuses on statistical inference for compound models of the form $X=\xi_1+\ldots+\xi_N$, where $N$ is a random variable denoting the count of summands, which are independent and identically distributed (i.i.d.) random variables…

Concentration inequalities quantify the deviation of a random variable from a fixed value. In spite of numerous applications, such as opinion surveys or ecological counting procedures, few concentration results are known for the setting of…

We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea is to consider non-uniform probability measures.

Given a set $V$, a subset $S$, and a permutation $\pi$ of $V$, we say that $\pi$ permutes $S$ if $\pi (S) \cap S = \emptyset$. Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S_i \subseteq V ~~(i=1,\ldots ,m)$, we say that $\cS$…

Let $P_{n}(x)= \sum_{i=0}^n \xi_i x^i$ be a Kac random polynomial where the coefficients $\xi_i$ are iid copies of a given random variable $\xi$. Our main result is an optimal quantitative bound concerning real roots repulsion. This leads…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

Given $n$ independent random marked $d$-vectors $X_i$ with a common density, define the measure $\nu_n = \sum_i \xi_i $, where $\xi_i$ is a measure (not necessarily a point measure) determined by the (suitably rescaled) set of points near…

The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions…

We consider the self-normalized sums $T_{n}=\sum_{i=1}^{n}X_{i}Y_{i}/\sum_{i=1}^{n}Y_{i}$, where ${Y_{i} : i\geq 1}$ are non-negative i.i.d. random variables, and ${X_{i} : i\geq 1} $ are i.i.d. random variables, independent of ${Y_{i} : i…

A permutation $\pi \in S_n$ is said to {\it avoid} a permutation $\sigma \in S_k$ whenever $\pi$ contains no subsequence with all of the same pairwise comparisons as $\sigma$. For any set $R$ of permutations, we write $S_n(R)$ to denote the…

For a random variable $X$ define $Q(X) = \sup_{x \in \mathbb{R}} \mathbb{P}(X=x)$. Let $X_1, \dots, X_n$ be independent integer random variables. Suppose $Q(X_i) \le \alpha_i \in (0,1]$ for each $i \in \{1, \dots, n\}$. Ju\v{s}kevi\v{c}ius…

In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…

We study how the inversion statistic is influenced by fixed points in a permutation. %The expected number of inversions in a uniformly random permutation in $S_n$ is $\frac{n(n-1)}4$. For each $n\in\mathbb{N}$, and each $k\in\{0,1,\cdots,…

The descent set D(w) of a permutation w of 1,2,...,n is a standard and well-studied statistic. We introduce a new statistic, the connectivity set C(w), and show that it is a kind of dual object to D(w). The duality is stated in terms of the…

We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi\in S_n$, a {\em pinnacle} of $\pi$ is an element $\pi_i$ ($i\neq 1,n$)…