BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//RLASKEY//CALENDEROUS//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTAMP:20261019T074733Z
LAST-MODIFIED:20131001T155712Z
DTSTART:20131008T143000Z
DTEND:20131008T153000Z
UID:event1156@bu.edu
URL:http://physics.bu.edu/internal/events/show/1156
SUMMARY:Generalized Percolation on Random Graphs
DESCRIPTION:Featuring Shuai Shao\n\nPart of the Preliminary Oral Exam.\n\nE
	xamining Committee: H.E. Stanley\, Shlomo Havlin\, Shyam Erramilli\, Kevin 
	Black\n\nAbstract:\n\nPercolation model has been studied extensively for it
	s simplicity and its rich phase transition behaviors. Percolation model on 
	random graphs is a good representation of the attacking process on complex 
	networks and thus provides insight into the study of the robustness of comp
	lex systems. Most previous studies have been focusing on random attack\, wh
	ere each node in the graph exists independently with the same probability. 
	We propose a generalized percolation model on random graphs which describes
	 the non-independent local attacking process. We show the theoretical frame
	work and data from simulations agree well with each other. We compare order
	 parameter and percolation threshold with the random attack model. We also 
	show the critical exponents near phase transition and their deviation from 
	the mean-field theory due to the heterogeneity of the random graphs. \n\n![
	Shuai Shao - POE](/resources/event-image/1156/1593149_original)\n![at trans
	iction - Shuai Shao - POE](/resources/event-image/1156/a7ec82e_small)
LOCATION:PRB 365\, 3 Cummington Mall\, 02215
STATUS:CONFIRMED
CLASS:PUBLIC
END:VEVENT
END:VCALENDAR