Persisting randomness in randomly growing discrete structures: graphs and search trees
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search algorithms we show how such persistence of randomness can be dete...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2015-10-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/644/pdf |
| Summary: | The successive discrete structures generated by a sequential algorithm from
random input constitute a Markov chain that may exhibit long term dependence on
its first few input values. Using examples from random graph theory and search
algorithms we show how such persistence of randomness can be detected and
quantified with techniques from discrete potential theory. We also show that
this approach can be used to obtain strong limit theorems in cases where
previously only distributional convergence was known. |
|---|---|
| ISSN: | 1365-8050 |