English
Related papers

Related papers: Mean and variance of the longest alternating subse…

200 papers

We study the problem of computing a longest increasing subsequence in a sequence $S$ of $n$ distinct elements in the presence of persistent comparison errors. In this model, every comparison between two elements can return the wrong result…

Data Structures and Algorithms · Computer Science 2018-08-13 Barbara Geissmann

Let \begin{equation*} S_{0}=0,\quad S_{n}=X_{1}+...+X_{n},\ n\geq 1, \end{equation*} be a random walk whose increments belong without centering to the domain of attraction of a stable law with scaling constants $a_{n}$, that provide…

Probability · Mathematics 2024-09-05 Vladimir Vatutin , Elena Dyakonova

We introduce new method for generating correlated or uncorrelated Bernoulli random variables by using the binary expansion of a continuous random variable with support on the unit interval. We show that when this variable has a symmetric…

Probability · Mathematics 2023-09-11 Francisco Marcos de Assis , Juliana Martins de Assis , Micael Andrade Dias

An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class…

Combinatorics · Mathematics 2016-12-15 Sergey V. Avgustinovich , Anna E. Frid , Svetlana Puzynina

For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3} \rfloor + e_k, where e_k \in {-1,0} for…

Combinatorics · Mathematics 2012-06-12 Peter Hegarty

Let $S$ be a Polish space and $(X_n:n\geq1)$ an exchangeable sequence of $S$-valued random variables. Let $\alpha_n(\cdot)=P(X_{n+1}\in \cdot\mid X_1,\...,X_n)$ be the predictive measure and $\alpha$ a random probability measure on $S$ such…

Probability · Mathematics 2013-07-09 Patrizia Berti , Luca Pratelli , Pietro Rigo

In this paper, we study finite-sample properties of the least squares estimator in first order autoregressive processes. By leveraging a result from decoupling theory, we derive upper bounds on the probability that the estimate deviates by…

Statistics Theory · Mathematics 2020-05-26 Rodrigo A. González , Cristian R. Rojas

A recent article on generalised linear mixed model asymptotics, Jiang et al. (2022), derived the rates of convergence for the asymptotic variances of maximum likelihood estimators. If $m$ denotes the number of groups and $n$ is the average…

Statistics Theory · Mathematics 2023-04-03 Luca Maestrini , Aishwarya Bhaskaran , Matt P. Wand

We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…

Probability · Mathematics 2011-07-20 Itai Benjamini , Ori Gurel-Gurevich , Boris Solomyak

Let $X_1$, $X_2$,... be a sequence of independent random variables with common distribution function $F$ in the domain of attraction of a Gumbel extreme value distribution and for each integer $n\geq 1$, let $X_{1,n} \leq ... X_{n,n}$…

Methodology · Statistics 2016-07-19 Gane Samb Lo

We observe that the characteristic polynomial of a linearly perturbed semidefinite matrix can be used to give the convergence rate of alternating projections for the positive semidefinite cone and a line. As a consequence, we show that such…

Optimization and Control · Mathematics 2025-04-17 Hiroyuki Ochiai , Yoshiyuki Sekiguchi , Hayato Waki

If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…

Combinatorics · Mathematics 2014-03-06 Mikhail Lavrov , Po-Shen Loh

Given a set of aligned sequences of independent noisy observations, we are concerned with detecting intervals where the mean values of the observations change simultaneously in a subset of the sequences. The intervals of changed means are…

Applications · Statistics 2011-08-17 David Siegmund , Benjamin Yakir , Nancy R. Zhang

We study the least squares estimator in the residual variance estimation context. We show that the mean squared differences of paired observations are asymptotically normally distributed. We further establish that, by regressing the mean…

Statistics Theory · Mathematics 2013-12-12 Tiejun Tong , Yanyuan Ma , Yuedong Wang

We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…

Disordered Systems and Neural Networks · Physics 2019-04-05 Jörn Börjes , Hendrik Schawe , Alexander K. Hartmann

We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern $w$ of length $m$ as a subsequence in a random text of length $n$. The quantity of interest is the…

Probability · Mathematics 2020-03-24 Svante Janson , Wojciech Szpankowski

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

Probability · Mathematics 2025-04-23 Yi Han

We show that the number of cycles in a random permutation chosen according to generalized Ewens measure is normally distributed and compute asymptotic estimates for the mean and variance.

Probability · Mathematics 2013-08-16 Kenneth Maples , Ashkan Nikeghbali , Dirk Zeindler

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

Combinatorics · Mathematics 2009-11-09 S. V. Avgustinovich , A. E. Frid , T. Kamae , P. V. Salimov

We provide a simple injective proof that the number of 132-avoiding permutations with a unique longest increasing subsequence is at least as large as the number of 132-avoiding permutations without a unique longest increasing subsequence.

Combinatorics · Mathematics 2023-03-07 Nicholas Van Nimwegen