5 citations · 5 across the 2 of their papers we have counts for
9 papers
An application of neighbourhoods in digraphs to the classification of binary dynamics
Pedro Conceição, Dejan Govc, Jānis Lazovskis +3
A binary state on a graph means an assignment of binary values to its vertices. For example, if one encodes a network of spiking neurons as a directed graph, then the spikes produc…
Asymptotic Behaviour of the Containment of Certain Mesh Patterns
Dejan Govc, Jason P. Smith
We present some results on the proportion of permutations of length containing certain mesh patterns as grows large, and give exact enumeration results in some cases. In pa…
Complexes of Tournaments, Directionality Filtrations and Persistent Homology
Dejan Govc, Ran Levi, Jason P. Smith
Complete digraphs are referred to in the combinatorics literature as tournaments. We consider a family of semi-simplicial complexes, that we refer to as "tournaplexes", whose simpl…
Computing persistent homology of directed flag complexes
Daniel Luetgehetmann, Dejan Govc, Jason Smith +1
We present a new computing package Flagser, designed to construct the directed flag complex of a finite directed graph, and compute persistent homology for flexibly defined filtrat…
Permutation graphs and the Abelian sandpile model, tiered trees and non-ambiguous binary trees
Mark Dukes, Thomas Selig, Jason P. Smith +1
A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurr…
The Abelian sandpile model on Ferrers graphs -- A classification of recurrent configurations
Mark Dukes, Thomas Selig, Jason P. Smith +1
We classify all recurrent configurations of the Abelian sandpile model (ASM) on Ferrers graphs. The classification is in terms of decorations of EW-tableaux, which undecorated are…