BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:On characterizations of discrete and continuous long-range percola
tion
DTSTART;VALUE=DATE-TIME:20210915T081500Z
DTEND;VALUE=DATE-TIME:20210915T091500Z
DTSTAMP;VALUE=DATE-TIME:20210920T175549Z
UID:indico-event-6861@indico.math.cnrs.fr
DESCRIPTION:Random graphs are used as models for networks\, in particular
capturing their complexity by describing local and probabilistic rules acc
ording to which vertices are connected to each other. A quite famous model
is long-range percolation in which the vertex set is either assumed to be
Z^d or R^d and the probability of an edge between two arbitrary vertices
asymptotically has a polynomial decay in their distances. The focus is in
studying graph-theoretical properties of theaforementioned models\, such
as the behavior of the random walk on the graph and the shortest path bet
ween an arbitrary pair of two vertices. In particular\, recent results on
continuous long-range percolation are presented.\n\nhttps://indico.math.cn
rs.fr/event/6861/
LOCATION:IMB René Baire
URL:https://indico.math.cnrs.fr/event/6861/
END:VEVENT
END:VCALENDAR