{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T01:40:07Z","timestamp":1724031607463},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Commun."],"published-print":{"date-parts":[[2021,6,1]]},"DOI":"10.1587\/transcom.2020ebp3093","type":"journal-article","created":{"date-parts":[[2020,12,13]],"date-time":"2020-12-13T22:25:03Z","timestamp":1607898303000},"page":"604-615","source":"Crossref","is-referenced-by-count":3,"title":["Graph Degree Heterogeneity Facilitates Random Walker Meetings"],"prefix":"10.23919","volume":"E104.B","author":[{"given":"Yusuke","family":"SAKUMOTO","sequence":"first","affiliation":[{"name":"Kwansei Gakuin University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"OHSAKI","sequence":"additional","affiliation":[{"name":"Kwansei Gakuin University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, \u201cSearch and replication in unstructured peer-to-peer networks,\u201d Proc. 16th ACM international conference on Supercomputing (ICS'02), pp.84-95, June 2002. 10.1145\/514191.514206","DOI":"10.1145\/514191.514206"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] C. Gkantsidis, M. Mihail, and A. Saberi, \u201cRandom walks in peer-to-peer networks,\u201d Proc. 23rd Conference of the IEEE Communications Society (INFOCOM 2004), pp.120-130, March 2004. 10.1109\/infcom.2004.1354487","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] C. Dutta, G. Pandurangan, R. Rajaraman, and S. Roche, \u201cCoalescing-branching random walks on graphs,\u201d ACM Trans. Parallel Comput. (TOPC), vol.2, no.3, pp.1-29, Nov. 2015. 10.1145\/2817830","DOI":"10.1145\/2817830"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Y. Metivier, N. Saheb, and A. Zemmari, \u201cRandomized rendezvous,\u201d Mathematics and Computer Science, pp.183-194, Birkh\u00e4user, Basel, 2000. 10.1007\/978-3-0348-8405-1_16","DOI":"10.1007\/978-3-0348-8405-1_16"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Israeli and M. Jalfon, \u201cToken management schemes and random walks yield self-stabilizing mutual exclusion,\u201d Proc. 9th Annual ACM Symposium on Principles of Distributed Computing (PODC'90), pp.119-131, ACM, Aug. 1990. 10.1145\/93385.93409","DOI":"10.1145\/93385.93409"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] P. Tetali and P. Winkler, \u201cOn a random walk problem arising in self-stabilizing token management,\u201d Proc. 10th annual ACM symposium on Principles of distributed computing (PODC'91), pp.273-280, ACM, Aug. 1991. 10.1145\/112600.112623","DOI":"10.1145\/112600.112623"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, \u201cRandom walks on weighted graphs and applications to on-line algorithms,\u201d J. ACM, vol.40, no.3, pp.421-453, July 1993. 10.1145\/174130.174131","DOI":"10.1145\/174130.174131"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] D.J. Aldous, \u201cMeeting times for independent Markov chains,\u201d Stochastic Processes and their Applications, vol.38, no.2, pp.185-193, Aug. 1991. 10.1016\/0304-4149(91)90090-y","DOI":"10.1016\/0304-4149(91)90090-Y"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] N.H. Bshouty, L. Higham, and J. Warpechowska-Gruca, \u201cMeeting times of random walks on graphs,\u201d Inform. Process. Lett., vol.69, no.5, pp.259-265, 1999. 10.1016\/s0020-0190(99)00017-4","DOI":"10.1016\/S0020-0190(99)00017-4"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] C. Cooper, A. Frieze, and T. Radzik, \u201cMultiple random walks in random regular graphs,\u201d SIAM J. Discrete Math., vol.23, no.4, pp.1738-1761, June 2009. 10.1137\/080729542","DOI":"10.1137\/080729542"},{"key":"11","unstructured":"[11] Y. Zhang, Z. Tan, and B. Krishnamachari, \u201cOn the meeting time for two random walks on a regular graph,\u201d arXiv preprint arXiv:1408.2005, 2014."},{"key":"12","unstructured":"[12] M. George, R. Patel, and F. Bullo, \u201cThe meeting time of multiple random walks,\u201d Preprint submitted to Linear Algebra and Its Applications, March 2017, available at http:\/\/motion.me.ucsb.edu\/pdf\/2014l-gpb.pdf"},{"key":"13","unstructured":"[13] L. Lov\u00e1sz, \u201cRandom walks on graphs: A survey,\u201d Combinatorics, Paul Erd\u0151s is eighty, vol.2, pp.353-398, 1996."},{"key":"14","unstructured":"[14] U. Von Luxburg, A. Radl, and M. Hein, \u201cHitting and commute times in large random neighborhood graphs,\u201d The Journal of Machine Learning Research, vol.15, no.1, pp.1751-1798, Jan. 2014."},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] A.L. B\u00e1rabasi and R. Albert, \u201cEmergence of scaling in random networks,\u201d Science, vol.286, no.5439, pp.509-512, Oct. 1999. 10.1126\/science.286.5439.509","DOI":"10.1126\/science.286.5439.509"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] P. Erd\u00f6s and A. R\u00e9nyi, \u201cOn random graphs,\u201d Mathematicae, vol.6, no.26, pp.290-297, 1959.","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] Y. Sakumoto and M. Aida, \u201cWigner's semicircle law of weighted random networks,\u201d IEICE Trans. Commun., vol.E104-B, no.3, pp.251-261, March 2021. 10.1587\/transcom.2020ebp3051","DOI":"10.1587\/transcom.2020EBP3051"},{"key":"18","unstructured":"[18] J. Kunegis, \u201cThe Koblenz network collection (KONECT),\u201d http:\/\/konect.uni-koblenz.de\/ (accessed on May 29, 2020)."}],"container-title":["IEICE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E104.B\/6\/E104.B_2020EBP3093\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T01:07:41Z","timestamp":1724029661000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transcom\/E104.B\/6\/E104.B_2020EBP3093\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021]]}},"URL":"https:\/\/doi.org\/10.1587\/transcom.2020ebp3093","relation":{},"ISSN":["0916-8516","1745-1345"],"issn-type":[{"type":"print","value":"0916-8516"},{"type":"electronic","value":"1745-1345"}],"subject":[],"published":{"date-parts":[[2021,6,1]]}}}