Degree asymptotics with rates in preferential attachment random graphs
Sep 9, 2011, 01:00 PM - 02:00 PM | 740 Evans Hall | Happening As Scheduled
Nathan Ross, UC Berkeley
Preferential attachment random graphs evolve in time by sequentially adding vertices and edges in a random way so that connections to vertices having high degree are favored. Particular versions of these models were (re)introduced by Barabasi and Albert in 1999 to explain the so-called power law behavior observed in some real world networks, for example the graph derived from the world wide web...