{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:31:53Z","timestamp":1725582713349},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207563"},{"type":"electronic","value":"9783642207570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20757-0_22","type":"book-chapter","created":{"date-parts":[[2011,4,28]],"date-time":"2011-04-28T01:49:00Z","timestamp":1303955340000},"page":"281-293","source":"Crossref","is-referenced-by-count":2,"title":["Small Worlds and Rapid Mixing with a Little More Randomness on Random Geometric Graphs"],"prefix":"10.1007","author":[{"given":"Gunes","family":"Ercal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","first-page":"60","volume":"2","author":"S. Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychology Today\u00a02(1), 60\u201367 (1967)","journal-title":"Psychology Today"},{"key":"22_CR2","volume-title":"The Structure and Dynamics of Networks","author":"M. Newman","year":"2006","unstructured":"Newman, M., Barab\u00e1si, A.L., Watts, D.J.: The Structure and Dynamics of Networks. Princeton University Press, Princeton (2006)"},{"key":"22_CR3","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, Orlando (1985)"},{"issue":"6684","key":"22_CR4","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D. Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of small-world networks. Nature\u00a0393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"key":"22_CR5","series-title":"Oxford Studies in Probability","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M.D. Penrose","year":"2003","unstructured":"Penrose, M.D.: Random Geometric Graphs. Oxford Studies in Probability, vol.\u00a05. Oxford University Press, Oxford (2003)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming, pp. 547\u2013566 (1998)","DOI":"10.1007\/978-1-4612-1784-8_33"},{"issue":"10","key":"22_CR7","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1109\/LCOMM.2003.818887","volume":"7","author":"A. Helmy","year":"2003","unstructured":"Helmy, A.: Small worlds in wireless networks. IEEE Communications Letters\u00a07(10), 490\u2013492 (2003)","journal-title":"IEEE Communications Letters"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-540-27824-5_53","volume-title":"Telecommunications and Networking - ICT 2004","author":"D. Cavalcanti","year":"2004","unstructured":"Cavalcanti, D., Agrawal, D., Kelner, J., Sadok, D.F.H.: Exploiting the small-world effect to increase connectivity in wireless ad hoc networks. In: de Souza, J.N., Dini, P., Lorenz, P. (eds.) ICT 2004. LNCS, vol.\u00a03124, pp. 388\u2013393. Springer, Heidelberg (2004)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/ISISE.2008.245","volume-title":"Proceedings of the 2008 International Symposium on Information Science and Engieering","author":"X. Ye","year":"2008","unstructured":"Ye, X., Xu, L., Lin, L.: Small-world model based topology optimization in wireless sensor network. In: Proceedings of the 2008 International Symposium on Information Science and Engieering, vol.\u00a001, pp. 102\u2013106. IEEE Computer Society, Washington, DC (2008)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues and expanders. Combinatorica\u00a06(2), 83\u201396 (1986)","journal-title":"Combinatorica"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1017\/S0963548300000390","volume":"1","author":"A. Sinclair","year":"1992","unstructured":"Sinclair, A.: Improved bounds for mixing rates of markov chains and multicommodity flow. Combinatorics, Probability and Computing\u00a01, 351\u2013370 (1992)","journal-title":"Combinatorics, Probability and Computing"},{"key":"22_CR12","first-page":"482","volume-title":"Approximations for NP-hard Problems","author":"M. Jerrum","year":"1997","unstructured":"Jerrum, M., Sinclair, A.: The markov chain monte carlo method: an approach to approximate counting and integration. In: Hochbaum, D. (ed.) Approximations for NP-hard Problems, pp. 482\u2013520. PWS Publishing, Boston (1997)"},{"key":"22_CR13","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482\u2013491 (2003)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Servetto, S.D., Barrenechea, G.: Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks. In: Proc. of the 1st Int. Workshop on Wireless Sensor Networks and Applications, pp. 12\u201321 (2002)","DOI":"10.1145\/570739.570741"},{"key":"22_CR15","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM (2004)"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1145\/73007.73063","volume-title":"Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC 1989","author":"J. Friedman","year":"1989","unstructured":"Friedman, J., Kahn, J., Szemer\u00e9di, E.: On the second eigenvalue of random regular graphs. In: Proceedings of the Twenty-first Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 587\u2013598. ACM, New York (1989)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02579329","volume":"1","author":"Z. F\u00fcredi","year":"1981","unstructured":"F\u00fcredi, Z., Koml\u00f3s, J.: The eigenvalues of random symmetric matrices. Combinatorica\u00a01, 233\u2013241 (1981)","journal-title":"Combinatorica"},{"issue":"SI","key":"22_CR18","first-page":"2508","volume":"14","author":"S. Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE\/ACM Trans. Netw.\u00a014(SI), 2508\u20132530 (2006)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"22_CR19","unstructured":"Avin, C., Ercal, G.: Bounds on the mixing time and partial cover of ad-hoc and sensor networks. In: Proceedings of the 2nd European Workshop on Wireless Sensor Networks (EWSN 2005), pp. 1\u201312 (2005)"},{"issue":"1-2","key":"22_CR20","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2007.02.065","volume":"380","author":"C. Avin","year":"2007","unstructured":"Avin, C., Ercal, G.: On the cover time and mixing time of random geometric graphs. Theor. Comput. Sci.\u00a0380(1-2), 2\u201322 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR21","volume-title":"Spectral Graph Theory","author":"F. Chung","year":"1997","unstructured":"Chung, F.: Spectral Graph Theory. American Mathematical Society, Providence (1997)"},{"issue":"2","key":"22_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/15427951.2007.10129290","volume":"4","author":"A.D. Flaxman","year":"2007","unstructured":"Flaxman, A.D.: Expansion and lack thereof in randomly perturbed graphs. Internet Mathematics\u00a04(2), 131\u2013147 (2007)","journal-title":"Internet Mathematics"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20757-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:15Z","timestamp":1606186815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20757-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207563","9783642207570"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20757-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}