activity
20212026
most citedFactor-of-iid Schreier decorations of lattices in Euclidean spaces

8 citations · 12 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2026

Logarithmic convergence of finite projective planes

Márton Borbényi, Panna Tímea Fekete, Aranka Hrušková +1

In this paper, we study the so-called log-convergence of graphs defined by Balázs Szegedy (arXiv:1504.00858). We answer his Question 4 affirmatively: the sequence of incidence grap…

math.PR2026

On the inclusion of bounded harmonic functions of random walks

Yair Hartman, Aranka Hrušková, Omer Segev

We investigate the conditions under which the space of bounded harmonic functions of a probability measure on a group is contained in that of another measure . We establ…

math.GR2025

Retraction Theorems for Group Compactifications

Yair Hartman, Aranka Hrušková, Mehrdad Kalantar +1

We characterize group compactifications of discrete groups for which there exists an equivariant retraction onto the boundary. In particular, we prove an equivariant analogue of Br…

math.MG2023★ 2 cited

Isometric rigidity of Wasserstein spaces over Euclidean spheres

György Pál Gehér, Aranka Hrušková, Tamás Titkos +1

We study the structure of isometries of the quadratic Wasserstein space over the sphere endowed with the distance inherited from…

math.CO2022

Limits of action convergent graph sequences with unbounded -norms

Aranka Hrušková

The recently developed notion of action convergence by Backhausz and Szegedy unifies and generalises the dense (graphon) and local-global (graphing) convergences of graph sequences…

math.PR2021★ 2 cited

Factor-of-iid balanced orientation of non-amenable graphs

Ferenc Bencs, Aranka Hrušková, László Márton Tóth

We show that if a non-amenable, quasi-transitive, unimodular graph has all degrees even then it has a factor-of-iid balanced orientation, meaning each vertex has equal in- and…

math.PR2021★ 8 cited

Factor-of-iid Schreier decorations of lattices in Euclidean spaces

Ferenc Bencs, Aranka Hrušková, László Márton Tóth

A Schreier decoration is a combinatorial coding of an action of the free group on the vertex set of a -regular graph. We investigate whether a Schreier decoration exists…