License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2016.9
URN: urn:nbn:de:0030-drops-60859
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6085/
Go to the corresponding LIPIcs Volume Portal

Nicaud, Cyril

Estimating Statistics on Words Using Ambiguous Descriptions

pdf-format:
LIPIcs-CPM-2016-9.pdf (0.5 MB)

Abstract

In this article we propose an alternative way to prove some recent results on statistics on words, such as the expected number of runs or the expected sum of the run exponents. Our approach consists in designing a general framework, based on the symbolic method developped in analytic combinatorics. The descriptions obtained in this framework are built in such a way that the degree of ambiguity of an object O (i.e., the number of different descriptions corresponding to O) is exactly the value of the statistic under study for O. The asymptotic estimation of the expectation is then done using classical techniques from analytic combinatorics. To show the generality of our method, we not only apply it to obtain new proofs of known results but also extend them from the uniform distribution to any memoryless distribution.

BibTeX - Entry

@InProceedings{nicaud:LIPIcs:2016:6085,
  author =	{Cyril Nicaud},
  title =	{{Estimating Statistics on Words Using Ambiguous Descriptions}},
  booktitle =	{27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
  pages =	{9:1--9:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-012-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{54},
  editor =	{Roberto Grossi and Moshe Lewenstein},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6085},
  URN =		{urn:nbn:de:0030-drops-60859},
  doi =		{10.4230/LIPIcs.CPM.2016.9},
  annote =	{Keywords: random words, runs, symbolic method, analytic combinatorics}
}

Keywords: random words, runs, symbolic method, analytic combinatorics
Collection: 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)
Issue Date: 2016
Date of publication: 27.06.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI