University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Vertices of high degree in the preferential attachment tree

Vertices of high degree in the preferential attachment tree

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Discrete Analysis

The preferential attachment tree is the most basic model of evolving web graphs. At each stage of the process, a new vertex is added and joined to one of the existing vertices, with each vertex chosen with probability proportional to its current degree. In probability theory, this is also known as a Yule process.

Much is known about this model, including the fact that the numbers of vertices of each small degree follow a ``power law’’. Here we study in detail the degree sequence of the preferential attachment tree, looking at the vertices of large degrees as well as the numbers of vertices of each fixed degree.

Our method is based on bounding martingale deviations, using exponential supermartingales.

This is joint work with Graham Brightwell.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity