Related papers: Thresholds for patterns in random permutations wit…
Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…
We introduce a general scheme to detect various multiparticle entanglement structures from global non-permutationally invariant observables. In particular, we derive bounds on the variance of non-permutationally invariant and collective…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant…
We show that classical chaining bounds on the suprema of random processes in terms of entropy numbers can be systematically improved when the underlying set is convex: the entropy numbers need not be computed for the entire set, but only…
Although Turing pattern is one of the most universal mechanisms for pattern formation, in its standard model the number of stripes changes with the system size, since the wavelength of the pattern is invariant: It fails to preserve the…
We study fixed point biased involutions that avoid a pattern. For every pattern of length three we obtain limit theorems for the asymptotic distribution of the (appropriately centered and scaled) number of fixed points of a random fixed…
Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…
Pattern avoidance for permutations has been extensively studied, and has been generalized to vincular patterns, where certain elements can be required to be adjacent. In addition, cyclic permutations, i.e., permutations written in a circle…
We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…
We consider methods for obtaining local lower bounds on characteristics of quantum (correspondingly, classical) systems, i.e. lower bounds valid in the trace norm $\epsilon$-neighborhood of a given state (correspondingly, probability…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
We consider quantum systems with a chaotic classical limit that depend on an external parameter, and study correlations between the spectra at different parameter values. In particular, we consider the parametric spectral form factor…
Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…
In this paper, we study the occurrence of patterns in the cycle structures of permutations.
We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
A formalism is developed for describing approximate classical behaviour in finite (but possibly large) quantum systems. This is done in terms of a structure common to classical and quantum mechanics, viz. a Poisson space with a transition…