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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Vertices of high degree in the preferential attachment tree

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://zoom.us/j/97166826000?pwd=QzlIMzVZQ0V3MHhFeG5UZExIaFhSdz09 Meeting ID: 971 6682 6000 Passcode: z8dyfgibi8 DAMTP Statistical Physics and Soft Matter Seminar CRUK Cambridge Institute lecture theatre, Li Ka Shing Centre, Robinson Way, Cambridge CB2 0RE

Other talks

Machine Learning for Spectral Geometry and Vice Versa title abstract tba Group Presentation 5 A Few Days in Patagonia - the Deep South Packing the Border: Quail Crates and the Regulation of Animal Movement on the US-Mexico Border, 1910s-1940s Favourite Plants: the common, the captivating, and the curious
 

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