Related papers: Large deviations for the longest alternating and t…
In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the…
Consider Bernoulli(1/2) percolation on $\mathbb{Z}^d$, and define a perfect matching between open and closed vertices in a way that is a deterministic equivariant function of the configuration. We want to find such matching rules that make…
We study the large deviation function for the empirical measure of diffusing particles at one fixed position. We find that the large deviation function exhibits anomalous system size dependence in systems that satisfy the following…
We consider i.i.d. last-passage percolation on $\mathbb{Z}^2$ with weights having distribution $F$ and time-constant $g_F$. We provide an explicit condition on the large deviation rate function for independent sums of $F$ that determines…
We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…
The theory of large deviations deals with the probabilities of rare events (or fluctuations) that are exponentially small as a function of some parameter, e.g., the number of random components of a system, the time over which a stochastic…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
We study large deviation probabilities for a sum of dependent random variables from a heavy-tailed factor model, assuming that the components are regularly varying. We identify conditions where both the factor and the idiosyncratic terms…
We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…
The large-deviation method allows to characterize an ergodic counting process in terms of a thermodynamic frame where a free energy function determines the asymptotic non-stationary statistical properties of its fluctuations. Here, we study…
In this paper we address the complexity of solving linear programming problems with a set of differential equations that converge to a fixed point that represents the optimal solution. Assuming a probabilistic model, where the inputs are…
We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.
We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…
We study Mallows random permutations conditioned to avoid a given pattern $\alpha$ of length~$3$. When the bias parameter is of the form $e^{\beta/n}$, we prove that these permutations converge to a non-trivial explicit deterministic…
Answering a question of Donald Knuth, we find the bivariate exponential generating function for "up-up-or-down-down'' permutations of odd length according to their last entry. An up-up-or-down-down permutation is a permutation $a_1a_2\cdots…
We present four constructions of inversion sequences, and use them to compute the enumeration sequences of 24 classes of pattern-avoiding inversion sequences. This completes the enumeration of inversion sequences avoiding one or two…
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…
The theory of stochastic approximations form the theoretical foundation for studying convergence properties of many popular recursive learning algorithms in statistics, machine learning and statistical physics. Large deviations for…
We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…
We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…