Seminar at SMU Delhi

July 31, 2013 (Wednesday) , 3:30 PM at Webinar
Speaker: Subhabrata Sen, Indian Statistical Institute, Kolkata
Title: De-preferential Attachment Random Graph Models
Abstract of Talk
We consider a growing sequence of random graphs formed by adding new vertices sequentially to a simple initial configuration and attaching these vertices to some of the existing vertices. Vertices are more likely to attach to existing vertices of low degree and less likely to attach to the ones with high degree. These random graphs are, in a sense, the opposite of the well-studied \emph{preferential attachment random graphs}(Barabasi, Albert [1999]). We call these random graph models \emph{de-preferential attachment random graphs}. We will specify two distinct models of de-preferential attachment which we refer to as linear de-preferential attachment and inverse de-preferential attachment. We will study certain properties of the degree sequences of these random graphs and compare them with the corresponding results for preferential attachment random graphs. We will also examine certain possible applications of these random graph models in ecology and computer science. This work has been done as a part of the dissertation in M.Stat Second Year under the supervision of Dr. Antar Bandyopadhyay.