University of Cambridge > > Combinatorics Seminar > Clustering in preferential attachment networks

Clustering in preferential attachment networks

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

  • UserLiudmila Ostroumova Prokhorenkova (Lomonosov Moscow State University)
  • ClockThursday 11 June 2015, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

I will discuss several recent results on the behaviour of the clustering coefficient in preferential attachment networks. There are several classical models of complex networks based on the idea of preferential attachment. First, I will present a general class of preferential attachment models which includes many classical models. Then, I will analyze the degree distribution and the clustering coefficient in this class, considering both global and average local clustering coefficients. Finally, I will discuss some general results on the behaviour of the global clustering coefficient in networks with the power-law degree distribution.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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