from Part III - Network Models
Published online by Cambridge University Press: 11 June 2026
Preferential attachment models yield graphs that are generated as the result of a growth mechanism. Whenever a vertex is added to the graph, it is joined by edges to a number of the vertices already present in the graph, and these vertices are chosen with reference to their current popularity, as measured by their current degree. Models reflecting this general principle can be formulated in many different ways, some of which are discussed in the chapter. A useful property, observed when popularity is a linear function of degree, is that the degree distribution exhibits a power law decay in the tails, as the number of vertices in the graph increases. Other possible scenarios are also briefly discussed.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.