Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/high-dimensional-probability-vii-on-the-order-of-the-central-moments-Zp4rDpL5Uh
References (14)
-
K. Alexander (1997)
Approximation of subadditive functions and convergence rates in limiting-shape resultsAnnals of Probability, 25
-
S. Majumdar, S. Nechaev (2004)
Exact asymptotic results for the Bernoulli matching model of sequence alignment.Physical review. E, Statistical, nonlinear, and soft matter physics, 72 2 Pt 1
-
J. Steele (1986)
An Efron-Stein inequality for nonsymmetric statisticsAnnals of Statistics, 14
-
Federico Bonetto, H. Matzinger (2004)
Fluctuations of the longest common subsequence in the asymmetric case of 2- and 3-letter alphabetsarXiv: Combinatorics
-
C. Houdré, J. Lember, H. Matzinger (2006)
On the longest common increasing binary subsequenceComptes Rendus Mathematique, 343
-
K. Alexander (1994)
The Rate of Convergence of the Mean Length of the Longest Common SubsequenceAnnals of Applied Probability, 4
-
V. Chvátal, D. Sankoff (1975)
Longest common subsequences of two random sequencesAdvances in Applied Probability, 7
-
A. Osȩkowski (2012)
Sharp Martingale and Semimartingale Inequalities -
C. Houdré, H. Matzinger (2008)
ON THE VARIANCE OF THE OPTIMAL ALIGNMENT SCORE FOR AN ASYMMETRIC SCORING FUNCTIONarXiv: Probability
-
Wansoo Rhee, M. Talagrand (1986)
Martingale inequalities and the Jackknife estimate of varianceStatistics & Probability Letters, 4
-
S. Amsalu, C. Houdré, H. Matzinger (2012)
Sparse Long Blocks and the Micro-structure of the Longuest Common SubsequencesJournal of Statistical Physics, 154
-
C. Houdré, H. Matzinger (2007)
On the Variance of the Optimal Alignments Score for Binary Random Words and an Asymmetric Scoring FunctionJournal of Statistical Physics, 164
-
J. Lember, H. Matzinger (2009)
Standard deviation of the longest common subsequenceAnnals of Probability, 37
-
S. Amsalu, H. Matzinger (2012)
Sparse long blocks and the variance of the LCSarXiv: Probability
- Publisher
- Springer International Publishing
- Copyright
- © Springer International Publishing Switzerland 2016
- ISBN
- 978-3-319-40517-9
- Pages
- 105 –136
- DOI
- 10.1007/978-3-319-40519-3_5
- Publisher site
- See Chapter on Publisher Site
Abstract
[We investigate the order of the r-th, 1 ≤ r < +∞, central moment of the length of the longest common subsequences of two independent random words of size n whose letters are identically distributed and independently drawn from a finite alphabet. When all but one of the letters are drawn with small probabilities, which depend on the size of the alphabet, a lower bound is shown to be of order nr∕2. This result complements a generic upper bound also of order nr∕2.]
Published: Sep 22, 2016
Keywords: Burkholder inequality; Efron-Stein inequality; Last passage percolation; Longest common subsequence; r -th central moment