BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ISISLab - ECPv6.3.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.isislab.it
X-WR-CALDESC:Eventi per ISISLab
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Rome
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Rome:20230331T120000
DTEND;TZID=Europe/Rome:20230331T120000
DTSTAMP:20260915T180008
CREATED:20230329T180837Z
LAST-MODIFIED:20230329T180838Z
UID:13226-1680264000-1680264000@www.isislab.it
SUMMARY:Seminario: Groups Burning: Analyzing Spreading Processes in Community-based Networks di Gennaro Cordasco
DESCRIPTION:Abstract:Graph burning is a deterministic\, discrete-time process that can be used to model how influence or contagion spreads in a graph. In the graph burning process\, each node starts as dormant\, and becomes informed/burned over time; when a node is burned\, it remains burned until the end of the process. In each round\, one can burn a new node (source of fire) in the network. Once a node is burned in round $t$\, in round $t+1$\, each of its dormant neighbors becomes burned. The process ends when all nodes are burned; the goal is to minimize the number of rounds.We study a variation of graph burning in order to model spreading processes in community-based networks. With respect to a specific piece of information\, a community is {\em satisfied} when this information reaches at least a prescribed number of its members. Specifically\, we consider the problem of identifying a minimum length sequence of nodes that\, according to a graph burning process\, allows to satisfy all the communities of the network.We investigate this NP-hard problem from an approximation point of view\, showing both a lower bound and a matching upper bound. We also investigate the case when the number of communities is constant and show how to solve the problem with a constant approximation factor.Moreover\, we consider the problem of maximizing the number of satisfied groups\, given a budget $k$ on the number of rounds.
URL:https://www.isislab.it/event/seminario-groups-burning-analyzing-spreading-processes-in-community-based-networks-di-gennaro-cordasco/
ATTACH;FMTTYPE=image/jpeg:https://www.isislab.it/wp-content/uploads/2023/03/SeminarioISISLab-31-03-2023.jpg
END:VEVENT
END:VCALENDAR