-
1
-
-
78651328334
-
Incentivizing intermediaries in social networks
-
N. Kota and Y. Narahari. Incentivizing Intermediaries in Social Networks. Working Paper, 2010.
-
(2010)
Working Paper
-
-
Kota, N.1
Narahari, Y.2
-
2
-
-
20444434710
-
How to search a social network
-
L. A. Adamic and E. Adar. How to search a social network. In Social Networks, volume 27, 2005.
-
(2005)
Social Networks
, vol.27
-
-
Adamic, L.A.1
Adar, E.2
-
3
-
-
35348871999
-
Analysis of topological characteristics of huge online social networking services
-
Y.-Y. Ahn, S. Han, H. Kwak, S. Moon, and H. Jeong. Analysis of topological characteristics of huge online social networking services. In WWW '07, 2007.
-
(2007)
WWW '07
-
-
Ahn, Y.-Y.1
Han, S.2
Kwak, H.3
Moon, S.4
Jeong, H.5
-
4
-
-
0035627527
-
A random graph model for power law graphs
-
W. Aiello, F. Chung, and L. Lu. A random graph model for power law graphs. Experimental Math, 10:53-66, 2000.
-
(2000)
Experimental Math
, vol.10
, pp. 53-66
-
-
Aiello, W.1
Chung, F.2
Lu, L.3
-
5
-
-
78651313210
-
On threshold behavior in query incentive networks
-
E. Arcaute, A. Kirsch, R. Kumar, D. Liben-Nowell, and S. Vassilvitskii. On threshold behavior in query incentive networks. In ACM EC '07, 2007.
-
(2007)
ACM EC '07
-
-
Arcaute, E.1
Kirsch, A.2
Kumar, R.3
Liben-Nowell, D.4
Vassilvitskii, S.5
-
6
-
-
84906264352
-
The average distance in a random graph with given expected degrees
-
F. R. K. Chung and L. Lu. The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1), 2003.
-
(2003)
Internet Mathematics
, vol.1
, Issue.1
-
-
Chung, F.R.K.1
Lu, L.2
-
7
-
-
65549085067
-
Power-law distributions in empirical data
-
A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data. SIAM Rev., 51(4):661-703, 2009.
-
(2009)
SIAM Rev.
, vol.51
, Issue.4
, pp. 661-703
-
-
Clauset, A.1
Shalizi, C.R.2
Newman, M.E.J.3
-
8
-
-
3242802867
-
Robust incentive techniques for peer-to-peer networks
-
M. Feldman, K. Lai, I. Stoica, and J. Chuang. Robust incentive techniques for peer-to-peer networks. In ACM EC '04, pages 102-111, 2004.
-
(2004)
ACM EC '04
, pp. 102-111
-
-
Feldman, M.1
Lai, K.2
Stoica, I.3
Chuang, J.4
-
9
-
-
33748615434
-
Query incentive networks
-
DOI 10.1109/SFCS.2005.63, 1530708, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005
-
J. Kleinberg and P. Raghavan. Query incentive networks. In FOCS '05, pages 132-141, 2005. (Pubitemid 44375726)
-
(2005)
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
, vol.2005
, pp. 132-141
-
-
Kleinberg, J.1
Raghavan, P.2
-
10
-
-
78651298364
-
An incentive mechanism for message relaying in unstructured peer-to-peer systems
-
C. Li, B. Yu, and K. Sycara. An incentive mechanism for message relaying in unstructured peer-to-peer systems. In AAMAS '07, pages 1-8, 2007.
-
(2007)
AAMAS '07
, pp. 1-8
-
-
Li, C.1
Yu, B.2
Sycara, K.3
-
11
-
-
42149117427
-
Measurement and analysis of online social networks
-
A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In IMC '07, pages 29-42, 2007.
-
(2007)
IMC '07
, pp. 29-42
-
-
Mislove, A.1
Marcon, M.2
Gummadi, K.P.3
Druschel, P.4
Bhattacharjee, B.5
-
13
-
-
1142305174
-
Searching social networks
-
B. Yu and M. P. Singh. Searching social networks. In AAMAS '03, pages 65-72, 2003.
-
(2003)
AAMAS '03
, pp. 65-72
-
-
Yu, B.1
Singh, M.P.2
-
14
-
-
77950322772
-
Searching for expertise in social networks: A simulation of potential strategies
-
J. Zhang and M. S. Ackerman. Searching for expertise in social networks: a simulation of potential strategies. In GROUP '05, pages 71-80, 2005.
-
(2005)
GROUP '05
, pp. 71-80
-
-
Zhang, J.1
Ackerman, M.S.2
|