The Maximum Degree of the Barabási–Albert Random Tree

TAMÁS F. MÓRI

doi:10.1017/S0963548304006133

Abstract

In a one-parameter model for evolution of random trees, which also includes the Barabási–Albert random graph [1], the law of large numbers and the central limit theorem are proved for the maximal degree. In the proofs martingale methods are applied.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Bolla, Marianna 2005. Recognizing linear structure in noisy matrices. Linear Algebra and its Applications, Vol. 402, Issue. , p. 228.

Móri, Tamás F. 2006. A surprising property of the Barabási--Albert random tree. Studia Scientiarum Mathematicarum Hungarica, Vol. 43, Issue. 2, p. 265.

Katona, Zsolt and Móri, Tamás F. 2006. A new class of scale free random graphs. Statistics & Probability Letters, Vol. 76, Issue. 15, p. 1587.

Duchon, Philippe Eggemann, Nicole and Hanusse, Nicolas 2007. Principles of Distributed Systems. Vol. 4878, Issue. , p. 274.

Móri, T. F. 2007. On a 2-parameter class of scale free random graphs. Acta Mathematica Hungarica, Vol. 114, Issue. 1-2, p. 37.

Duchon, Philippe Eggemann, Nicole and Hanusse, Nicolas 2007. Non-searchability of random scale-free graphs. p. 380.

Hwang, Hsien‐Kuei 2007. Profiles of random trees: Plane‐oriented recursive trees. Random Structures & Algorithms, Vol. 30, Issue. 3, p. 380.

Athreya, Krishna B. Ghosh, Arka P. and Sethuraman, Sunder 2008. Growth of preferential attachment random graphs via continuous-time branching processes. Proceedings Mathematical Sciences, Vol. 118, Issue. 3, p. 473.

Drmota, Michael 2009. The Height of Increasing Trees. Annals of Combinatorics, Vol. 12, Issue. 4, p. 373.

Musin, M. M. 2010. An estimate of the probability of localisation of the diameter of a random scale-free graph. Discrete Mathematics and Applications, Vol. 20, Issue. 5-6,

Móri, Tamás 2010. Random multitrees. Studia Scientiarum Mathematicarum Hungarica, Vol. 47, Issue. 1, p. 59.

Мусин, Максим Маратович and Musin, Maksim Maratovich 2010. Оценка вероятности локализации диаметра случайного графа преимущественного присоединения. Дискретная математика, Vol. 22, Issue. 3, p. 34.

Dommers, Sander van der Hofstad, Remco and Hooghiemstra, Gerard 2010. Diameters in Preferential Attachment Models. Journal of Statistical Physics, Vol. 139, Issue. 1, p. 72.

Deijfen, Maria 2010. Random Networks with Preferential Growth and Vertex Death. Journal of Applied Probability, Vol. 47, Issue. 4, p. 1150.

Eggemann, N. and Noble, S.D. 2011. The clustering coefficient of a scale-free random graph. Discrete Applied Mathematics, Vol. 159, Issue. 10, p. 953.

Backhausz, Agnes 2011. Limit distribution of degrees in random family trees. Electronic Communications in Probability, Vol. 16, Issue. none,

Bhamidi, Shankar Evans, Steven N. and Sen, Arnab 2012. Spectra of Large Random Trees. Journal of Theoretical Probability, Vol. 25, Issue. 3, p. 613.

Ostroumova, Liudmila Ryabchenko, Alexander and Samosvat, Egor 2013. Algorithms and Models for the Web Graph. Vol. 8305, Issue. , p. 185.

Peköz, Erol A. Röllin, Adrian and Ross, Nathan 2013. Degree asymptotics with rates for preferential attachment random graphs. The Annals of Applied Probability, Vol. 23, Issue. 3,

Download full list

Article contents

The Maximum Degree of the Barabási–Albert Random Tree

Abstract

Access options

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Article contents

The Maximum Degree of the Barabási–Albert Random Tree

Abstract

Access options

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests