On the average path length of deterministic and stochastics recursive networks

Communications in Computer and Information Science

Volumn 116 CCIS, Issue , 2011, Pages 1-12

  Giabbanelli, Philippe J ^a   Mazauric, Dorian ^a   Bermond, Jean Claude ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE PATH LENGTH; CLOSED-FORM FORMULAE; DETERMINISTIC MODELS; EXPECTED DISTANCE; FIRST-ORDER PHASE TRANSITIONS; FRACTAL MODEL; GRAPH-THEORETIC; GRAPH-THEORETIC TECHNIQUE; NETWORK MODELS; PROBABILISTIC TECHNIQUE; REAL-WORLD NETWORKS; RECURSIVE STRUCTURE; SHORTEST PATH; STOCHASTICS; UPPER BOUND;

GRAPH THEORY; PHASE TRANSITIONS;

PROBABILITY;

EID: 81755188400     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-25501-4_1     Document Type: Conference Paper

References (9)

1. Schnettler, S.: Social Networks 31, 165 (2009) ISSN 03788733
2. Giabbanelli, P., Peters, J.: Technique et Science Informatiques (2010) (to appear)
3. Watts, D.J.: Small worlds: the dynamics of networks between order and randomness. Princeton University Press, Princeton (1999)
4. Davidsen, J., Ebel, H., Bornholdt, S.: Phys. Rev. Lett. 88 (2002)
5. Zhang, Z., Chen, L., Zhou, S., Fang, L., Guan, J., Zou, T.: Phys. Rev. E 77 (2008)
6. Zhang, Z., Rong, L., Guo, C.: Physica A 363, 567 (2006)
7. Giabbanelli, P., Mazauric, D., Perennes, S.: Proc. of the 12th AlgoTel (2010)
8. Zhang, Z., Rong, L., Comellas, F.: J. of Physics A 39, 3253 (2006)
9. Cohen, R., Havlin, S.: Phys. Rev. Lett. 90 (2003)