Rodrigo Ribeiro (University of Denver)
Preferential Attachment Random Graphs with Edge Steps
*************************************************************************
Abstract: The random graph model proposed by A.Barabási and R. Albert in the 2000’s is capable of capturing a lot of graph properties observed in real-life networks. In this talk we will see a generalization of the so-called preferential attachment rule which allows connections between already existent vertices with a time-dependent probability. This natural generalization leads to interesting results. We will discuss characterizations for the degree distribution and diameter. If time allows us, we will go over some general ideas behind our proofs.
