-
1
-
-
67651171221
-
Connectivity of the uniform random intersection graph
-
S.R. Blackburn and S. Gerke, "Connectivity of the uniform random intersection graph," Discrete Mathematics 309 (2009), pp. 5130-5140.
-
(2009)
Discrete Mathematics
, vol.309
, pp. 5130-5140
-
-
Blackburn, S.R.1
Gerke, S.2
-
2
-
-
0346408951
-
The diameter of sparse random graphs
-
F. Chung and L. Lu, "The diameter of sparse random graphs," Advances in Applied Mathematics 26 (2001), pp. 257-279.
-
(2001)
Advances in Applied Mathematics
, vol.26
, pp. 257-279
-
-
Chung, F.1
Lu, L.2
-
4
-
-
41549165648
-
Redoubtable sensor networks
-
R. Di Pietro, L.V. Mancini, A. Mei, A. Panconesi and J. Radhakrishnan, "Redoubtable sensor networks," ACM Transactions on Information Systems Security TISSEC 11 (2008), pp. 1-22.
-
(2008)
ACM Transactions on Information Systems Security TISSEC
, vol.11
, pp. 1-22
-
-
Di Pietro, R.1
Mancini, L.V.2
Mei, A.3
Panconesi, A.4
Radhakrishnan, J.5
-
7
-
-
0034391563
-
Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
-
J. Fill, E.R. Scheinerman and K.B. Cohen-Singer, "Random intersection graphs when m = ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models," Random Structures and Algorithms 16 (2000), pp. 249-258.
-
(2000)
Random Structures and Algorithms
, vol.16
, pp. 249-258
-
-
Fill, J.1
Scheinerman, E.R.2
Cohen-Singer, K.B.3
-
8
-
-
33744953201
-
Two models of random intersection graphs for classification
-
Eds. O. Optiz and M. Schwaiger, Springer, Berlin
-
E. Godehardt and J. Jaworski "Two models of random intersection graphs for classification," in Studies in Classification, Data Analysis and Knowledge Organization 22, Eds. O. Optiz and M. Schwaiger, Springer, Berlin (2003), pp. 67-82.
-
(2003)
Studies in Classification, Data Analysis and Knowledge Organization
, vol.22
, pp. 67-82
-
-
Godehardt, E.1
Jaworski, J.2
-
9
-
-
56749176568
-
-
E. Godehardt, J. Jaworski and K. Rybarczyk, Random intersection graphs and classification, in Studies in Classification, Data Analysis and Knowledge Organization 33, Eds. H.J. Lens and R,. Decker, Eds., Springer, Berlin (2007), pp. 67-74.
-
E. Godehardt, J. Jaworski and K. Rybarczyk, "Random intersection graphs and classification," in Studies in Classification, Data Analysis and Knowledge Organization 33, Eds. H.J. Lens and R,. Decker, Eds., Springer, Berlin (2007), pp. 67-74.
-
-
-
-
10
-
-
51849136193
-
A lower-bound on the number of rankings required in recommender systems using collaborative filtering
-
Princeton University, Princeton NJ, March
-
P. Marbach, "A lower-bound on the number of rankings required in recommender systems using collaborative filtering," Proceedings of the 42nd Annual Conference on Information Sciences and Systems (CISS 2008), Princeton University, Princeton (NJ), March 2008.
-
(2008)
Proceedings of the 42nd Annual Conference on Information Sciences and Systems (CISS
-
-
Marbach, P.1
-
11
-
-
0002687371
-
The small world problem
-
S. Milgram, "The small world problem," Psychology Today 2(1967), pp. 60-67.
-
(1967)
Psychology Today
, vol.2
, pp. 60-67
-
-
Milgram, S.1
-
12
-
-
0038718854
-
The structure and function of complex networks
-
M. E. J. Newman, "The structure and function of complex networks," SIAM Review 45 (2003), pp. 167-256.
-
(2003)
SIAM Review
, vol.45
, pp. 167-256
-
-
Newman, M.E.J.1
-
13
-
-
77949631049
-
Diameter, connectivity and phase transition of the uniform random intersection graph
-
July
-
K. Rybarczyk "Diameter, connectivity and phase transition of the uniform random intersection graph," Submitted to Discrete Mathematics, July 2009.
-
(2009)
Submitted to Discrete Mathematics
-
-
Rybarczyk, K.1
-
14
-
-
0032482432
-
Collective dynamics of "small-world" networks
-
D. Watts and S. Strogatz, "Collective dynamics of "small-world" networks," Nature 393 (1998), pp. 440-442.
-
(1998)
Nature
, vol.393
, pp. 440-442
-
-
Watts, D.1
Strogatz, S.2
-
16
-
-
70449514558
-
Connectivity results for random key graphs
-
Seoul Korea, June
-
O. Yaǧan and A. M. Makowski, "Connectivity results for random key graphs," Proceedings of the ISIT 2009, Seoul (Korea), June 2009.
-
(2009)
Proceedings of the ISIT
-
-
Yaǧan, O.1
Makowski, A.M.2
-
17
-
-
77949845325
-
-
O. Yaǧan and A.M. Makowski, Zero-one laws for connectivity in random key graphs, Submitted to Random Structures and Algorithms, August 2009. Available online at arXiv:0908.3644v1 [math.CO]. Earlier draft available online at http://hdl.handle.net/1903/8716, January 2009.
-
O. Yaǧan and A.M. Makowski, "Zero-one laws for connectivity in random key graphs," Submitted to Random Structures and Algorithms, August 2009. Available online at arXiv:0908.3644v1 [math.CO]. Earlier draft available online at http://hdl.handle.net/1903/8716, January 2009.
-
-
-
-
18
-
-
77949823070
-
-
O. Yaǧan and A. M. Makowski, Connectivity in random graphs induced by a key predistribution scheme - Small key pools, Proceedings of the International Conference on Information and Communication Systems (ICICS 2009), Amman (Jordan), December 2009. Also available online at http://hdl.handle.net/1903/9055, January 2009.
-
O. Yaǧan and A. M. Makowski, "Connectivity in random graphs induced by a key predistribution scheme - Small key pools," Proceedings of the International Conference on Information and Communication Systems (ICICS 2009), Amman (Jordan), December 2009. Also available online at http://hdl.handle.net/1903/9055, January 2009.
-
-
-
|