2015
DOI: 10.1016/j.ejc.2015.03.004
|View full text |Cite
|
Sign up to set email alerts
|

Variances and covariances in the Central Limit Theorem for the output of a transducer

Abstract: We study the joint distribution of the input sum and the output sum of a deterministic transducer. Here, the input of this finite-state machine is a uniformly distributed random sequence.We give a simple combinatorial characterization of transducers for which the output sum has bounded variance, and we also provide algebraic and combinatorial characterizations of transducers for which the covariance of input and output sum is bounded, so that the two are asymptotically independent.Our results are illustrated b… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
3
2

Relationship

4
1

Authors

Journals

citations
Cited by 5 publications
(12 citation statements)
references
References 25 publications
0
12
0
Order By: Relevance
“…A generalisation of the quasi-power theorem to dimension 2 has been provided in [13]. It has been used in [16], [17], [6], [15] and [19]. In [5,Thm.…”
Section: Introductionmentioning
confidence: 99%
“…A generalisation of the quasi-power theorem to dimension 2 has been provided in [13]. It has been used in [16], [17], [6], [15] and [19]. In [5,Thm.…”
Section: Introductionmentioning
confidence: 99%
“…In this article, we consider the more general setting of Markov chains. The proofs are similar as those in [18], but the results are valid in a broader context and can be formulated more clearly. In contrast to [18], we allow the input sequence of the transducer to be generated by a Markov source.…”
Section: Introductionmentioning
confidence: 75%
“…In [18], the variance of the output of a transducer as well as the covariance between the input and the output were analyzed. In this article, we consider the more general setting of Markov chains.…”
Section: Introductionmentioning
confidence: 99%
“…Since the automaton is probabilistic and aperiodic, the unique dominant eigenvalue of A(1, 1) is 1. Thus the same arguments apply as in [5] after replacing "complete" by "probabilistic". We obtain the same formulas for the constants of the expectation, the variance and the covariance.…”
Section: Asymptotic Analysis Of the Standard Additionmentioning
confidence: 93%
“…After simplifying this construction as described in Lemma 5.4, the probabilistic automaton N SSDE has 12 states: (−1, 1)), (1, (1, −1))}, {(4, (0, 0)), (9, (0, 0))}, {(5, (0, 1)), (5 , (1, 0)), (10, (−1, 0)), (10, (0, −1))}, (11) {(2, (0, 1)), (2 , (1, 0)), (7, (−1, 0)), (7, (0, −1))}, {(5, (0, 0)), (10, (0, 0))}, (0, 0)), (7, (0, 0))}, (−1, 0)), (1, (0, −1)), (1, (0, 1)), (1, (1, 0))}, (0, 1)), (3 , (1, 0)), (8, (−1, 0)), (8, (0, −1))}, { (1, (0, 0))}, {(3, (0, 0)), (8, (0, 0))}, (1, 1)), (9, (−1, −1))}, {(4, (0, 1)), (4 , (1, 0)), (9, (−1, 0)), (9, (0, −1))}.…”
Section: Asymptotic Analysis Of Von Neumann's Additionmentioning
confidence: 99%