-
1
-
-
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
-
2
-
-
18744421488
-
Mean-field theory for scale-free random networks
-
A.-L. Barabási, R. Albert, and H. Jeong, Mean-field theory for scale-free random networks, Physica A 272 (1999), 173-187.
-
(1999)
Physica A
, vol.272
, pp. 173-187
-
-
Barabási, A.-L.1
Albert, R.2
Jeong, H.3
-
3
-
-
0342521525
-
Scale-free characteristics of random networks: The topology of the world-wide web
-
A.-L. Barabási, R. Albert, and H. Jeong, Scale-free characteristics of random networks: The topology of the world-wide web, Physica A 281 (2000), 69-77.
-
(2000)
Physica A
, vol.281
, pp. 69-77
-
-
Barabási, A.-L.1
Albert, R.2
Jeong, H.3
-
4
-
-
0035625228
-
The degree sequence of a scale-free random graph process
-
B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády, The degree sequence of a scale-free random graph process, Random Structures Algorithms 18 (2001), 279-290.
-
(2001)
Random Structures Algorithms
, vol.18
, pp. 279-290
-
-
Bollobás, B.1
Riordan, O.2
Spencer, J.3
Tusnády, G.4
-
5
-
-
0033721503
-
Graph structure in the web: Experiments and models
-
A. Z. Broder, S. R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, Graph structure in the web: Experiments and models, Proc 9th WWW Conf 2000, pp. 309-320.
-
Proc 9th WWW Conf 2000
, pp. 309-320
-
-
Broder, A.Z.1
Kumar, S.R.2
Maghoul, F.3
Raghavan, P.4
Rajagopalan, S.5
Stata, R.6
Tomkins, A.7
Wiener, J.8
-
6
-
-
0004269083
-
-
Springer, New York, Heidelberg, Berlin
-
Y. S. Chow and H. Teicher, Probability theory, Springer, New York, Heidelberg, Berlin, 1978.
-
(1978)
Probability Theory
-
-
Chow, Y.S.1
Teicher, H.2
-
8
-
-
84899841718
-
The web as a graph: Measurements, models, and methods
-
Computing and combinatorics (Tokyo, 1999), Springer, New York
-
J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins, "The web as a graph: Measurements, models, and methods," Computing and combinatorics (Tokyo, 1999), Lecture Notes in Comput Sci, 1627, 1-17. Springer, New York, 1999.
-
(1999)
Lecture Notes in Comput Sci
, vol.1627
, pp. 1-17
-
-
Kleinberg, J.1
Kumar, S.R.2
Raghavan, P.3
Rajagopalan, S.4
Tomkins, A.5
-
9
-
-
0034497785
-
Stochastic models for the web graphs
-
IEEE
-
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal, Stochastic models for the web graphs, Proc 41st Foundations of Computer Science (FOCS), IEEE 2000, pp. 57-65.
-
(2000)
Proc 41st 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
-
10
-
-
0039606828
-
Strong consistency of the number of vertices of given degrees in nonuniform random recursive trees
-
J. L. Lu and Q. Feng, Strong consistency of the number of vertices of given degrees in nonuniform random recursive trees, Yokohama Math J 45 (1998), 61-69.
-
(1998)
Yokohama Math J
, vol.45
, pp. 61-69
-
-
Lu, J.L.1
Feng, Q.2
-
12
-
-
84990634414
-
On the structure of plane-oriented recursive trees and their branches
-
H. Mahmoud, R. Smythe, and J. Szymański, On the structure of plane-oriented recursive trees and their branches, Random Structures Algorithms 4 (1993), 151-176.
-
(1993)
Random Structures Algorithms
, vol.4
, pp. 151-176
-
-
Mahmoud, H.1
Smythe, R.2
Szymański, J.3
-
13
-
-
0040792724
-
On the nonuniform random recursive tree
-
J. Szymański, On the nonuniform random recursive tree, Ann Discrete Math 33 (1987), 297-306.
-
(1987)
Ann Discrete Math
, vol.33
, pp. 297-306
-
-
Szymański, J.1
|