-
1
-
-
0034721164
-
Error and attack tolerance of complex networks
-
R. Albert, H. Jeong, and A.-L. Barabási Error and attack tolerance of complex networks Nature 406 2000 378 382
-
(2000)
Nature
, vol.406
, pp. 378-382
-
-
Albert, R.1
Jeong, H.2
Barabási, A.-L.3
-
2
-
-
4243939794
-
Network robustness and fragility: Percolation on random graphs
-
D. Callaway, M. Newman, S. Strogatz, and D. Watts Network robustness and fragility: percolation on random graphs Phys. Rev. Lett. 85 2000 5468 5471
-
(2000)
Phys. Rev. Lett.
, vol.85
, pp. 5468-5471
-
-
Callaway, D.1
Newman, M.2
Strogatz, S.3
Watts, D.4
-
5
-
-
84906244198
-
Robustness and vulnerability of scale-free random graphs
-
B. Bollobás, and O. Riordan Robustness and vulnerability of scale-free random graphs Internet Math. 1 1 2003 1 35
-
(2003)
Internet Math.
, vol.1
, Issue.1
, pp. 1-35
-
-
Bollobás, B.1
Riordan, O.2
-
6
-
-
84906214576
-
Coupling scale-free and classical random graphs
-
B. Bollobás, and O. Riordan Coupling scale-free and classical random graphs Internet Math. 1 2 2004 215 225
-
(2004)
Internet Math.
, vol.1
, Issue.2
, pp. 215-225
-
-
Bollobás, B.1
Riordan, O.2
-
7
-
-
0033721503
-
Graph structure in the Web
-
A. Broder, S. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener Graph structure in the Web Proceedings of the 9th International World Wide Web Conference 2000 309 320
-
(2000)
Proceedings of the 9th International World Wide Web Conference
, pp. 309-320
-
-
Broder, A.1
Kumar, S.2
Maghoul, F.3
Raghavan, P.4
Rajagopalan, S.5
Stata, R.6
Tomkins, A.7
Wiener, J.8
-
8
-
-
0000544704
-
On the evolution of random graphs
-
P. Erdos, and A. Rényi On the evolution of random graphs Bull. Inst. Int. Stat. 38 1961 343 347
-
(1961)
Bull. Inst. Int. Stat.
, vol.38
, pp. 343-347
-
-
Erdos, P.1
Rényi, A.2
-
9
-
-
0000290649
-
Highly optimized tolerance
-
J.M. Carlson, and J. Doyle Highly optimized tolerance Phys. Rev. E 60 1999 1412 1427
-
(1999)
Phys. Rev. e
, vol.60
, pp. 1412-1427
-
-
Carlson, J.M.1
Doyle, J.2
-
10
-
-
18144412571
-
Optimization of robustness and connectivity in complex networks
-
B. Shargel, H. Sayama, I. Epstein, and Y. Bar-Yam Optimization of robustness and connectivity in complex networks Phys. Rev. Lett. 90 6 2003 068701
-
(2003)
Phys. Rev. Lett.
, vol.90
, Issue.6
, pp. 068701
-
-
Shargel, B.1
Sayama, H.2
Epstein, I.3
Bar-Yam, Y.4
-
13
-
-
33744908559
-
Network topology generators: Degree-based vs. structural
-
H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, Network topology generators: degree-based vs. structural, ACM SIGCOMM, 2002, pp. 147-159.
-
(2002)
ACM SIGCOMM
, pp. 147-159
-
-
Tangmunarunkit, H.1
Govindan, R.2
Jamin, S.3
Shenker, S.4
-
14
-
-
0038483826
-
Emergence of scaling in random networks
-
A.-L. Barabási, and R. Albert Emergence of scaling in random networks Science 286 1999 509 512
-
(1999)
Science
, vol.286
, pp. 509-512
-
-
Barabási, A.-L.1
Albert, R.2
-
15
-
-
2542530739
-
The diameter of a scale free random graph
-
B. Bollobás, and O. Riordan The diameter of a scale free random graph Combinatorica 4 2004 5 34
-
(2004)
Combinatorica
, vol.4
, pp. 5-34
-
-
Bollobás, B.1
Riordan, O.2
-
17
-
-
0242306028
-
Variations on random graph models for the web
-
Harvard University, Computer Science Group, Cambridge, MA
-
E. Drinea, M. Enachescu, M. Mitzenmacher, Variations on random graph models for the web, Technical Report TR-06-01, Harvard University, Computer Science Group, Cambridge, MA, 2001.
-
(2001)
Technical Report
, vol.TR-06-01
-
-
Drinea, E.1
Enachescu, M.2
Mitzenmacher, M.3
-
18
-
-
0034497785
-
Stochastic models for the web graph
-
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal Stochastic models for the web graph Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS) 2000 57 65
-
(2000)
Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 57-65
-
-
Kumar, R.1
Raghavan, P.2
Rajagopalan, S.3
Sivakumar, D.4
Tomkins, A.5
Upfal, E.6
-
19
-
-
0034310713
-
Structure of growing networks with preferential linking
-
S. Dorogovtsev, J. Mendes, and A. Samukhin Structure of growing networks with preferential linking Phys. Rev. Lett. 85 2000 4633
-
(2000)
Phys. Rev. Lett.
, vol.85
, pp. 4633
-
-
Dorogovtsev, S.1
Mendes, J.2
Samukhin, A.3
-
20
-
-
0016996037
-
A general theory of bibliometric and other cumulative advantage processes
-
D.J. de S. Price A general theory of bibliometric and other cumulative advantage processes J. Am. Soc. Inform. Sci. 27 1976 292 306
-
(1976)
J. Am. Soc. Inform. Sci.
, vol.27
, pp. 292-306
-
-
De, S.1
Price, D.J.2
-
21
-
-
0038562798
-
Inet-3.0: Internet topology generator
-
University of Michigan
-
J. Winick, S. Jamin, Inet-3.0: Internet topology generator, Technical Report CSE-TR-456-02, University of Michigan, 2002.
-
(2002)
Technical Report
, vol.CSE-TR-456-02
-
-
Winick, J.1
Jamin, S.2
-
23
-
-
0041472348
-
Distributed construction of random expander networks
-
C. Law, K.-Y. Siu, Distributed construction of random expander networks, in: IEEE Infocom, 2003.
-
(2003)
IEEE Infocom
-
-
Law, C.1
Siu, K.-Y.2
|