46 citations · 232 across the 47 of their papers we have counts for
55 papers
Uniform hyperfiniteness
Gábor Elek
Almost forty years ago, Connes, Feldman and Weiss proved that for measurable equivalence relations the notions of amenability and hyperfiniteness coincide. In this paper we define…
Planarity can be Verified by an Approximate Proof Labeling Scheme in Constant-Time
Gábor Elek
Approximate proof labeling schemes were introduced by \\Censor-Hillel, Paz and Perry \cite{CPP}. Roughly speaking, a graph property~$\cP$ can be verified by an approximate proof la…
Convergence and limits of finite trees
Gábor Elek, Gábor Tardos
Motivated by the work of Lovász and Szegedy on the convergence and limits of dense graph sequences, we investigate the convergence and limits of finite trees with respect to sampli…
Uniform Local Amenability implies Property A
Gábor Elek
In this short note we answer a query of Brodzki, Niblo, Špakula, Willett and Wright by showing that all bounded degree uniformly locally amenable graphs have Property A. For the se…
Learning Very Large Graphs with Unknown Vertex Distributions
Gábor Elek
Recently, Goldreich introduced the notion of property testing of bounded-degree graphs with an unknown distribution. We propose a slight modification of his idea: the Radon-Nikodym…
Qualitative graph limit theory. Cantor Dynamical Systems and Constant-Time Distributed Algorithms
Gábor Elek
The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce th…