BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ran Levi (University of Aberdeen)
DTSTART:20210215T103000Z
DTEND:20210215T113000Z
DTSTAMP:20260422T135750Z
UID:BilTop/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BilTop/13/">
 An application of neighbourhoods in directed graphs in the classification 
 of binary dynamics</a>\nby Ran Levi (University of Aberdeen) as part of Bi
 lkent Topology Seminar\n\nLecture held in SB-Z11.\n\nAbstract\nA binary st
 ate on a graph means an assignment of binary values to its vertices. For e
 xample\, if one encodes a network of spiking neurons as a directed graph\,
  then the spikes produced by the neurons at an instant of time is a binary
  state on the encoding graph.  Allowing time to vary and recording the spi
 king patterns of the neurons in the network produces an example of  a bina
 ry dynamics on the encoding graph\, namely  a one-parameter family of bina
 ry states on it. The central object of study in this talk is the neighbour
 hood of a vertex $v$ in a graph $\\mathcal{G}$\, namely the subgraph of $\
 \mathcal{G}$ that is generated by $v$ and all its direct neighbours in $\\
 mathcal{G}$.  We present a topological/graph theoretic method for extracti
 ng information out of binary dynamics on a graph\, based on a selection of
  a relatively small number of vertices and their neighbourhoods. As a test
  case we demonstrate an application of the method to binary dynamics that 
 arises from sample activity on the Blue Brain Project reconstruction of co
 rtical tissue of a rat.\n
LOCATION:https://researchseminars.org/talk/BilTop/13/
END:VEVENT
END:VCALENDAR