BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ran Levi (University of Aberdeen)
DTSTART:20200420T140000Z
DTEND:20200420T150000Z
DTSTAMP:20260423T035931Z
UID:OATS/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OATS/1/">Com
 plexes of Tournaments in Directed Networks</a>\nby Ran Levi (University of
  Aberdeen) as part of Online algebraic topology seminar\n\n\nAbstract\nCli
 que graphs whose edges are oriented are referred to in the combinatorics l
 iterature as tournaments. We consider a family of semi-simplicial sets\, t
 hat we refer to as “tournaplexes"\, whose simplices are tournaments. In 
 particular\, given a directed graph G\, we associate with it a “flag tou
 rnaplex" which is a tournaplex containing the directed flag complex of G\,
  but also the geometric realisation of cliques that are not directed. We d
 efine several types of filtration on tournaplexes\, and exploiting persist
 ent homology\, we observe that filtered flag tournaplexes provide finer me
 ans of distinguishing graph dynamics than the directed flag complex. We th
 en demonstrate the power of those ideas by applying them to graph data ari
 sing from the Blue Brain Project’s digital reconstruction of a rat’s n
 eocortex.\n
LOCATION:https://researchseminars.org/talk/OATS/1/
END:VEVENT
END:VCALENDAR