BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:39@lincs.fr
DTSTART;TZID=Europe/Paris:20161026T140000
DTEND;TZID=Europe/Paris:20161026T150000
DTSTAMP:20220210T140857Z
URL:https://www.lincs.fr/events/maximum-coloring-of-random-geometric-graph
 s/
SUMMARY:Maximum Coloring of Random Geometric Graphs
DESCRIPTION:We have examined maximum vertex coloring of random geometric
 graphs\, in an arbitrary but fixed dimension\, with a constant number of
 colors\, in a recent work with S.~Borst. Since this problem is neither
 scale-invariant nor smooth\, the usual methodology to obtain limit laws
 cannot be applied. We therefore leverage different concepts based on
 subadditivity to establish convergence laws for the maximum number of
 vertices that can be colored. For the constants that appear in these
 results\, we have provided the exact value in dimension one\, and upper and
 lower bounds in higher dimensions.In an ongoing work with B. Blaszczyszy\,
 we study the distributional properties of maximum vertex coloring of random
 geometric graphs. Moreover\, we intend to generalize the study over
 weakly-$mu$-sub-Poisson processes.
CATEGORIES:Seminars,Youtube
LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\,
 France
GEO:48.8283983;2.3568972000000485
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\,
 Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room
 40:geo:48.8283983,2.3568972000000485
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20160327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR