activity
20192026
collaborators

7 papers

math.PR2026

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…

math.PR2024

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…

math.PR2023

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…

math.PR2023

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…

math.PR2022

Cutoff for a class of auto-regressive models with vanishing additive noise

Balázs Gerencsér, Andrea Ottolini

We analyze the convergence rates for a family of auto-regressive Markov chains on , where at each step a randomly chosen coordinate is replaced…

math.OC2022

Trajectory Convergence from Coordinate-wise Decrease of General Energy Functions

Julien M. Hendrickx, Balázs Gerencsér

We consider arbitrary trajectories subject to a coordinate-wise energy decrease: the sign of the derivative of each entry is never the same as that of the corresponding entry of th…

math.PR2019

Stochastic Approximation in a Markovian Framework Revisited: Lipschitz Continuity of the Poisson Equation

Algo Carè, Balázs Csanád Csáji, Balázs Gerencsér +2

In this paper we revisit a fundamental technical issue within the theory of stochastic approximation (SA) in a Markovian framework, first proposed in the book by Djereveckii and Fr…