Showing math.PRShow all
3 papers · 1 filter
math.PR2019
Tight bounds on the convergence rate of generalized ratio consensus algorithms
Balázs Gerencsér, László Gerencsér
The problems discussed in this paper are motivated by general ratio consensus algorithms, introduced by Kempe, Dobra, and Gehrke (2003) in a simple form as the push-sum algorithm,…
math.PR2018
On the ergodicity of certain Markov chains in random environments
Balazs Gerencser, Miklos Rasonyi
We study the ergodic behaviour of a discrete-time process which is a Markov chain in a stationary random environment. The laws of are shown to converge to a limiting law…
math.PR2016
Correlation bound for distant parts of factor of IID processes
Ágnes Backhausz, Balázs Gerencsér, Viktor Harangi +1
We study factor of i.i.d. processes on the -regular tree for . We show that if such a process is restricted to two distant connected subgraphs of the tree, then the tw…