{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:18Z","timestamp":1750306638219,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T00:00:00Z","timestamp":1407715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,11]]},"DOI":"10.1145\/2633675.2633680","type":"proceedings-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:39Z","timestamp":1406924019000},"page":"29-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Walk globally, act locally"],"prefix":"10.1145","author":[{"given":"Maotian","family":"Zhang","sequence":"first","affiliation":[{"name":"PLA University of Science and Technology, Nanjing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panlong","family":"Yang","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology, Nanjing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang","family":"Tian","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaocan","family":"Xiang","sequence":"additional","affiliation":[{"name":"PLA University of Science and Technology, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Xiong","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557067"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030613.2030624"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2248371.2248376"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461381.2461414"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2335470.2335475"},{"key":"e_1_3_2_1_10_1","unstructured":"G. Bigwood D. Rehunathan M. Bateman T. Henderson and S. Bhatti \"CRAWDAD data set st_andrews sassy (v. 2011-06-03) \" Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/st_andrews\/sassy\/.  G. Bigwood D. Rehunathan M. Bateman T. Henderson and S. Bhatti \"CRAWDAD data set st_andrews sassy (v. 2011-06-03) \" Downloaded from http:\/\/crawdad.cs.dartmouth.edu\/st_andrews\/sassy\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"F. R. Chung \"Spectral graph theory \" 1997.  F. R. Chung \"Spectral graph theory \" 1997.","DOI":"10.1090\/cbms\/092"},{"key":"e_1_3_2_1_12_1","first-page":"346","volume-title":"Time-varying graphs and dynamic networks,\" in Ad-hoc, Mobile, and Wireless Networks","author":"Casteigts A.","year":"2011","unstructured":"A. Casteigts , P. Flocchini , W. Quattrociocchi , and N. Santoro , \" Time-varying graphs and dynamic networks,\" in Ad-hoc, Mobile, and Wireless Networks . Springer , 2011 , pp. 346 -- 359 . A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, \"Time-varying graphs and dynamic networks,\" in Ad-hoc, Mobile, and Wireless Networks. Springer, 2011, pp. 346--359."},{"key":"e_1_3_2_1_13_1","volume-title":"A graph-based model for disconnected ad hoc networks,\" in IEEE INFOCOM","author":"De Pellegrini F.","year":"2007","unstructured":"F. De Pellegrini , D. Miorandi , I. Carreras , and I. Chlamtac , \" A graph-based model for disconnected ad hoc networks,\" in IEEE INFOCOM , 2007 . F. De Pellegrini, D. Miorandi, I. Carreras, and I. Chlamtac, \"A graph-based model for disconnected ad hoc networks,\" in IEEE INFOCOM, 2007."},{"issue":"1","key":"e_1_3_2_1_14_1","first-page":"1","article-title":"Random walks on graphs: A survey","volume":"2","author":"Lov\u00e1sz L.","year":"1993","unstructured":"L. Lov\u00e1sz , \" Random walks on graphs: A survey ,\" Combinatorics, Paul erdos is eighty , vol. 2 , no. 1 , pp. 1 -- 46 , 1993 . L. Lov\u00e1sz, \"Random walks on graphs: A survey,\" Combinatorics, Paul erdos is eighty, vol. 2, no. 1, pp. 1--46, 1993.","journal-title":"Combinatorics, Paul erdos is eighty"},{"key":"e_1_3_2_1_15_1","volume-title":"Mode-seeking on graphs via random walks,\" in IEEE CVPR","author":"Cho M.","year":"2012","unstructured":"M. Cho and K. M. Lee , \" Mode-seeking on graphs via random walks,\" in IEEE CVPR , 2012 . M. Cho and K. M. Lee, \"Mode-seeking on graphs via random walks,\" in IEEE CVPR, 2012."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2008.21"}],"event":{"name":"MobiHoc'14: The Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Philadelphia Pennsylvania USA","acronym":"MobiHoc'14"},"container-title":["Proceedings of the first international workshop on Mobile sensing, computing and communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2633675.2633680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2633675.2633680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:55:56Z","timestamp":1750229756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2633675.2633680"}},"subtitle":["efficient influential user identification in mobile social networks"],"short-title":[],"issued":{"date-parts":[[2014,8,11]]},"references-count":16,"alternative-id":["10.1145\/2633675.2633680","10.1145\/2633675"],"URL":"https:\/\/doi.org\/10.1145\/2633675.2633680","relation":{},"subject":[],"published":{"date-parts":[[2014,8,11]]},"assertion":[{"value":"2014-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}