Related papers: Longest k-monotone chains

The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two…

The Erd\H os-R\'enyi law states that given a sequence $\{X_j\}_{j=1}^\infty$ of i.i.d.~($p$) coin-tosses, the longest run $L_n$ of heads in the first $n$ coin tosses approaches $\log_{1/p}n$ almost surely. In this paper we explore a…

We consider feasibility and constrained optimization problems defined over smooth and/or strongly convex sets. These notions mirror their popular function counterparts but are much less explored in the first-order optimization literature.…

We study the longest increasing subsequence problem for random permutations avoiding the pattern $312$ and another pattern $\tau$ under the uniform probability distribution. We determine the exact and asymptotic formulas for the average…

Let X(t) be a Gaussian random field R d $\rightarrow$ R. Using the notion of (d -- 1)-integral geometric measures, we establish a relation between (a) the volume of the level set (b) the number of crossings of the restriction of the random…

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

In this paper, we consider robust control using randomized algorithms. We extend the existing order statistics distribution theory to the general case in which the distribution of population is not assumed to be continuous and the order…

We show that any sequence $(x_n)_{n \in \mathbb{N}} \subseteq [0,1]$ that has Poissonian correlations of $k$-th order is uniformly distributed, also providing a quantitative description of this phenomenon. Additionally, we extend…

We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…

We study a new random matrix ensemble $X$ which is constructed by an application of a two dimensional linear filter to a matrix of iid random variables with infinite fourth moments. Our result gives asymptotic lower and upper bounds for the…

The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…

Let $K_n$ denote the number of distinct values among the first $n$ terms of an infinite exchangeable sequence of random variables $(X_1,X_2,\ldots)$. We prove for $n=3$ that the extreme points of the convex set of all possible laws of $K_3$…

One-dimensional chains of non-Abelian quasiparticles described by $SU(2)_k$ Chern-Simons-Witten theory can enter random singlet phases analogous to that of a random chain of ordinary spin-1/2 particles (corresponding to $k \to \infty$). For…

The set of trace preserving, positive maps acting on density matrices of size d forms a convex body. We investigate its nested subsets consisting of k-positive maps, where k=2,...,d. Working with the measure induced by the Hilbert-Schmidt…

Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…

A finite set of real numbers is called convex if the differences between consecutive elements form a strictly increasing sequence. We show that, for any pair of convex sets $A, B\subset\mathbb R$, each of size $n^{1/2}$, the convex grid…

We investigate an infinite array of point interactions of the same strength in R^d, d=2,3, situated at vertices of a polygonal curve with a fixed edge length. We demonstrate that if the curve is not a line, but it is asymptotically straight…

We suggest an approach to obtaining general two-sided bounds on the rate of convergence in terms of special "weighted" norms related to total variation. Some important classes of continuous-time Markov chains are considered:…

We enumerate permutations that avoid all but one of the $k$ patterns of length $k$ starting with a monotone increasing subsequence of length $k-1$. We compare the size of such permutation classes to the size of the class of permutations…

We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…