Home > Research > Publications & Outputs > On directed analogues of expander and hyperfini...

Research

Associated organisational units

Links

Text available via DOI:

Keywords

View graph of relations

On directed analogues of expander and hyperfinite graph sequences

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

On directed analogues of expander and hyperfinite graph sequences. / Csóka, E.; Grabowski, Ł.
In: Combinatorics, Probability and Computing, Vol. 31, No. 2, 31.03.2022, p. 184-197.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Csóka, E & Grabowski, Ł 2022, 'On directed analogues of expander and hyperfinite graph sequences', Combinatorics, Probability and Computing, vol. 31, no. 2, pp. 184-197. https://doi.org/10.1017/S0963548321000225

APA

Csóka, E., & Grabowski, Ł. (2022). On directed analogues of expander and hyperfinite graph sequences. Combinatorics, Probability and Computing, 31(2), 184-197. https://doi.org/10.1017/S0963548321000225

Vancouver

Csóka E, Grabowski Ł. On directed analogues of expander and hyperfinite graph sequences. Combinatorics, Probability and Computing. 2022 Mar 31;31(2):184-197. Epub 2021 Jul 6. doi: 10.1017/S0963548321000225

Author

Csóka, E. ; Grabowski, Ł. / On directed analogues of expander and hyperfinite graph sequences. In: Combinatorics, Probability and Computing. 2022 ; Vol. 31, No. 2. pp. 184-197.

Bibtex

@article{c56dff9eeeff47b7a9b376cdda66f0ea,
title = "On directed analogues of expander and hyperfinite graph sequences",
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. ",
keywords = "expander, extender, graph limits, hyperfinite, Keywords:, Computer science, Probability, Directed acyclic graph (DAG), Graph sequences, Hyperfinite, Directed graphs",
author = "E. Cs{\'o}ka and {\L}. Grabowski",
year = "2022",
month = mar,
day = "31",
doi = "10.1017/S0963548321000225",
language = "English",
volume = "31",
pages = "184--197",
journal = "Combinatorics, Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "2",

}

RIS

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 -