BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:513@lincs.fr
DTSTART;TZID=Europe/Paris:20191127T140000
DTEND;TZID=Europe/Paris:20191127T150000
DTSTAMP:20191129T133401Z
URL:https://www.lincs.fr/events/random-walks-on-simplicial-complexes/
SUMMARY:Random walks on simplicial complexes
DESCRIPTION:The Laplacian of a graph is a key object in the theory of
 graphs and can be viewed as the generator of a continuous time Markov chain
 on the graph.\nSimplicial complexes\, or hypergraphs\, are combinatorial
 objects which generalizes graphs for which there also exist a notion of
 Laplacian. We investigate the notion of random walk on such objects with
 the goal to find a link between this generalized Laplacian and the
 generator of the Markov process.\n\nLaurent Decreusefond is a Professor at
 Telecom Paris and have recently joined the LINCS lab.
CATEGORIES:Seminars,Youtube
LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013
 Paris\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013
 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT
 Digital):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR