On directed analogues of expander and hyperfinite graph sequences
Combinatorics
2023-06-22 v3 Computational Complexity
Probability
Abstract
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic construction of non-hypershallow graph sequences.
Cite
@article{arxiv.2008.08680,
title = {On directed analogues of expander and hyperfinite graph sequences},
author = {Endre Csóka and Łukasz Grabowski},
journal= {arXiv preprint arXiv:2008.08680},
year = {2023}
}
Comments
17 pages, no figures, v3: very minor changes compared to v2, final accepted version to appear in Comb. Probab. Comput