Theoretical Computer Science: Preface

Theoretical Computer Science

Volumn 355, Issue 1, 2006, Pages 1-5

  Kumar, Ravi ^a   Latapy, Matthieu ^b  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTER SIMULATION; MATHEMATICAL MODELS; RESEARCH;

COMPLEX NETWORKS; THEORETICAL COMPUTER SCIENCES;

COMPUTER SCIENCE;

EID: 33644911815     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.12.004     Document Type: Editorial

References (58)

1. D. Achlioptas, A. Clauset, D. Kempe, and C. Moore On the bias of traceroute sampling, or: why almost every network looks like it has a power law ACM Symp. on Theory of Computing (STOC2005) 2005
2. R. Albert, and A.-L. Barabási Statistical mechanics of complex networks Rev. Modern Phys. 74 2002 47
3. R. Albert, H. Jeong, and A.-L. Barabási Error and attack tolerance in complex networks Nature 406 2000 378 382
4. A.-L. Barabasi, and R. Albert Emergence of scaling in random networks Science 286 1999 509 512
5. A. Barrat, M. Barthélemy, R. Pastor-Satorras, A. Vespignani, The architecture of complex weighted networks, Proc. Nat. Acad. Sci. USA 101 (11) (2004) 3747-3752.
6. B. Bollobás A probabilistic proof of an asymptotic formula for the number of labelled regular graphs Europ. J. Combin. 1 1980 311 316
7. B. Bollobas Random Graphs 2001 Cambridge University Press Cambridge, MA
8. A.Z. Broder, S.R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J.L. Wiener Graph structure in the web WWW9/Comput. Networks 33 1-6 2000 309 320
9. CAIDA. skitter, 〈 http://www.caida.org/tools/measurement/skitter/ 〉.
10. D.S. Callaway, M.E. J Newman, S.H. Strogatz, and D.J. Watts Network robustness and fragility: percolation on random graphs Phys. Rev. Lett. 85 2000 5468 5471
11. J. Cho, and H. Garcia-Molina Estimating frequency of change, Technical report 2000 Stanford University California
12. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin Resilience of the internet to random breakdown Phys. Rev. Lett. 85 2000
13. R. Cohen, K. Erez, D. Ben-Avraham, and S. Havlin Breakdown of the internet under intentional attack Phys. Rev. Lett. 86 2001 3682 3685
14. R. Cohen, and S. Havlin Scale free networks are ultrasmall Phys. Rev. Lett. 90 2003
15. L. Dall'Asta, J.I. Alvarez-Hamelin, A. Barrat, A. Vázquez, and A. Vespignan A statistical approach to the traceroute-like exploration of networks: theory and simulations Workshop on Combinatorial and Algorithmic Aspects of Networking 2004
16. S.N. Dorogovtsev, and J.F.F. Mendes Evolution of Networks: From Biological Nets to the Internet and WWW 2000 Oxford University Press UK
17. S.N. Dorogovtsev, and J.F.F. Mendes Evolution of networks Adv. Phys. 51 2002
18. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin Metric structure of random networks Nucl. Phys. B 653 2003 307
19. K. Efe, V. Raghavan, C.H. Chu, A.L. Broadwater, L. Bolelli, S. Ertekin, The shape of the web and its implications for searching the web, 2000.
20. P. Erdös, and A. Rényi On random graphs I Publications Mathematics Debrecen 6 1959 290 297
21. M. Faloutsos, P. Faloutsos, and C. Faloutsos On power-law relationships of the internet topology Proc. Internat. ACM Conf. on SIGCOMM 1999 251 262
22. R. Govindan, and H. Tangmunarunkit Heuristics for internet map discovery Proc. IEEE Infocom 2000
23. J.-L. Guillaume, M. Latapy, Bipartite graphs as models of complex networks, in: Lecture Notes in Computer Sciences, Proc. First Internat. Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), 2004.
24. J.-L. Guillaume, and M. Latapy Bipartite structure of all complex networks Inform. Process. Lett. 90 5 2004 215 221
25. J.-L. Guillaume, M. Latapy, Complex network metrology. Complex Systems 16 (2005) 83-94.
26. J.-L. Guillaume, and M. Latapy Relevance of massively distributed explorations of the internet topology: simulation results Proc. 24th IEEE Internat. Conf. on INFOCOM 2005
27. J.-L. Guillaume, M. Latapy, C. Magnien, Comparison of failures and attacks on random and scale-free networks, in: Lecture Notes in Computer Sciences, Proc. Eighth Internat. Conf. on Principles of Distributed Systems (OPODIS), 2004.
28. J.-L. Guillaume, S. Le Blond, M. Latapy, Statistical analysis of a p2p query graph based on degrees and their time-evolution, in: Lecture Notes in Computer Sciences, Proc. Sixth Internat. Workshop on Distributed Computing (IWDC), 2004.
29. J.-L. Guillaume, S. Le Blond, M. Latapy, Clustering in p2p exchanges and consequences on performances, in: Lecture Notes in Computer Sciences, Proc. Fourth Internat. Workshop on Peer-to-Peer Systems (IPTPS), 2005.
30. R. Ferrer i Cancho, R.V. Solé, The small-world of human language, Technical report, Santa Fe Working paper 01-03-016, 2001.
31. H. Jeong, B. Tombor, R. Albert, Z. Oltvai, and A. Barabasi The large-scale organization of metabolic networks Nature 407 2000 651
32. J.M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A.S. Tomkins, The Web as a graph: measurements, models, and methods, in: T. Asano, H. Imai, D.T. Lee, S. Nakano, T. Tokuyama (Eds.), Proc. Fifth Annual Internat. Conf. on Computing and Combinatorics, COCOON, no. 1627. Springer, Berlin, 1999.
33. A. Lakhina, J. Byers, M. Crovella, and P. Xie Sampling biases in IP topology measurements Proc. IEEE Infocom 2003
34. M. Latapy, N. Gast, N. Del Vecchio, Basic notions for the analysis of large affiliation networks/bipartite graphs, 2005, submitted for publication.
35. M. Latapy, C. Magnien, M. Mariadassou, A basic toolbox for the analysis of the dynamics of growing networks, 2005, in preparation.
36. L. Lu The diameter of random massive graphs Proc. 12th Annu. Symp. on Discrete Algorithms (SODA) 2001 912 921
37. C. Magnien, M. Latapy, J.-L. Guillaume, Impact of random failures and attacks on poisson and power-law random networks, 2005, submitted for publication.
38. D. Magoni, and M. Hoerdt Internet core topology mapping and analysis Comput. Comm. 28 2005 494 506
39. M. Molloy, B. Reed. A critical point for random graphs with a given degree sequence. Random Struct. Algorithms, 1995.
40. M.E.J. Newman Scientific collaboration networks: Ii. shortest paths, weighted networks, and centrality Phys. Rev. E 64 2001
41. M.E.J. Newman The structure and function of complex networks SIAM Rev. 45 2 2003 167 256
42. M.E.J. Newman, and M. Girvan Finding and evaluating community structure in networks Phys. Rev. E (Statistical, Nonlinear, and Soft Matter Physics) 69 2 2004
43. M.E.J. Newman, S.H. Strogatz, and D.J. Watts Random graphs with arbitrary degree distributions and their applications Phys. Rev. E 64 2001 (ArXiV preprint cond-mat/0007235)
44. J.-J. Pansiot, and D. Magoni Analysis of the autonomous system network topology ACM SIGCOMM Comput. Comm. Rev. 31 3 2001 26 37
45. R. Pastor-Satorras, and A. Vespignani Epidemic spreading in scale-free networks Phys. Rev. Lett. 86 2001 3200 3203
46. T. Petermann, P. De Los Rios, Exploration of scale-free networks, Europ. Phys. J. B 38 (2) (2004) 21-24.
47. P. Pons, M. Latapy, Computing communities in large networks using random walks, in: Lecture Notes in Computer Sciences, Proc. 20th Internat. Symp. on Computer and Information Sciences (ISCIS), 2005, to appear.
48. P. De Los Rios Exploration bias of complex networks Proc. Seventh Conf. on Statistical and Computational Physics Granada 2002
49. G. Robins, P. Pattison, and J. Woolcock Missing data in networks: exponential random graph (p*) models for networks with non-respondents Social Networks 26 3 2004 257 283
50. N. Spring, R. Mahajan, and D. Wetherall Measuring ISP topologies with Rocketfuel Proc. ACM SIGCOMM 2002
51. S.H. Strogatz Exploring complex networks Nature 410 2001
52. A. Vazquez, R. Pastor-Satorras, A. Vespignani, Internet topology at the router and autonomous system level [cond-mat/0206084].
53. C. von Mering, R. Krause, B. Snel, M. Cornell, S.G. Oliver, S. Fields, and P. Bork Comparative assessment of large-scale data sets of protein-protein interactions Nature 417 2002 399 403
54. T. Walsh Search in a small world Proc. IJCAI 1999
55. S. Wasserman, and K. Faust Social Network Analysis: Methods and Applications 1994 Cambridge University Press Cambridge revised, reprinted edition, 1997
56. D. Watts, and S. Strogatz Collective dynamics of small-world networks Nature 393 1998 440 442
57. H. Peyton Young, The diffusion of innovations in social networks, 2002, Santa Fe Institute working paper 02-04-018.
58. D.H. Zanette Critical behavior of propagation on small-world networks Phys. Rev. E 64 2001