Information in Strings: Enumeration of Eulerian Paths and Eulerian Components in Markov Sequences - École polytechnique Access content directly
Conference Papers Year : 2014

Information in Strings: Enumeration of Eulerian Paths and Eulerian Components in Markov Sequences

Abstract

In this paper, we evaluate the number of Eulerian circuits that can be obtained by an arbitrary rotation in a Markovian string, i.e., corresponding to a given Markovian type. Since all rotations do not result in an Eulerian circuit, but several of them, called Eulerian components; we also investigate the number of Eulerian components that result from a random rotation in a Markovian string. We consider the asymptotic behaviour of those quantities when the size of the string n tends to infinity. In particular we show that the average number of components tends to be in log V , where V is the size of a large alphabet, in the uniform case.
Fichier principal
Vignette du fichier
Jacquet_Milioris_AOFA_2014.pdf (497.76 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01018460 , version 1 (16-03-2017)

Identifiers

  • HAL Id : hal-01018460 , version 1

Cite

Philippe Jacquet, Dimitrios Milioris. Information in Strings: Enumeration of Eulerian Paths and Eulerian Components in Markov Sequences. AofA 2014 - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Jun 2014, Paris, France. ⟨hal-01018460⟩
414 View
229 Download

Share

Gmail Mastodon Facebook X LinkedIn More