Searcharxiv⌕ Search

arXiv subjects

Gábor Elek

Publications and source records attributed to Gábor Elek.

23 records · Page 2Linked to original sources

The combinatorial cost

We study the combinatorial analogues of the classical invariants of measurable equivalence relations. We introduce the notion of cost and $β$-invariants (the analogue of the first $L^2$-Betti number introduced by Gaboriau) for sequences of finite graphs with uniformly bounded vertex degrees and examine the relation of these invariants and the rank gradient resp. mod $p$ homology gradient invariants introduced by Lackenby for residually finite groups.

math.GR↗

$L^2$-spectral invariants and quasi-crystal graphs

Introducing and studying the pattern frequency algebra, we prove the analogue of Lück's approximation theorems on $L^2$-spectral invariants in the case of aperiodic order. These results imply a uniform convergence theorem for the integrated density of states as well as the positivity of the logarithmic determinant of certain discrete Schrodinger operators.

math.FA↗

Weak convergence of finite graphs, integrated density of states and a Cheeger type inequality

In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences. We show that in this case the integrated density of states exists that is the weak limit of the spectra of the graph Laplacians of the finite graphs is the KNS-spectral measure of the graph Laplacian of the limit graphing. Using this limit technique we prove a Cheeger type inequality for finite graphs.

math.CO↗

The amenability and non-amenability of skew fields

We investigate the amenability of skew filed extensions of the complex numbers. We prove that all skew fields of finite Gelfand-Kirillov transcendence degree are amenable. However there are both amenable and non-amenable skew fields of infinite Gelfand-Kirillov transcendence degree. For example, the free field is non-amenable.

math.RA↗