Persisting randomness in randomly growing discrete structures: graphs
and search trees
2015 ◽
Vol Vol. 18 no. 1
(Analysis of Algorithms)
◽
Keyword(s):
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. Comment: Official journal file
2002 ◽
Vol 241
(1)
◽
pp. 21-27
◽
Keyword(s):
1987 ◽
Vol 101
(4)
◽
pp. 709-709
2021 ◽
Vol 58
(2)
◽
pp. 263-273
2006 ◽
Vol 16
(1)
◽
pp. 423-447
◽
2019 ◽
Vol 17
(2)
◽
pp. 143-153
Keyword(s):