BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:8049@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20150612T110000
DTEND;TZID=Europe/Paris:20150612T120000
DTSTAMP:20241120T210007Z
URL:https://www.i2m.univ-amu.fr/evenements/detecting-a-community-in-random
 -networks-nicolas-verzelen/
SUMMARY:Nicolas Verzelen (INRA Montpellier): Detecting a community in Rando
 m Networks - Nicolas Verzelen
DESCRIPTION:Nicolas Verzelen: We formalize the problem of detecting a commu
 nity in a network into testing whether in a given (random) graph there is 
 a subgraph that is unusually dense. We observe an undirected and unweighte
 d graph on N nodes. Under the null hypothesis\, the graph is a realization
  of an Erdös-Rényi graph with probability p0. Under the (composite) alte
 rnative\, there is a subgraph of n nodes where the probability of connecti
 on is p1 &gt\; p0. We derive a detection lower bound for detecting such a 
 subgraph in terms of N\, n\, p0\, p1 and exhibit a test that achieves that
  lower bound. We do this both when p0 is known and unknown. We also consid
 er the problem of testing in polynomial-time. As an aside\, we consider th
 e problem of detecting a clique\, which is intimately related to the plant
 ed clique problem.\nhttps://www6.montpellier.inra.fr/mistea_eng/Members/Li
 st/VERZELEN-Nicolas\n\n&nbsp\;
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 020/01/Nicolas_Verzelen.jpg
CATEGORIES:Séminaire,Probabilités
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20150329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR