4 papers · 1 filter
Convergence Rate Analysis of Ratio Consensus Algorithms with Column-Allowable Matrices
Balázs Gerencsér, Levente Szemerédi
We give almost sure convergence rate bounds of ratio consensus algorithms when the protocol can be reformulated to be linear updates of vector values on a possibly larger, augmente…
Simultaneous Cutoff on the Multitype Configuration Model
John Fernley, Balázs Gerencsér
We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing…
Improved Mixing Rates of Directed Cycles with Additional Sparse Interconnections
Balázs Gerencsér, Julien M. Hendrickx
We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of vertices and perturbed only at approximately random locations with an appropr…
Low complexity convergence rate bounds for the synchronous gossip subclass of push-sum algorithms
Balázs Gerencsér, Miklós Kornyik
We develop easily accessible quantities for bounding the almost sure exponential convergence rate of push-sum algorithms. We analyze the scenario of i.i.d. synchronous gossip, ever…