BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//TYPO3/NONSGML News system (news)//EN
BEGIN:VEVENT
UID:news-23226@cs.au.dk
DTSTAMP:20210817T075628Z
DTSTART:20200131T131500Z
DTEND:20200131T140000Z
END:VEVENT
END:VCALENDAR




<div class="news news-single">
	<div class="article" itemscope="itemscope" itemtype="http://schema.org/Article">
		
	
			<script type="text/javascript">
				const showAllContentLangToken = "Vis alt indhold ";
			</script>

			
			

			<article class="typo3-delphinus delphinus-gutters">

				<!-- News PID: 4980 - used for finding folder/page which contains the news / event -->
				<!-- News UID: 23226 - the ID of the current news / event-->

				<div class="news-event">
					<div class="news-event__header">
						<!-- Categories -->
						
							<span class="text--stamp">
<!-- categories -->
<span class="news-list-category">
	
		
	
		
	
		
	
		
	
		
	
		
	
		
	
</span>

</span>
						

						<!-- Title -->
						<h1 itemprop="headline">CS Colloquium - Panagiotis Karras: Robustness in Probabilistic Networks</h1>
						
					</div>

					

					<div class="news-event__content">

						<!-- Events info box -->
						
								

								<div class="news-event__info theme--dark" id="event-info">
									<h2 class="screenreader-only">Oplysninger om arrangementet</h2>

									
											<!--- Same date -->
											<div class="news-event__info__item news-event__info__item--time">
												<h3 class="news-event__info__item__header text--label-header">Tidspunkt</h3>
												<div class="news-event__info__item__content">
													<span class="u-avoid-wrap">
														Fredag 31. januar 2020,
													</span>
													<span class="u-avoid-wrap">
														&nbsp;kl. 14:15 -  15:00
													</span>
													<p class="news-event__info__item__ical-link"><a href="/da/news-events/arrangementer/vis-event?tx_news_pi1%5Baction%5D=detail&amp;tx_news_pi1%5Bcontroller%5D=News&amp;tx_news_pi1%5Bformat%5D=ical&amp;tx_news_pi1%5Bnews%5D=23226&amp;type=9819&amp;cHash=3e6e7214c83088445f108e30fa7ac87c">Tilføj til kalender</a></p>
												</div>
											</div>
										

									<!-- Location detailed -->
									
											<!-- Location Simple -->
											
												<div class="news-event__info__item">
													<h3 class="news-event__info__item__header text--label-header">Sted</h3>
													<div class="news-event__info__item__content">
														<p>Building 5335-016 (Peter Bøgh Andersen Auditoriet)</p>
													</div>
												</div>
											
										

									<!-- Organizer detailed -->
									
											<!-- Organizer Simple -->
											
										

									<!-- Price -->
									

									<!-- Event link -->
									

									<!-- Registration -->
									
								</div>
							

						
							<!-- Media -->
							
								



							
						

						
							<div class="news-event__content__text">
								<span class="text--byline" id="byline">
									

									<!-- Author -->
									
										<span itemprop="author" itemscope="itemscope" itemtype="http://schema.org/Person">
											
													Af
												

											
													<a href="mailto:jras@cs.au.dk">
														<span itemprop="name">Anna Julie Rasmussen</span>
													</a>
												
										</span>
									
								</span>

								

									<!-- Body text -->
									<p>Abstract:</p>
<p>How can we assess a network's ability to maintain its functionality under attacks? While network robustness has been studied extensively in the deterministic case, applications in information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. In this talk, we will discuss three novel robustness measures for networks hosting a diffusion process susceptible to node attacks. The outcome of such a process depends on the selection of its initiators, or seeds, by a seeder, and on two factors outside the seeder's discretion: the attack strategy and probabilistic outcomes. </p>
<p> &nbsp; Each of our measures corresponds to a level of seeder awareness regarding these factors and evaluates the network's viability over all possible extents of attack. We introduce novel algorithms to evaluate these measures. An experimental study with synthetic and real, scale-free and homogeneous networks shows that these algorithms are effective and efficient, while the proposed measures highlight differences among networks in terms of the surprise they furnish when attacked. These results inform the design of robust probabilistic networks.&nbsp; &nbsp;&nbsp;</p>
<p>***</p>
								
							</div>
						
					</div>

					
						<!-- Content elements -->
						
					
				</div>
			</article>

			
				
				
			

			<!-- related things -->
			
		

	</div>
</div>
