On directed analogues of expander and hyperfinite graph sequences

Csóka, E. and Grabowski, Ł. (2022) On directed analogues of expander and hyperfinite graph sequences. Combinatorics, Probability and Computing, 31 (2). pp. 184-197. ISSN 0963-5483

Full text not available from this repository.

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.

Item Type:

Journal Article

Journal or Publication Title:

Combinatorics, Probability and Computing

Uncontrolled Keywords:

/dk/atira/pure/subjectarea/asjc/1700/1703

Subjects:

?? expanderextendergraph limitshyperfinitekeywords:computer scienceprobabilitydirected acyclic graph (dag)graph sequenceshyperfinitedirected graphscomputational theory and mathematicstheoretical computer scienceapplied mathematicsstatistics and probability ??

Departments:

Faculty of Science and Technology > Mathematics and Statistics

ID Code:

167800

Deposited By:

ep_importer_pure

Deposited On:

21 Mar 2022 16:50

Refereed?:

Yes

Published?:

Published

Last Modified:

15 Jul 2024 21:50

URI:

https://eprints.lancs.ac.uk/id/eprint/167800