4 papers
Boosted second moment method in random regular graphs
Balázs Gerencsér, Viktor Harangi
Determining the asymptotic independence ratio of random regular graphs is a key challenge in the area of sparse random graphs. Due to the interpolation method, we have very good up…
Low complexity convergence rate bounds for push-sum algorithms with homogeneous correlation structure
Balázs Gerencsér, Miklós Kornyik
The objective of this work is to establish an upper bound for the almost sure convergence rate for a class of push-sum algorithms. The current work extends the methods and results…
The Supermarket Model on a Dynamic Regular Hypergraph
John Fernley, Balázs Gerencsér
The supermarket model is a system of queues each with serving rates and arrival rates per vertex, where tasks will move on arrival to the shortest adjacent queue. We c…
Mixing on the cycle with constant size perturbation
Shi Feng, Balázs Gerencsér
Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible trans…