Flows on graphs with random capacities

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

Volumn 74, Issue 5, 2006, Pages

  Antal, T ^a   Krapivsky, P L ^b  

^a HARVARD UNIVERSITY   (United States)

^b USA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; HIERARCHICAL SYSTEMS; MAGNETIC FLUX; PROBABILITY; THRESHOLD ELEMENTS; TREES (MATHEMATICS);

BINARY TREES; HIERARCHICAL LATTICES; RANDOM CAPACITIES;

GRAPH THEORY;

EID: 33751019161     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.74.051110     Document Type: Article

References (40)

1. G. M. Coclite, M. Garavello, and B. Piccoli, SIAM J. Math. Anal. SJMAAH 0036-1410 10.1137/S0036141004402683 36, 1862 (2005).
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993).
3. P. Elias, A. Feinstein, and C. E. Shannon, IRE Trans. Inf. Theory IRITAY 0096-1000 10.1109/TIT.1956.1056816 IT-2, 117 (1956).
4. L. R. Ford and D. R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, NJ, 1962).
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. (McGraw-Hill, New York, 2001), Chap.: Maximum Flow, pp. 643â€"700.
6. E. López, S. V. Buldyrev, S. Havlin, and H. E. Stanley, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.94.248701 94, 248701 (2005);
7. D.-S. Lee and H. Rieger, Europhys. Lett. EULEEJ 0295-5075 73, 471 (2006)
8. J. Watson and D. S. Fisher, Phys. Rev. B PRBMDO 0163-1829 10.1103/PhysRevB.54.938 54, 938 (1996);
9. J. Watson and D. S. Fisher, Phys. Rev. B PRBMDO 0163-1829 10.1103/PhysRevB.55.14909 55, 14909 (1997).
10. S. Datta and S. Redner, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.58.R1203 58, R1203 (1998);
11. S. Redner and S. Datta, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.84.6018 84, 6018â€"6021 (2000).
12. M. Cieplak, A. Maritan, and J. R. Banavar, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.72.2320 72, 2320 (1994);
13. M. Cieplak, A. Maritan, and J. R. Banavar, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.76.3754 76, 3754 (1996).
14. S. T. Rachev and L. Ruschendorf, Mass Transportation Problems, (Springer, New York, 1998), Vols. 1 and 2.
15. R. Srikant, The Mathematics of Internet Congestion Control (Birkhäuser, Boston, 2004).
16. S. N. Majumdar and P. L. Krapivsky, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.62.7735 62, 7735 (2000).
17. S. Sreenivasan, T. Kalisky, L. A. Braunstein, S. V. Buldyrev, S. Havlin, and H. E. Stanley, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.70.046133 70, 046133 (2004).
18. E. Mossel and Y. Peres, Ann. Appl. Probab. ZZZZZZ 1050-5164 13, 817 (2003).
19. M. Durand and D. Weaire, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.70.046125 70, 046125 (2004).
20. B. Tadić, G. J. Rodgers, and S. Thurner, e-print physics/0606166.
21. D. Aldous, e-print cond-mat/0502346; e-print
22. D. Aldous, math.PR/0511694.
23. A. N. Berker and S. Ostlund, J. Phys. C JPSOAW 0022-3719 10.1088/0022-3719/12/22/035 12, 4961 (1979);
24. M. Kaufman and R. B. Griffiths, Phys. Rev. B PRBMDO 0163-1829 10.1103/PhysRevB.24.496 24, 496 (1981);
25. M. Kaufman and R. B. Griffiths, Phys. Rev. B PRBMDO 0163-1829 10.1103/PhysRevB.30.244 30, 244 (1984).
26. B. Derrida and R. B. Griffiths, Europhys. Lett. EULEEJ 0295-5075 8, 111 (1989);
27. J. Cook and B. Derrida, J. Stat. Phys. JSTPBS 0022-4715 10.1007/BF01023636 57, 89 (1989).
28. J. Török, S. Krishnamurthy, J. Kertész, and S. Roux, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.67.026108 67, 026108 (2003).
29. R. T. Smythe and H. Mahmoud, Probab. Math. Stat. ZZZZZZ 0208-4147 51, 1 (1995).
30. M. Drmota and B. Gittenberger, Random Struct. Algorithms RSALFD 1042-9832 10.1002/(SICI)1098-2418(199707)10:4<421::AID-RSA2>3.0.CO;2-W 10, 421 (1997);
31. M. Drmota and H.-K. Hwang, Adv. Appl. Probab. AAPBBD 0001-8678 37, 321 (2005).
32. P. L. Krapivsky and S. Redner, Phys. Rev. E PLEEE8 1063-651X 10.1103/PhysRevE.63.066123 63, 066123 (2001);
33. P. L. Krapivsky and S. Redner, Phys. Rev. Lett. PRLTAO 0031-9007 10.1103/PhysRevLett.89.258703 89, 258703 (2002).
34. S. Janson, Random Struct. Algorithms RSALFD 1042-9832 26, 69 (2004);
35. S. Janson, Alea Lat. Am. J. Probab. Math. Stat. 1, 347 (2006)
36. R. B. Dobrow and J. A. Fill (unpublished).
37. Equations 38 38 show that the relative magnitude of fluctuations is Script V sign Script D sign(ln N) 2, so in practice fluctuations can be ignored only for astronomically large recursive trees.
38. J. Krug and T. Halpin-Healy, J. Phys. A JPHAC5 0305-4470 10.1088/0305-4470/31/28/009 31, 5939 (1998).
39. L. de Arcangelis, S. Redner, and A. Coniglio, Phys. Rev. B PRBMDO 0163-1829 10.1103/PhysRevB.31.4725 31, 4725 (1985).
40. R. Rammal, C. Tannous, and A. M. S. Tremblay, Phys. Rev. A PLRAAN 1050-2947 10.1103/PhysRevA.31.2662 31, 2662 (1985).