Related papers: Non-overlapping descents and ascents in stack-sort…
We give the cumulative distribution function of $M_n$, the maximum of a sequence of $n$ observations from an ARMA(1, 1) process. Solutions are first given in terms of repeated integrals and then for the case, where the underlying random…
Let I_{n,k} (resp. J_{n,k}) be the number of involutions (resp. fixed-point free involutions) of {1,...,n} with k descents. Motivated by Brenti's conjecture which states that the sequence I_{n,0}, I_{n,1},..., I_{n,n-1} is log-concave, we…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
The introduction of convolutional layers greatly advanced the performance of neural networks on image tasks due to innately capturing a way of encoding and learning translation-invariant operations, matching one of the underlying symmetries…
Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…
We investigate the statistics of trees grown from some initial tree by attaching links to preexisting vertices, with attachment probabilities depending only on the valence of these vertices. We consider the asymptotic mass distribution that…
Unsupervised rank aggregation on score-based permutations, which is widely used in many applications, has not been deeply explored yet. This work studies the use of submodular optimization for rank aggregation on score-based permutations in…
Consider a set of N agents seeking to solve distributively the minimization problem $\inf_{x} \sum_{n = 1}^N f_n(x)$ where the convex functions $f_n$ are local to the agents. The popular Alternating Direction Method of Multipliers has the…
We develop novel clustering algorithms for functional data when the number of clusters $K$ is unknown and also when it is prefixed. These algorithms are developed based on the Maximum Mean Discrepancy (MMD) measure between two sets of…
For effective decision support in scenarios with conflicting objectives, sets of potentially optimal solutions can be presented to the decision maker. We explore both what policies these sets should contain and how such sets can be computed…
We consider the joint distribution of the area and perimeter statistics on the set I_n of inversion sequences of length n represented as bargraphs. Functional equations for both the ordinary and exponential generating functions are derived…
Consider a population of $N$ individuals, each having $d\geq 1$ different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select $M\leq N$ individuals such that…
New criteria are shown that certain combinations of finite unimodal polynomials are unimodal. %Given unimodal polynomials with explicit expressions and dependent recursion relations, we propose an approach to determine their modes. As…
We consider the problem of upper bounding the number of circular transpositions needed to sort a permutation. It is well known that any permutation can be sorted using at most $n(n-1)/2$ adjacent transpositions. We show that, if we allow…
An incremental evolution equation, i.e. a Master equation in statistical mechanics, is introduced for force distributions in polydisperse frictional particle packings. As basic ingredients of the Master equation, the conditional probability…
Often the factorization of differential cross sections results in the definition of fundamental hadronic functions/distributions which have a double-scale evolution, as provided by a pair of coupled equations. Typically, the two scales are…
Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics…
Kernel embeddings of distributions and the Maximum Mean Discrepancy (MMD), the resulting distance between distributions, are useful tools for fully nonparametric two-sample testing and learning on distributions. However, it is rarely that…
Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…
We give a direct combinatorial proof of the equidistribution of two pairs of permutation statistics, (des, aid) and (lec, inv), which have been previously shown to have the same joint distribution as (exc, maj), the major index and the…