On directed analogues of expander and hyperfinite graph sequences.
Combinatorics, Probability & Computing(2022)
摘要
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.
更多查看译文
关键词
graph limits, expander, extender, hyperfinite
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要