From technological networks to social networks

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 9, 2013, Pages 548-572

  Chen, Kwang Cheng ^a   Chiang, Mung ^b   Poor, H Vincent ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b Princeton University   (United States)

Author keywords

big data; data analysis; information epidemics; Internet; network economy; network science; networked data; random graph; social behavior; Social networks; statistical communication theory; statistical information processing

Indexed keywords

BIG DATUM; INFORMATION EPIDEMICS; NETWORK ECONOMY; NETWORK SCIENCE; NETWORKED DATUM; RANDOM GRAPHS; SOCIAL BEHAVIOR; STATISTICAL INFORMATION;

COMPUTER AIDED NETWORK ANALYSIS; DATA PROCESSING; DATA REDUCTION; GRAPH THEORY; INTERNET; TELECOMMUNICATION;

SOCIAL NETWORKING (ONLINE);

EID: 84883382823     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.SUP.0513049     Document Type: Article

References (189)

1. D. J. Watts and S. H. Strogatz, "Collective dynamics of 'small-world'networks," Nature, vol. 393, pp. 440-442, 1998.
2. A.-L. Barabási and R. Albert, "Emergence of scaling in randomnetworks," Science, vol. 286, no. 5439, pp. 509-512, 1999.
3. S. H. Strogatz, "Exploring complex networks," Nature, vol. 410, pp.268-276, Mar. 2001. (Pubitemid 32216604)
4. R. Albert and A.-L. Barabási, "Statistical mechanics of complexnetworks," Reviews of Modern Physics, vol. 74, pp. 47-97, Jan. 2002.
5. M. E. J. Newman, "The structure and function of complex networks,"SIAM Review, vol. 45, no. 2, pp. 167-256, 2003.
6. S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang,"Complex networks: Structure and dynamics," Physics Reports, vol.424, no. 4-5, pp. 175-308, 2006. (Pubitemid 43135890)
7. A.-L. Barabási, "Scale-free networks: A decade and beyond," Science,vol. 325, no. 5939, pp. 412-413, 2009.
8. M. Chiang, Networked Life: 20 Questions and Answers. CambridgeUniversity Press, 2012.
9. T. Berners-Lee, W. Hall, J. A. Hendler, K. O'Hara, N. Shadbolt, andD. J. Weitzner, "A framework for web science," Found. Trends WebSci., vol. 1, pp. 1-130, Jan. 2006. (Pubitemid 44590982)
10. Y. Breitbart, M. Garofalakis, C. Martin, R. Rastogi, S. Seshadri, andA. Silberschatz, "Topology discovery in heterogeneous IP networks,"in Proc. IEEE INFOCOM 2000. Nineteenth Annual Joint Conferenceof the IEEE Computer and Communications Societies, vol. 1, 2000,pp. 265-274 vol 1 (Pubitemid 30584585)
11. Y. Breitbart, M. Garofalakis, B. Jai, C. Martin, R. Rastogi, andA. Silberschatz, "Topology discovery in heterogeneous IP networks:The netinventory system," IEEE/ACM Trans. Netw., vol. 12, no. 3, pp.401-414, Jun. 2004.
12. B. Donnet and T. Friedman, "Internet topology discovery: A survey,"IEEE Commun. Surveys Tuts., vol. 9, no. 4, pp. 56-69, quarter 2007.
13. H. Haddadi, M. Rio, G. Iannaccone, A. Moore, and R. Mortier, "Networktopologies: inference, modeling, and generation," IEEE Commun.Surveys Tuts., vol. 10, no. 2, pp. 48-69, 2008.
14. J. Kleinberg, "The convergence of social and technological networks,"Commun. ACM, vol. 51, pp. 66-72, Nov. 2008.
15. H. A. Simon, "A formal theory of interaction in social groups,"American Sociological Review, vol. 17, no. 2, pp. pp. 202-211, 1952.
16. A. Rapoport, "Contribution to the theory of random and biased nets,"The Bulletin of Mathematical Biophysics, vol. 19, pp. 257-277, 1957.
17. S. Milgram, "The small world problem," Psychology Today, vol. 1, pp.61-67, May 1967.
18. S. P. Borgatti, A. Mehra, D. J. Brass, and G. Labianca, "Networkanalysis in the social sciences," Science, vol. 323, no. 5916, pp. 892-895, 2009.
19. J. Bilmes, "Dynamic graphical models," IEEE Signal Process. Mag.,vol. 27, no. 6, pp. 29-42, Nov. 2010.
20. D. Barber and A. Cemgil, "Graphical models for time-series," IEEESignal Process. Mag., vol. 27, no. 6, pp. 18-28, Nov. 2010.
21. M. Newman, Networks: An Introduction, Oxford University Press,2010.
22. D. Easley and J. Kleinberg, Networks, Crowds, and Markets: ReasoningAbout a Highly Connected World. Cambridge University Press,2010.
23. M. O. Jackson, Social and Economic Networks. Princeton University Press, Aug. 2008.
24. B. Bollobas, Random Graphs, W. Fulton, A. Katok, F. Kirwan,P. Sarnak, B. Simon, and B. Totaro, Eds. Cambridge University Press,2001.
25. P. Erdös and A. Rényi, "On random graphs, I," Publicationes Mathematicae(Debrecen), vol. 6, pp. 290-297, 1959.
26. M. Singh and M. Valtorta, "Construction of Bayesian network structures from data: A brief survey and an efficient algorithm," InternationalJournal of Approximate Reasoning, vol. 12, no. 2, pp. 111-131, 1995.
27. F. V. Jensen and T. D. Nielsen, Bayesian Networks and DecisionGraphs, 2nd ed. Springer, 2007.
28. R. T. Cox, "Probability, frequency and reasonable expectation," AmericanJournal of Physics, vol. 14, no. 1, pp. 1-13, Jan. 1946.
29. M. Girvan and M. E. J. Newman, "Community structure in social andbiological networks," Proc. National Academy of Sciences, vol. 99,no. 12, pp. 7821-7826, Jun. 2002. (Pubitemid 34650963)
30. M. E. J. Newman and J. Park, "Why social networks are different fromother types of networks," Phys. Rev. E, vol. 68, p. 036122, Sep. 2003.
31. S. Zhou and R. Mondragon, "The rich-club phenomenon in the internettopology," IEEE Commun. Lett., vol. 8, no. 3, pp. 180-182, Mar. 2004.
32. I. S. Dhillon, S. Mallela, and D. S. Modha, "Information-theoretic coclustering,"in Proc. ninth ACM SIGKDD International Conference onKnowledge Discovery and Data Mining, 2003, pp. 89-98.
33. M. E. J. Newman, "Modularity and community structure in networks,"Proc. National Academy of Sciences, vol. 103, no. 23, pp. 8577-8582,Jun. 2006. (Pubitemid 43878062)
34. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek, "Uncovering theoverlapping community structure of complex networks in nature and society," Nature, vol. 435, pp. 814-818, Jun. 2005. (Pubitemid 40839731)
35. J. P. Onnela, J. Saramäki, J. Hyvönen, G. Szabó, D. Lazer, K. Kaski,J. Kertész, and A. L. Barabási, "Structure and tie strengths in mobilecommunication networks," Proc. National Academy of Sciences, vol.104, no. 18, pp. 7332-7336, May 2007.
36. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graph evolution: Densificationand shrinking diameters," ACM Trans. Knowl. Discov. Data,vol. 1, no. 1, article 2, Mar. 2007.
37. T. A. Snijders, G. G. van de Bunt, and C. E. Steglich, "Introduction tostochastic actor-based models for network dynamics," Social Networks,vol. 32, no. 1, pp. 44-60, 2010.
38. R. Xiang, J. Neville, and M. Rogati, "Modeling relationship strengthin online social networks," in Proc. 19th International Conference onWorld Wide Web, 2010, pp. 981-990.
39. B. Yu and M. P. Singh, "Searching social networks," in Proc. SecondInternational Joint Conference on Autonomous agents and Multiagent Systems, 2003, pp. 65-72.
40. P. Costa, C. Mascolo, M. Musolesi, and G. Picco, "Socially-aware routingfor publish-subscribe in delay-tolerant mobile ad hoc networks,"IEEE J. Sel. Areas Commun., vol. 26, no. 5, pp. 748-760, Jun. 2008. (Pubitemid 351780193)
41. H. V. Poor, An Introduction to Signal Detection and Estimation (2nded.), Springer-Verlag, 1994.
42. E. Stai, V. Karyotis, and S. Papavassiliou, "Socially-inspired topologyimprovements in wireless multi-hop networks," in 2010 IEEE InternationalConference on Communications Workshops (ICC), May 2010,pp. 1-6.
43. S. Cui, A. M. Haimovich, O. Somekh, H. V. Poor, and S. Shamai,"Throughput scaling of wireless networks with random connections,"IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3793-3806, Aug. 2010.
44. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationshipsof the internet topology," in Proc. Conference on Applications,Technologies, Architectures, and Protocols for Computer Communication,1999, pp. 251-262.
45. M. Roughan, W. Willinger, O. Maennel, D. Perouli, and R. Bush,"10 lessons from 10 years of measuring and modeling the internet'sautonomous systems," IEEE J. Sel. Areas Commun., vol. 29, no. 9, pp.1810-1821, Oct. 2011.
46. D. Achlioptas, A. Clauset, D. Kempe, and C. Moore, "On the biasof traceroute sampling: Or, power-law degree distributions in regulargraphs," in Proc. Thirty-seventh Annual ACM Symposium on Theoryof Computing, 2005, pp. 694-703. (Pubitemid 43098642)
47. M. Mitzenmacher, "A brief history of generative models for power lawand lognormal distributions," Internet Mathematics, vol. 1, pp. 226-249, 2003.
48. R. Albert, H. Jeong, and A.-L. Barabási, "Error and attack toleranceof complex networks," Nature, vol. 406, pp. 378-382, Jul. 2000. (Pubitemid 30625551)
49. D. Alderson, L. Li, W. Willinger, and J. Doyle, "Understanding internettopology: principles, models, and validation," IEEE/ACM Trans. Netw.,vol. 13, no. 6, pp. 1205-1218, Dec. 2005. (Pubitemid 43034130)
50. L. Gyarmati and T. A. Trinh, "Measuring user behavior in online socialnet works," IEEE Netw., vol. 24, no. 5, pp. 26-31, Sep. 2010.
51. H. Gao, J. Hu, T. Huang, J. Wang, and Y. Chen, "Security issues inonline social networks," IEEE Internet Comput., vol. 15, no. 4, pp.56-63, Jul. 2011.
52. A. P. Dempster, "New methods for reasoning towards posterior distributionsbased on sample data," The Annals of Mathematical Statistics,vol. 37, no. 2, pp. 355-374, Apr. 1966.
53. G. Shafer, "Belief functions and parametric models," J. Royal StatisticalSociety. Series B (Methodological), vol. 44, no. 3, pp. 322-352,1982.
54. P. Resnick and R. Zeckhauser, "Trust among strangers in Internettransactions: Empirical analysis of eBay's reputation system. theeconomics of the Internet and e-commerce," in Advances in AppliedMicroeconomics, M. R. Baye, Ed. Amsterdam, Elsevier Science, 2002,vol. 11, pp. 127-157.
55. Y. Wang and J. Vassileva, "Trust and reputation model in peer-to-peernetworks," in Proc. P2P '03, Sep. 2003, pp. 150-157.
56. S. Buchegger and J.-Y. L. Boudec, "Performance analysis of the CONFIDANT protocol," in Proc. ACM MobiHoc '02, Jun. 2002, pp.226-236.
57. Y. L. Sun, W. Yu, Z. Han, and K. J. R. Liu, "Information theoreticframework of trust modeling and evaluation for ad hoc networks," IEEEJ. Sel. Areas Commun., vol. 24, no. 2, pp. 305-317, Feb. 2006.
58. G. Theodorakopoulos and J. S. Baras, "On trust models and trustevaluation metrics for ad hoc networks," IEEE J. Sel. Areas Commun.,vol. 24, no. 2, pp. 318-328, Feb. 2006. (Pubitemid 43269752)
59. A. Josang, R. Ismail, and C. Boyd, "A survey of trust and reputationsystems for online service provision," Decision Support Systems,vol. 43, no. 2, p. 618V644, Mar. 2007.
60. M. Gjoka, M. Kurant, C. T. Butts, and A. Markopoulou, "Practicalrecommendations on crawling online social networks," IEEE J. Sel.Areas Commun., vol. 29, no. 9, pp. 1872-1892, Oct. 2011.
61. M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou, "Multigraphsampling of online social networks," IEEE J. Sel. Areas Commun.,vol. 29, no. 9, pp. 1893-1905, Oct. 2011.
62. U. Kuter and J. Golbeck, "Using probabilistic confidence models fortrust inference in web-based social networks," ACM Trans. InternetTechnology, vol. 3, no. 1, Oct. 2010.
63. S. Zhao, M. X. Zhou, X. Zhang, Q. Yuan, W. Zheng, and R. Fu,"Who is doing what and when: Social map-based recommendation forcontent-centric social web sites," ACM Trans. Intelligent Systems andTechnology, vol. 3, no. 1, Oct. 2011.
64. H. Ma, I. King, and M. R. Lyu, "Learning to recommend with explicitand implicit social relations," ACM Trans. Intelligent Systems andTechnology, vol. 2, no. 3, Apr. 2011.
65. D. Riphagen, "Privacy Risks for Users of Social Network Sites," Master'sthesis, Systems Engineering, Policy Analysis and Management,Delft University of Technology, Delft, The Netherlands, 2008.
66. K. Liu and E. Terzi, "A framework for computing the privacy scoresof users in online social networks," ACM Trans. Knowledge Discoveryfrom Data, vol. 5, pp. 6:1-6:30, Dec. 2010.
67. R. Gross and A. Acquisti, "Information revelation and privacy in onlinesocial networks (the Facebook case)," in Proc. 2005 ACM Workshopon Privacy in the Electronic Society, 2005, pp. 71-80. (Pubitemid 44447420)
68. J. Becker and H. Chen, "Measuring privacy risk in online socialnet works," in Proc. Web 2.0 Security & Privacy, Oakland, CA, May 2009.
69. F. Adu-Oppong, C. K. Gardiner, A. Kapadia, and P. P. Tsang, "Socialcircles: Tackling privacy in social networks," in Proc. Symposium onUsable Privacy and Security, Pittsburgh, PA, Jul. 2008.
70. A. Beach, M. Gartrell, and R. Han, "Solutions to security and privacyissues in mobile social networking," in Proc. International Conferenceon Computational Science and Engineering, 2009. CSE '09, vol. 4,Aug. 2009, pp. 1036-1042.
71. L. Sankar, S. R. Rajagopalan, and H. V. Poor, "An information-theoreticapproach to privacy," in Proc. 48th Annual Allerton Conference onCommunication, Control, and Computing, Oct. 2010, pp. 1220-1227.
72. L. Sankar, S. Rajagopalan, and H. V. Poor, "A theory of utility andprivacy of data sources," in Proc. 2010 IEEE International Symposiumon Information Theory, Jun. 2010, pp. 2642-2646.
73. R. Tandon, L. Sankar, and H. V. Poor, "Discriminatory lossy sourcecoding: Side information privacy," in Proc. 2011 IEEE Global CommunicationsConference, Dec. 2011, pp. 1-5.
74. T. N. Jagatic, N. A. Johnson, M. Jakobsson, and F. Menczer, "Socialphishing," Communications of the ACM, vol. 40, no. 10, pp. 94-100,Oct. 2007.
75. C. Zou, D. Towsley, and W. Gong, "Modeling and simulation study ofthe propagation and defense of internet e-mail worms," IEEE Trans.Dependable Secure Comput., vol. 4, no. 2, pp. 105-118, Apr.-Jun.2007.
76. P. Van Mieghem, J. Omic, and R. Kooij, "Virus spread in networks,"IEEE/ACM Trans. Netw., vol. 17, no. 1, pp. 1-14, Feb. 2009.
77. P.-Y. Chen, S.-M. Cheng, and K.-C. Chen, "Smart attacks in smart gridcommunication networks," IEEE Commun. Mag., vol. 50, no. 8, pp.24-29, Aug. 2012.
78. H. Hu, G. Ahn, and J. Jorgensen, "Multiparty access control for onlinesocial networks: Model and mechanisms," IEEE Trans. Knowl. DataEng., vol. PP, no. 99, p. 1, 2012.
79. R. Heatherly, M. Kantarcioglu, and B. Thuraisingham, " Preventingprivate information inference attacks on social networks," IEEE Trans.Knowl. Data Eng., vol. PP, no. 99, p. 1, 2012.
80. M. Yuan, L. Chen, P. Yu, and T. Yu, "Protecting sensitive labels insocial network data anonymization," IEEE Trans. Knowl. Data Eng.,vol. PP, no. 99, p. 1, 2012.
81. S. Xiao, G. Xiao, and T. H. Cheng, "Tolerance of intentional attacksin complex communication networks," IEEE Commun. Mag., vol. 46,no. 1, pp. 146-152, Jan. 2008. (Pubitemid 351266618)
82. P. Smith, D. Hutchison, J. Sterbenz, M. Schöandller, A. Fessi, M. Karaliopoulos,C. Lac, and B. Plattner, "Network resilience: a systematicapproach," IEEE Commun. Mag., vol. 49, no. 7, pp. 88-97, Jul. 2011.
83. P.-Y. Chen and K.-C. Chen, "Intentional attack and fusion-baseddefense strategy in complex networks," in Proc. 2011 IEEE GlobalCommunications Conference, Dec. 2011, pp. 1-5.
84. J. M. Kleinberg, "Navigation in a small world," Nature, vol. 406, p.845, 2000. (Pubitemid 30664249)
85. D. J. Watts, "Networks, dynamics, and the small-world phenomenon,"American Journal of Sociology, vol. 105, no. 2, pp. pp. 493-527, 1999.
86. V. Latora and M. Marchiori, "Efficient behavior of small-world networks,"Phys. Rev. Lett., vol. 87, p. 198701, Oct. 2001.
87. G. Kossinets, J. Kleinberg, and D. Watts, "The structure of informationpathways in a social communication network," in Proc. 14th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining, 2008, pp. 435-443.
88. D. J. Watts, P. S. Dodds, and M. E. J. Newman, "Identity and searchin social networks," Science, vol. 296, no. 5571, pp. 1302-1305, 2002.
89. B. Wellman, "Computer networks as social networks," Science, vol.293, no. 5537, pp. 2031-2034, 2001. (Pubitemid 32848041)
90. M. F. Schwartz and D. C. M. Wood, "Discovering shared interestsusing graph analysis," Commun. ACM, vol. 36, pp. 78-89, Aug. 1993.
91. F. Wu, B. A. Huberman, L. A. Adamic, and J. R. Tyler, "Informationflow in social groups," Physica A: Statistical Mechanics and itsApplications, vol. 337, no. 1-2, pp. 327-335, 2004.
92. L. Adamic and E. Adar, "How to search a social network," Socialnet works, vol. 27, no. 3, pp. 187-203, 2005. (Pubitemid 40829786)
93. C. Leberknight, H. Inaltekin, M. Chiang, and H. V. Poor, "Theevolution of online social networks: A tutorial survey," IEEE Signal Process. Mag., vol. 29, no. 2, pp. 41-52, Mar. 2012.
94. A. Frieze and G. Grimmett, "The shortest-path problem for graphs withrandom arc-lengths," Discrete Applied Mathematics, vol. 10, no. 1, pp.57-77, 1985. (Pubitemid 15475455)
95. R. Pastor-Satorras and A. Vespignani, "Epidemic spreading in scalefreenetworks," Phys. Rev. Lett., vol. 86, pp. 3200-3203, Apr. 2001.
96. H. Inaltekin, M. Chaing, and H. V. Poor, "Delay of social search onsmall-world random geometric graphs," to appear in J. Math. Sociol.
97. J. Murray, Mathematical Biology: I. An Introduction. Springer, 2005.
98. A. Frieze and G. Grimmett, "The shortest-path problem for graphs withrandom arc-lengths," Discrete Applied Mathematics, vol. 10, no. 1, pp.57-77, 1985. (Pubitemid 15475455)
99. D. Shah and T. Zaman, "Rumors in a network: Who's the culprit?"IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5163-5181, Aug. 2011.
100. P.-Y. Chen and K.-C. Chen, "Information epidemics in complex networkswith opportunistic links and dynamic topology," in Proc. 2010IEEE Global Communications Conference, Dec. 2010, pp. 1-6.
101. J. Fan, J. Chen, Y. Du, W. Gao, J. Wu, and Y. Sun, "Geo- communitybasedbroadcasting for data dissemination in mobile social networks,"IEEE Trans. Parallel Distrib. Syst., vol. PP, no. 99, p. 1, 2012.
102. K. C.-J. Lin, C.-W. Chen, and C.-F. Chou, "Preference-aware contentdissemination in opportunistic mobile social networks," in Proc. IEEEINFOCOM 2012, Mar. 2012, pp. 1960-1968.
103. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Gossip algorithms:design, analysis and applications," in Proc. IEEE INFOCOM 2005,vol. 3, Mar. 2005, pp. 1653-1664.
104. , "Randomized gossip algorithms," IEEE Trans. Inf. Theory,vol. 52, no. 6, pp. 2508-2530, Jun. 2006.
105. R. Olfati-Saber, J. Fax, and R. Murray, "Consensus and cooperationin networked multi-agent systems," Proc. IEEE, vol. 95, no. 1, pp.215-233, Jan. 2007.
106. M. F., M. Kurant, A. Markopoulou, C. Westphal, and U. C. Kozat,"Proactive seeding for information cascades in cellular networks," inProc. IEEE INFOCOM 2012, Mar. 2012, pp. 1719-1727.
107. P. Wang, M. C. Gonzalez, C. A. Hidalgo, and A.-L. Barabasi, "Understandingthe spreading patterns of mobile phone viruses," Science,vol. 324, no. 5930, pp. 1071-1076, 2009.
108. S.-M. Cheng, W. C. Ao, P.-Y. Chen, and K.-C. Chen, "On modelingmalware propagation in generalized social networks," IEEE Commun.Lett., vol. 15, no. 1, pp. 25-27, Jan. 2011.
109. J. Kleinberg, "The small-world phenomenon: an algorithm perspective,"in Proc. Thirty-Second Annual ACM Symposium on Theory of Computing, 2000, pp. 163-170.
110. , "Small-world phenomena and the dynamics of information, "Science, vol. 14, no. 12, pp. 1-14, 2001.
111. G. Wu, S. Talwar, K. Johnsson, N. Himayat, and K. Johnson, "M2m:From mobile to embedded internet," IEEE Commun. Mag., vol. 49,no. 4, pp. 36-43, Apr. 2011.
112. S.-Y. Lien, K.-C. Chen, and Y. Lin, "Toward ubiquitous massive accessesin 3gpp machine-to-machine communications," IEEE Commun.Mag., vol. 49, no. 4, pp. 66-74, Apr. 2011.
113. E. Lee, "Cyber physical systems: Design challenges," in Proc. 200811th IEEE International Symposium on Object Oriented Real-TimeDistributed Computing, May 2008, pp. 363-369.
114. L. Atzori, A. Iera, and G. Morabito, "The internet of things: A survey,"Computer Networks, vol. 54, pp. 2787-2805, Oct. 2010.
115. S.-C. Lin, L. Gu, and K.-C. Chen, "Providing statistical qos guaranteesin large cognitive machine-to-machine networks," in IEEE GlobalCommunications Conference Workshop 2012, Dec. 2012.
116. E. Daly and M. Haahr, "Social network analysis for information flowin disconnected delay-tolerant manets," IEEE Trans. Mobile Comput.,vol. 8, no. 5, pp. 606-621, May 2009.
117. S. P. and Borgatti, "Centrality and network flow," Social Networks,vol. 27, no. 1, pp. 55-71, 2005. (Pubitemid 40272649)
118. Y. Zhu, B. Xu, X. Shi, and Y. Wang, "A survey of social-based routingin delay tolerant networks: Positive and negative social effects," IEEECommun. Surveys Tuts., vol. PP, no. 99, pp. 1-15, 2012.
119. Y.-C. Liang, K.-C. Chen, G. Li, and P. Mahonen, "Cognitive radionetworking and communications: An overview," IEEE Trans. Veh.Technol., vol. 60, no. 7, pp. 3386-3407, Sep. 2011.
120. F. S. Chu and K. C. Chen, "Radio resource management of selforganizingofdma wireless mesh networks," Wireless Communicationsand Mobile Computing, vol. 11, no. 3, pp. 306-320, 2011.
121. S.-M. Cheng, S.-Y. Lien, F.-S. Chu, and K.-C. Chen, "On exploitingcognitive radio to mitigate interference in macro/femto heterogeneousnetworks," IEEE Wireless Commun. Mag., vol. 18, no. 3, pp. 40-47,Jun. 2011.
122. A. Giridhar and P. Kumar, "Computing and communicating functionsover sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4,pp. 755-764, Apr. 2005. (Pubitemid 40519630)
123. E. Fasolo, M. Rossi, J. Widmer, and M. Zorzi, "In-network aggregationtechniques for wireless sensor networks: a survey," IEEE WirelessCommun. Mag., vol. 14, no. 2, pp. 70-87, Apr. 2007. (Pubitemid 46776305)
124. T. Berger, Z. Zhang, and H. Viswanathan, "The ceo problem [multiterminalsource coding]," IEEE Trans. Inf. Theory, vol. 42, no. 3, pp.887-902, May 1996.
125. D. Slepian and J. Wolf, "Noiseless coding of correlated informationsources," IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, Jul.1973.
126. A. Ramamoorthy, "Minimum cost distributed source coding over anetwork," IEEE Trans. Inf. Theory, vol. 57, no. 1, pp. 461-475, Jan.2011.
127. K.-C. Chen and F.-M. Tseng, "Machine-to-machine communications: Technologies and challenge," to appear in Ad Hoc Networks, 2013.
128. X. Gong, T. Chandrashekhar, J. Zhang, and H. V. Poor, "Opportunisticcooperative networking: To relay or not to relay?" IEEE J. Sel. AreasCommun., vol. 30, no. 2, pp. 307-314, Feb. 2012.
129. C.-H. Huang and K.-C. Chen, "Dual-observation time-division spectrumsensing for cognitive radios," IEEE Trans. Veh. Technol., vol. 60,no. 8, pp. 3712-3725, Oct. 2011.
130. P. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulie, "Epidemicinformation dissemination in distributed systems," IEEE Computer,vol. 37, no. 5, pp. 60-67, May 2004.
131. P. De, Y. Liu, and S. Das, "An epidemic theoretic framework for vulnerabilityanalysis of broadcast protocols in wireless sensor networks,"IEEE Trans. Mobile Comput., vol. 8, no. 3, pp. 413-425, Mar. 2009.
132. W. Gao, Q. Li, B. Zhao, and G. Cao, "Social-aware multicast indisruption-tolerant networks," IEEE/ACM Trans. Netw., vol. PP, no. 99,p. 1, 2012.
133. P.-Y. Chen and K.-C. Chen, "Optimal control of epidemic informationdissemination in mobile ad hoc networks," in Proc. 2011 IEEE GlobalCommunications Conference, Dec. 2011, pp. 1-5.
134. R. Olfati-Saber, J. Fax, and R. Murray, "Consensus and cooperationin networked multi-agent systems," Proc. IEEE, vol. 95, no. 1, pp.215-233, Jan. 2007.
135. H. H. Lee and K.-C. Chen, "Time synchronization in heterogeneouswireless networks," in Proc. 2012 IEEE Wireless Communications andNetworking Conference, 2012.
136. G. Foschini and Z. Miljanic, "A simple distributed autonomous powercontrol algorithm and its convergence," IEEE Trans. Veh. Technol.,vol. 42, no. 4, pp. 641-646, Nov. 1993.
137. M. Chiang, P. Hande, T. Lan, and C. W. Tan, "Power control in wirelesscellular networks," Foundations and Trends in Networking, vol. 2, pp.381-533, Apr. 2008.
138. S. Brin and L. Page, "The anatomy of a large-scale hypertextual websearch engine," Computer Networks and ISDN Systems, vol. 30, pp.107-117, Apr. 1998.
139. A. N. Langville and C. D. Meyer, Google's PageRank and Beyond:The Science of Search Engine Rankings, Princeton University Press,2006.
140. A. Berman and R. J. Plemmons, Nonnegative Matrices in the MathematicalSciences (Classics in Applied Mathematics). Society forIndustrial and Applied Mathematics, Jan. 1987.
141. Y. Koren, R. Bell, and C. Volinsky, "Matrix factorization techniquesfor recommender systems," IEEE Computer, vol. 42, no. 8, pp. 30-37,Aug. 2009.
142. R. Bell, Y. Koren, and C. Volinsky, "Modeling relationships at multiplescales to improve accuracy of large recommender systems," in Proc.13th ACM SIGKDD International Conference on Knowledge Discoveryand Data Mining, 2007, pp. 95-104. (Pubitemid 350229196)
143. R. Bell and Y. Koren, "Scalable collaborative filtering with jointlyderived neighborhood interpolation weights," in Proc. Seventh IEEEInternational Conference on Data Mining, Oct. 2007, pp. 43-52.
144. Y. Koren, "Factorization meets the neighborhood: a multifaceted collaborativefiltering model," in Proc. 14th ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining, 2008, pp. 426-434.
145. Y. Hu, Y. Koren, and C. Volinsky, "Collaborative filtering for implicitfeedback datasets," in Proc. Eighth IEEE International Conference onData Mining, Dec. 2008, pp. 263-272.
146. S. Verdu, Multiuser Detection, 1st ed, Cambridge University Press,1998.
147. U. Mitra and H. V. Poor, "Activity detection in a multi-user environment,"Wireless Personal Communications, vol. 3, pp. 149-174, 1996. (Pubitemid 126714336)
148. X. Wang and H. V. Poor, "Blind multiuser detection: A subspaceapproach," IEEE Trans. Inf. Theory, vol. 44, no. 2, pp. 677-690, Mar.1998.
149. W.-C. Wu and K.-C. Chen, "Identification of active users in synchronouscdma multiuser detection," IEEE J. Sel. Areas Commun.,vol. 16, no. 9, pp. 1723-1735, Dec. 1998. (Pubitemid 128566853)
150. T. Oskiper and H. V. Poor, "Online activity detection in a multiuserenvironment using the matrix CUSUM algorithm," IEEE Trans. Inf.Theory, vol. 48, no. 2, pp. 477-493, Feb. 2002. (Pubitemid 34491198)
151. E. Biglieri and M. Lops, "Multiuser detection in a dynamic environment- part I: User identification and data detection," IEEE Trans. Inf.Theory, vol. 53, no. 9, pp. 3158-3170, Sep. 2007.
152. R. Th.A.J. and Leenders, "Modeling social influence through networkautocorrelation: constructing the weight matrix," Social Networks,vol. 24, no. 1, pp. 21-47, 2002.
153. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread ofinfluence through a social network," in Proc. Ninth ACM SIGKDDInternational Conference on Knowledge Discovery and Data Mining,2003, pp. 137-146.
154. J. Leskovec, A. Singh, and J. Kleinberg, "Patterns of influence in arecommendation network," in Advances in Knowledge Discovery andData Mining, ser. Lecture Notes in Computer Science, W.-K. Ng,M. Kitsuregawa, J. Li, and K. Chang, Eds. Springer, 2006, vol. 3918,pp. 380-389.
155. W. Evans, C. Kenyon, Y. Peres, and L. J. Schulman, "Broadcasting on Trees and the Ising Model," The Annals of Applied Probability, vol. 10,no. 2, pp. 410-433, May 2000.
156. L. Dolecek and D. Shah, "Influence in a large society: Interplaybetween information dynamics and network structure," in Proc. IEEEInternational Symposium on Information Theory, Jul. 2009, pp. 1574-1578.
157. M. Gomez Rodriguez, J. Leskovec, and A. Krause, "Inferring networksof diffusion and influence," in Proc. 16th ACM SIGKDD InternationalConference on Knowledge Discovery and Data Mining, 2010, pp.1019-1028.
158. L. McKnight and J. Bailey, Internet Economics, MIT Press, 1997.
159. J. Walrand, "Economic models of communication networks," in PerformanceModeling and Engineering, Z. Liu and C. H. Xia, Eds.Springer, 2008, pp. 57-89.
160. G. Hardin, "The tragedy of the commons," Science, vol. 162, no. 3859,pp. 1243-1248, 1968.
161. R. Edell and P. Varaiya, "Providing internet access: What we learnfrom index," IEEE Netw., vol. 13, no. 5, pp. 18-25, Sep./Oct. 1999. (Pubitemid 30503464)
162. P. Hande, M. Chiang, R. Calderbank, and J. Zhang, "Pricing underconstraints in access networks: Revenue maximization and congestionmanagement," in Proc. IEEE INFOCOM 2010, Mar. 2010, pp. 1-9.
163. W. R. Stevens, TCP/IP Illustrated (Vol. 1): The Protocols, Addison-Wesley Longman Publishing Co., 1993.
164. F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, "Rate control forcommunication networks: Shadow prices, proportional fairness andstability," The Journal of the Operational Research Society, vol. 49,no. 3, pp. 237-252, 1998. (Pubitemid 128610018)
165. M. Chiang, S. Low, A. Calderbank, and J. Doyle, "Layering asoptimization decomposition: A mathematical theory of network architectures,"Proc. IEEE, vol. 95, no. 1, pp. 255-312, Jan. 2007.
166. Z. Han, R. Zheng, and H. V. Poor, "Repeated auctions with bayesiannonparametric learning for spectrum access in cognitive radio networks,"IEEE Trans. Wireless Commun., vol. 10, no. 3, pp. 890-900,Mar. 2011.
167. J. Huang, Z. Han, M. Chiang, and H. V. Poor, "Auction-based resourceallocation for cooperative communications," IEEE J. Sel. Areas Commun.,vol. 26, no. 7, pp. 1226-1237, Sep. 2008.
168. S.-Y. Yun, Y. Yi, D.-H. Cho, and J. Mo, "The economic effects ofsharing femtocells," IEEE J. Sel. Areas Commun., vol. 30, no. 3, pp.595-606, Apr. 2012.
169. D. Liau, K.-C. Chen, and S.-M. Cheng, "A predator-prey model fordynamics of cognitive radios," to appear in IEEE Commun. Lett., 2013.
170. Q. Ni and C. Zarakovitis, "Nash bargaining game theoretic schedulingfor joint channel and power allocation in cognitive radio systems,"IEEE J. Sel. Areas Commun., vol. 30, no. 1, pp. 70-81, Jan. 2012.
171. Y. Xiao, G. Bi, and D. Niyato, "Game theoretic analysis for spectrumsharing with multi-hop relaying," IEEE Trans. Wireless Commun.,vol. 10, no. 5, pp. 1527-1537, May 2011.
172. S.-Y. Lien, Y.-Y. Lin, and K.-C. Chen, "Cognitive and game-theoreticalradio resource management for autonomous femtocells with qos guarantees,"IEEE Trans. Wireless Commun., vol. 10, no. 7, pp. 2196-2206,Jul. 2011.
173. J. Huang and V. Krishnamurthy, "Cognitive base stations in LTE/3GPPfemtocells: A correlated equilibrium game-theoretic approach," IEEE Trans. Commun., vol. 59, no. 12, pp. 3485-3493, Dec. 2011.
174. H. Inaltekin, M. Chiang, H. V. Poor, and S. B. Wicker, "Selfish randomaccess over wireless channels with multipacket reception," IEEE J. Sel.Areas Commun., vol. 30, no. 1, pp. 138-152, Jan. 2012.
175. Y.-Y. Lin and K.-C. Chen, "Asynchronous dynamic spectrum access,"IEEE Trans. Veh. Technol., vol. 61, no. 1, pp. 222-236, Jan. 2012.
176. S.-M. Cheng, P.-Y. Chen, and K.-C. Chen, "Ecology of cognitive radioad hoc networks," IEEE Commun. Lett., vol. 15, no. 7, pp. 764-766,Jul. 2011.
177. I. D. and Couzin, "Collective cognition in animal groups," Trends inCognitive Sciences, vol. 13, no. 1, pp. 36-43, 2009.
178. A. W. Woolley, C. F. Chabris, A. Pentland, N. Hashmi, and T. W. Malone,"Evidence for a collective intelligence factor in the performanceof human groups," Science, vol. 330, no. 6004, pp. 686-688, 2010.
179. U. Fayyad, G. Piatetsky-shapiro, and P. Smyth, "From data mining toknowledge discovery in databases," AI Magazine, vol. 17, pp. 37-54,1996.
180. D. Cook and L. Holder, "Graph-based data mining," IEEE Intell. Syst.,vol. 15, no. 2, pp. 32-41, Mar./Apr. 2000. (Pubitemid 30587666)
181. P. Domingos and M. Richardson, "Mining the network value ofcustomers," in Proc. Seventh ACM SIGKDD International Conferenceon Knowledge Discovery and Data Mining, 2001, pp. 57-66.
182. A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee,"Measurement and analysis of online social networks," inProc. 7th ACM SIGCOMM Conference on Internet Measurement, 2007,pp. 29-42.
183. H.-P. Kriegel, P. Kröger, and A. Zimek, "Clustering high-dimensionaldata: A survey on subspace clustering, pattern-based clustering, andcorrelation clustering," ACM Trans. Knowl. Discov. Data, vol. 3, pp.1:1-1:58, Mar. 2009.
184. D. Koller and N. Friedman, Probabilistic Graphical Models: Principlesand Techniques, MIT Press, 2009.
185. T.-Y. Chuang, "Trust with social network learning in e-commerce," in2010 IEEE International Conference on Communications Workshops,May 2010, pp. 1-6.
186. T.-Y. Chuang and K.-C. Chen, "Robust information fusion on socialnet works," in Proc. 2011 IEEE Global Communications Conference,Dec. 2011, pp. 1-6.
187. S. Kassam and H. V. Poor, "Robust techniques for signal processing:A survey," Proc. IEEE, vol. 73, no. 3, pp. 433-481, Mar. 1985. (Pubitemid 15110686)
188. B. Frey, Graphical Models for Machine Learning and Digital Communication.MIT Press, 1998.
189. A. Talwalkar, S. Kumar, and H. Rowley, "Large-scale manifold learning,"in Proc. IEEE Conference on Computer Vision and PatternRecognition, 2008.