Zsolt Katona
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Latest Publications
- 27 December 2005
- Published by Wiley in Random Structures & Algorithms
- Vol. 29 (2) , 194-207
Levels of a scale‐free tree
Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices the graph will be a tree. These graphs have been shown to have power law degree distributions, the same as observed in some large real‐world networks. We show that the degree distribution is the same on every sufficiently high level of the tree. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006
- 27 December 2005
- Published by Wiley in Random Structures & Algorithms
- Vol. 29 (2) , 194-207
Levels of a scale‐free tree
Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices the graph will be a tree. These graphs have been shown to have power law degree distributions, the same as observed in some large real‐world networks. We show that the degree distribution is the same on every sufficiently high level of the tree. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006
- 1 September 2005
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 42 (3) , 839-850
Width of a scale-free tree
Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices then this will be a tree. These graphs have been shown to have a power-law degree distribution, the same as that observed in some large real-world networks. We are interested in the width of the tree and we show that it is at the nth step; this also holds for a slight generalization of the model with another constant. We then see how this theoretical result can be applied to directory trees.
- 1 September 2005
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 42 (3) , 839-850
Width of a scale-free tree
Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices then this will be a tree. These graphs have been shown to have a power-law degree distribution, the same as that observed in some large real-world networks. We are interested in the width of the tree and we show that it is at the nth step; this also holds for a slight generalization of the model with another constant. We then see how this theoretical result can be applied to directory trees.