Á. Backhausz

activity

20072025

most citedRamanujan graphings and correlation decay in local algorithms

31 citations · 53 across the 12 of their papers we have counts for

collaborators

Showing 2016 · math.PRShow all

2 papers · 2 filters

math.PR2016

On the almost eigenvectors of random regular graphs

Agnes Backhausz, Balazs Szegedy

Let $d \geq 3$ be fixed and $G$ be a large random $d$ -regular graph on $n$ vertices. We show that if $n$ is large enough then the entry distribution of every almost eigenvector $v$ …

math.PR2016★ 1 cited

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 $d$ -regular tree for $d \geq 3$ . We show that if such a process is restricted to two distant connected subgraphs of the tree, then the tw…