Tree networks with causal structure

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 67, Issue 6 2, 2003, Pages

  Bialas, P ^a   Burda, Z ^a   Jurkiewicz, J ^a   Krzywicki, A ^b  

^a JAGIELLONIAN UNIVERSITY   (Poland)

^b UNIVERSITÉ PARIS SUD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; CONVERGENCE OF NUMERICAL METHODS; CORRELATION METHODS; DIFFERENTIAL EQUATIONS; GRAPH THEORY; INTEGRAL EQUATIONS; ITERATIVE METHODS; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; POISSON DISTRIBUTION; RANDOM PROCESSES;

ANCESTOR-DESCENDANT CORRELATION; CAUSAL STRUCTURE; DEGREE DISTRIBUTION; HAUSDORFF DIMENSION; INTERNODE CORRELATION; PLANTED TREE; ROOTED TREE;

STATISTICAL MECHANICS;

EID: 42749101974     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (45)

1. Recent advances in network studies are reviewed in R. Albert and A.-L. Barabasi, Rev. Mod. Phys. 74, 47 (2002)
2. S.N. Dorogovtsev and J.F.F. Mendes, Adv. Phys. 51, 1079 (2002).
3. S.N. Dorogovtsev and J.F.F. Mendes, Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford University Press, New York, 2003), and references below.
4. B. Bollobas, Random Graphs (Academic Press, London 1985).
5. Z. Burda, J.D. Correia, and A. Krzywicki, Phys. Rev. E 64, 046118 (2001).
6. L. Barabasi and R. Albert, Science 286, 509 (1999)
7. L. Barabasi, R. Albert and H. Jeong, Physica A 272, 173 (1999).
8. P.L. Krapivsky and S. Redner, Phys. Rev. E 63, 066123 (2001).
9. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, Phys. Rev. Lett. 85, 4633 (2000).
10. S.N. Dorogovtsev and J.F.F. Mendes, Phys. Rev. E 62, 1842 (2000).
11. S.N. Dorogovtsev and J.F.F. Mendes, Europhys. Lett. 52, 33 (2000).
12. S. Bornboldt and H. Ebel, Phys. Rev. E 64, 035104 (2001).
13. P.L. Krapivsky and S. Redner, J. Phys. A 35, 9517 (2002).
14. K. Klemm and V.M. Equiluz, Phys. Rev. E 65, 036123 (2002).
15. A. Vazquez, M. Boguna, Y. Moreno, R. Pastor-Satorras, and A. Vespignani, e-print cond-mat/0209183.
16. A. Vazquez, e-print cond-mat/0211528.
17. A. Vazquez, A. Flammini, A. Maritan, and A. Vespignani, e-print cond-mat/0108043
18. G. Bianconi and A. Capocci, e-print cond-mat/0212028.
19. S. Coulomb and M. Bauer, e-print cond-mat/212371
20. J. Kim, P.L. Krapivsky, B. Kahng, and S. Redner, Phys. Rev. E 66, 055101 (2002).
21. H. Ebel, J. Davidsen, and S. Bornholdt, e-print cond-mat/0301260.
22. J. Berg, M. Lässig, and A. Wagner, e-print cond-mat/0207711.
23. M.E.J. Newman, S.H. Strogatz, and D.J. Watts, Phys. Rev. E 64, 026118 (2001).
24. Z. Burda and A. Krzywicki, e-print cond-mat/0207020.
25. M. Bauer, and D. Bernard, e-print cond-mat/0206150.
26. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, e-print cond-mat/0204111.
27. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, e-print cond-mat/0206131.
28. J. Berg and M. Lässig, Phys. Rev. Lett. 89 228701 (2002).
29. R. Cohen, D. Ben-Avraham, and S. Havlin, Phys. Rev. E 66, 036113 (2002).
30. S.N. Dorotgovtsev, J.F.F. Mendes, and A.N. Samukhin, e-print cond-mat/0206467.
31. J.H. Kim, K.I. Goh, B. Kahng, and D. Kim, e-print cond-mat/0212271.
32. A. Fronczak, P. Fronczak, and J.A. Holyst, e-print cond-mat/0212230
33. A classical reference to tree graphs is G. Polya and R.C. Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds (Springer, New York, 1987)
34. A modern and very accessible starting point for a study of analytic combinatorics is the book project by P. Flajolet and R. Sedgewick, http://algo.inria.fr/flajolet.Publications/books.html
35. n are the minifield theory couplings. However, in Ref. [3] all labelings were accepted (maximum entropy model), while in this paper we impose the causality constraint satisfied within a subclass of labelings only.
36. The structure of a causal tree is determined if one gives the labels of the parents of each node. The root has label 1 and no parent. The node with label has only one parent, the root. There are two candidates for being the parent of the node with label 3: the root and the node with label 2. There are three candidates for being the parent of the node with label 3, etc. Pursuing the argument and counting the number of distinct trees, one obtains the result quoted in the text.
37. n.
38. P. Bialas, Z. Burda, and J. Johnston, Nucl. Phys. B542, 413 (1999).
39. J. Ambjørn, B. Durhuus, and T. Jònnson, Phys. Lett. B 244, 403 (1990).
40. J. Jurkiewicz and A. Krzywicki, Phys. Lett. B 392, 291 (1997) erratum: last five lines of Sec. 3.2 erroneous.
41. For other kernels, one could perhaps make the appoximation done by the authors of Ref.[6], i.e., assume that A(t) = μN.
42. Those factors may be important if one wants to consider the thermodynamic limit N→∞.
43. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, Phys. Rev. Lett. 85, 4633 (2000).
44. P. Bialas and Z. Burda, Phys. Lett. B 384, 75 (1996).
45. A. Krzywicki, e-print cond-mat/0110574.