AI Chat AI Image Generator AI Video Text to Speech

On directed analogues of expander and hyperfinite graph sequences

08/19/2020

∙

by Endre Csóka, et al.

∙

∙

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.

Endre Csóka
5 publications
Łukasz Grabowski
2 publications

page 1

page 2

page 3

page 4

research

∙ 09/25/2018

On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph

In this paper, we present some rather basic and fundamental results on s...

0 Hang Si, et al. ∙

research

∙ 11/06/2017

Directed Graph Embeddings

Definitions of graph embeddings and graph minors for directed graphs are...

0 Reshef Meir, et al. ∙

research

∙ 02/26/2018

Submodularity on Hypergraphs: From Sets to Sequences

In a nutshell, submodular functions encode an intuitive notion of dimini...

0 Marko Mitrovic, et al. ∙

research

∙ 04/21/2020

Egel – Graph Rewriting with a Twist

Egel is an untyped eager combinator toy language. Its primary purpose is...

0 M. C. A., et al. ∙

research

∙ 11/27/2021

On lossy Compression of Directed Graphs

The method of types presented by Csiszar and Korner is a central tool us...

0 Ronit Bustin, et al. ∙

research

∙ 09/04/2017

Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors

While visual comparison of directed acyclic graphs (DAGs) is commonly en...

0 Kathrin Ballweg, et al. ∙

research

∙ 06/05/2019

Deep Q-Learning for Directed Acyclic Graph Generation

We present a method to generate directed acyclic graphs (DAGs) using dee...

0 Laura D'Arcy, et al. ∙