Related papers: Thresholds for patterns in random permutations wit…
The appropriate selection of recurrence thresholds is a key problem in applications of recurrence quantification analysis and related methods across disciplines. Here, we discuss the distribution of pairwise distances between state vectors…
A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…
We study the evolution leading to (or regressing from) a large fluctuation in a Statistical Mechanical system. We introduce and study analytically a simple model of many identically and independently distributed microscopic variables $n_m$…
The random reversal graph offers new perspectives, allowing to study the connectivity of genomes as well as their most likely distance as a function of the reversal rate. Our main result shows that the structure of the random reversal graph…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
We investigate the appearance of the square of a Hamilton cycle in the model of randomly perturbed graphs, which is, for a given $\alpha \in (0,1)$, the union of any $n$-vertex graph with minimum degree $\alpha n$ and the binomial random…
We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…
A quantum decaying system can reveal its nonclassical behavior by being noninvasively measured. Correlations of weak measurements in the noninvasive limit violate the classical bound for a universal class of systems. The violation is…
We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to…
In their seminal paper introducing the theory of random graphs, Erd\H{o}s and R\'{e}nyi considered the evolution of the structure of a random subgraph of $K_n$ as the density increases from $0$ to $1$, identifying two key points in this…
We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…
Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…
Bounds on the entropy of patterns of sequences generated by independently identically distributed (i.i.d.) sources are derived. A pattern is a sequence of indices that contains all consecutive integer indices in increasing order of first…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding on a recent randomized iterated projection algorithm of…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
We obtain the law of large numbers (LLN) and the central limit theorem (CLT) for weakly dependent non-stationary arrays of random fields with asymptotically unbounded moments. The weak dependence condition for arrays of random fields is…
The classical random matrix theory is mostly focused on asymptotic spectral properties of random matrices as their dimensions grow to infinity. At the same time many recent applications from convex geometry to functional analysis to…