Related papers: Characters of local and regular permutation statis…
For many non-equilibrium dynamics driven by small noise, in physics, chemistry, biology, or economy, rare events do matter. Large deviation theory then explains that the leading order term of the main statistical quantities have an…
In this paper, we use analysis on graphs to study quantitative measures of segregation. We focus on a classical statistic from the geography and urban sociology literature known as Moran's I, which in our language is a score associated to a…
In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their…
Permutation is the different arrangements that can be made with a given number of things taking some or all of them at a time. The notation P(n,r) is used to denote the number of permutations of n things taken r at a time. Permutation is…
We provide an introduction to the signature method, focusing on its theoretical properties and machine learning applications. Our presentation is divided into two parts. In the first part, we present the definition and fundamental…
Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…
The problem of inferring the distribution of a random vector given that its norm is large requires modeling a homogeneous limiting density. We suggest an approach based on graphical models which is suitable for high-dimensional vectors. We…
A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…
We give a representation of the classical theory of multiplicative arithmetic functions (MF)in the ring of symmetric polynomials. The basis of the ring of symmetric polynomials that we use is the isobaric basis, a basis especially sensitive…
We prove that most permutations of degree $n$ have some power which is a cycle of prime length approximately $\log n$. Explicitly, we show that for $n$ sufficiently large, the proportion of such elements is at least $1-5/\log\log n$ with…
Thermodynamics is independent of a description at a microscopic level consequently statistical thermodynamics must produce results independent of the coordinate system used to describe the particles and their interactions. In the path…
The aim of this note is to prove a law of large numbers for local patterns in discrete point processes. We investigate two different situations: a class of point processes on the one dimensional lattice including certain Schur measures, and…
Covariances and variances of linear statistics of a point process can be written as integrals over the truncated two-point correlation function. When the point process consists of the eigenvalues of a random matrix ensemble, there are often…
We explore the probability that a permutation sampled from the symmetric group of order n uniformly at random has cycles of lengths not exceeding r. Asymptotic formulas valid in specified regions for the ratio n/r are obtained using the…
We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…
In this paper, we consider the moments of statistics on conjugacy classes of the colored permutation groups $\mathfrak{S}_{n,r}=\mathbb{Z}_r\wr \mathfrak{S}_n$. We first show that any fixed moment coincides on all conjugacy classes where…
We study a continuous pathwise local time of order p for continuous functions with finite p-th variation along a sequence of time partitions, for even integers p >= 2. With this notion, we establish a Tanaka-type change of variable formula,…
We consider a finite or countable collection of one-dimensional Brownian particles whose dynamics at any point in time is determined by their rank in the entire particle system. Using Transportation Cost Inequalities for stochastic…
Many signals evolve in time as a stochastic process, randomly switching between states over discretely sampled time points. Here we make an explicit link between the underlying stochastic process of a signal that can take on a bounded…
The signature of a path is an essential object in the theory of rough paths. The signature representation of the data stream can recover standard statistics, e.g. the moments of the data stream. The classification of random walks indicates…