Final published version
Licence: CC BY: Creative Commons Attribution 4.0 International License
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - On directed analogues of expander and hyperfinite graph sequences
AU - Csóka, E.
AU - Grabowski, Ł.
PY - 2022/3/31
Y1 - 2022/3/31
N2 - 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.
AB - 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.
KW - expander
KW - extender
KW - graph limits
KW - hyperfinite
KW - Keywords:
KW - Computer science
KW - Probability
KW - Directed acyclic graph (DAG)
KW - Graph sequences
KW - Hyperfinite
KW - Directed graphs
U2 - 10.1017/S0963548321000225
DO - 10.1017/S0963548321000225
M3 - Journal article
VL - 31
SP - 184
EP - 197
JO - Combinatorics, Probability and Computing
JF - Combinatorics, Probability and Computing
SN - 0963-5483
IS - 2
ER -