{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:35:13Z","timestamp":1725622513434},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,1,2]]},"DOI":"10.1145\/3430984.3431020","type":"proceedings-article","created":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T05:34:44Z","timestamp":1609133684000},"page":"127-135","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Group-to-Group Version of Random Walk Betweenness Centrality"],"prefix":"10.1145","author":[{"given":"Iqra Altaf","family":"Gillani","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Delhi"}]},{"given":"Amitabha","family":"Bagchi","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi"}]},{"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Delhi"}]}],"member":"320","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"D. Aldous and J. Fill. 2002. Reversible Markov chains and random walks on graphs. https:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.pdf (Monograph). D. Aldous and J. Fill. 2002. Reversible Markov chains and random walks on graphs. https:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.pdf (Monograph)."},{"key":"e_1_3_2_1_2_1","volume-title":"The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde","author":"Anthonisse M.","year":"1971","unstructured":"J.\u00a0 M. Anthonisse . 1971. The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde ( 1971 ). J.\u00a0M. Anthonisse. 1971. The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde (1971)."},{"volume-title":"Intl. Workshop on Algorithms and Models for the Web-Graph. Springer, 106\u2013117","author":"Avrachenkov K.","key":"e_1_3_2_1_3_1","unstructured":"K. Avrachenkov , N. Litvak , V. Medyanikov , and M. Sokol . 2013. Alpha current flow betweenness centrality . In Intl. Workshop on Algorithms and Models for the Web-Graph. Springer, 106\u2013117 . K. Avrachenkov, N. Litvak, V. Medyanikov, and M. Sokol. 2013. Alpha current flow betweenness centrality. In Intl. Workshop on Algorithms and Models for the Web-Graph. Springer, 106\u2013117."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643799"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"volume-title":"Annual symp. on theoretical aspects of computer science(STACS \u201905)","author":"Brandes U.","key":"e_1_3_2_1_6_1","unstructured":"U. Brandes and D. Fleischer . 2005. Centrality measures based on current flow . In Annual symp. on theoretical aspects of computer science(STACS \u201905) . Springer, 533\u2013544. U. Brandes and D. Fleischer. 2005. Centrality measures based on current flow. In Annual symp. on theoretical aspects of computer science(STACS \u201905). Springer, 533\u2013544."},{"volume-title":"Proc. of the 16th ACM SIGKDD Intl. Conf. on Knowledge discovery and data mining(KDD \u201910)","author":"Chen W.","key":"e_1_3_2_1_7_1","unstructured":"W. Chen , C. Wang , and Y. Wang . 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks . In Proc. of the 16th ACM SIGKDD Intl. Conf. on Knowledge discovery and data mining(KDD \u201910) . ACM, 1029\u20131038. W. Chen, C. Wang, and Y. Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proc. of the 16th ACM SIGKDD Intl. Conf. on Knowledge discovery and data mining(KDD \u201910). ACM, 1029\u20131038."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"volume-title":"Proc. of IEEE 59th Annual Symp. on Foundations of Computer Science(FOCS \u201918)","author":"Chu T.","key":"e_1_3_2_1_9_1","unstructured":"T. Chu , Y. Gao , R. Peng , S. Sachdeva , S. Sawlani , and J. Wang . 2018. Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions . In Proc. of IEEE 59th Annual Symp. on Foundations of Computer Science(FOCS \u201918) . IEEE, 361\u2013372. T. Chu, Y. Gao, R. Peng, S. Sachdeva, S. Sawlani, and J. Wang. 2018. Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions. In Proc. of IEEE 59th Annual Symp. on Foundations of Computer Science(FOCS \u201918). IEEE, 361\u2013372."},{"volume-title":"Random Walks and Electric Networks","author":"Doyle G.","key":"e_1_3_2_1_10_1","unstructured":"P.\u00a0 G. Doyle and J.\u00a0 L. Snell . 1984. Random Walks and Electric Networks . Mathematical Association of America , Washington, DC . P.\u00a0G. Doyle and J.\u00a0L. Snell. 1984. Random Walks and Electric Networks. Mathematical Association of America, Washington, DC."},{"key":"e_1_3_2_1_11_1","volume-title":"The centrality of groups and classes. J. of mathematical sociology 23, 3","author":"Everett G.","year":"1999","unstructured":"M.\u00a0 G. Everett and S.\u00a0 P. Borgatti . 1999. The centrality of groups and classes. J. of mathematical sociology 23, 3 ( 1999 ), 181\u2013201. M.\u00a0G. Everett and S.\u00a0P. Borgatti. 1999. The centrality of groups and classes. J. of mathematical sociology 23, 3 (1999), 181\u2013201."},{"key":"e_1_3_2_1_12_1","volume-title":"A set of measures of centrality based on betweenness. Sociometry","author":"Freeman C.","year":"1977","unstructured":"L.\u00a0 C. Freeman . 1977. A set of measures of centrality based on betweenness. Sociometry ( 1977 ), 35\u201341. L.\u00a0C. Freeman. 1977. A set of measures of centrality based on betweenness. Sociometry (1977), 35\u201341."},{"key":"e_1_3_2_1_13_1","volume-title":"Centrality in valued graphs: A measure of betweenness based on network flow. Social networks 13, 2","author":"Freeman C.","year":"1991","unstructured":"L.\u00a0 C. Freeman , P. Borgatti , S, and D.\u00a0 R. White . 1991. Centrality in valued graphs: A measure of betweenness based on network flow. Social networks 13, 2 ( 1991 ), 141\u2013154. L.\u00a0C. Freeman, P. Borgatti, S, and D.\u00a0R. White. 1991. Centrality in valued graphs: A measure of betweenness based on network flow. Social networks 13, 2 (1991), 141\u2013154."},{"volume-title":"Proc. of the 32nd ACM Symp. on Parallelism in Algorithms and Architectures","author":"Gillani A.","key":"e_1_3_2_1_14_1","unstructured":"I.\u00a0 A. Gillani and A. Bagchi . 2020. A Queueing Network-Based Distributed Laplacian Solver . In Proc. of the 32nd ACM Symp. on Parallelism in Algorithms and Architectures ( Virtual Event, USA) (SPAA \u201920). ACM, 535\u2013537. I.\u00a0A. Gillani and A. Bagchi. 2020. A Queueing Network-Based Distributed Laplacian Solver. In Proc. of the 32nd ACM Symp. on Parallelism in Algorithms and Architectures (Virtual Event, USA) (SPAA \u201920). ACM, 535\u2013537."},{"key":"e_1_3_2_1_15_1","volume-title":"Inf. Proc. Lett. (2020","author":"Gillani A.","year":"2020","unstructured":"I.\u00a0 A. Gillani and A. Bagchi . 2020. A Queueing Network-Based Distributed Laplacian Solver for Directed Graphs . Inf. Proc. Lett. (2020 ). https:\/\/doi.org\/10.1016\/j.ipl. 2020 .106040 10.1016\/j.ipl.2020.106040 I.\u00a0A. Gillani and A. Bagchi. 2020. A Queueing Network-Based Distributed Laplacian Solver for Directed Graphs. Inf. Proc. Lett. (2020). https:\/\/doi.org\/10.1016\/j.ipl.2020.106040"},{"volume-title":"Distributively Computing Random Walk Betweenness Centrality in Linear Time. In 37th Intl. Conf. on Distributed Computing Systems(ICDCS \u201917)","author":"Hua Q.-S.","key":"e_1_3_2_1_16_1","unstructured":"Q.-S. Hua , M. Ai , H. Jin , D. Yu , and X. Shi . 2017 . Distributively Computing Random Walk Betweenness Centrality in Linear Time. In 37th Intl. Conf. on Distributed Computing Systems(ICDCS \u201917) . IEEE, 764\u2013774. Q.-S. Hua, M. Ai, H. Jin, D. Yu, and X. Shi. 2017. Distributively Computing Random Walk Betweenness Centrality in Linear Time. In 37th Intl. Conf. on Distributed Computing Systems(ICDCS \u201917). IEEE, 764\u2013774."},{"key":"e_1_3_2_1_17_1","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth E.","year":"1993","unstructured":"D.\u00a0 E. Knuth . 1993. The Stanford GraphBase: A Platform for Combinatorial Computing . Addison-Wesley , Reading , MA( 1993 ). D.\u00a0E. Knuth. 1993. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA(1993)."},{"volume-title":"Proc. of the 57th Annual IEEE Symp. on Foundations of Computer Science(FOCS \u201916)","author":"Kyng R.","key":"e_1_3_2_1_18_1","unstructured":"R. Kyng and S. Sachdeva . 2016. Approximate gaussian elimination for laplacians-fast, sparse, and simple . In Proc. of the 57th Annual IEEE Symp. on Foundations of Computer Science(FOCS \u201916) . IEEE, 573\u2013582. R. Kyng and S. Sachdeva. 2016. Approximate gaussian elimination for laplacians-fast, sparse, and simple. In Proc. of the 57th Annual IEEE Symp. on Foundations of Computer Science(FOCS \u201916). IEEE, 573\u2013582."},{"volume-title":"Current Flow Group Closeness Centrality for Complex Networks. In The World Wide Web Conference(WWW \u201919)","author":"Li H.","key":"e_1_3_2_1_19_1","unstructured":"H. Li , R. Peng , L. Shan , Y. Yi , and Z. Zhang . 2019 . Current Flow Group Closeness Centrality for Complex Networks. In The World Wide Web Conference(WWW \u201919) . ACM, 961\u2013971. https:\/\/doi.org\/10.1145\/3308558.3313490 10.1145\/3308558.3313490 H. Li, R. Peng, L. Shan, Y. Yi, and Z. Zhang. 2019. Current Flow Group Closeness Centrality for Complex Networks. In The World Wide Web Conference(WWW \u201919). ACM, 961\u2013971. https:\/\/doi.org\/10.1145\/3308558.3313490"},{"volume-title":"IEEE 9th Intl. Conf. on Self-Adaptive and Self-Organizing Systems(SASO \u201915)","author":"Lulli A.","key":"e_1_3_2_1_20_1","unstructured":"A. Lulli , L. Ricci , E. Carlini , and P. Dazzi . 2015. Distributed current flow betweenness centrality . In IEEE 9th Intl. Conf. on Self-Adaptive and Self-Organizing Systems(SASO \u201915) . IEEE, 71\u201380. A. Lulli, L. Ricci, E. Carlini, and P. Dazzi. 2015. Distributed current flow betweenness centrality. In IEEE 9th Intl. Conf. on Self-Adaptive and Self-Organizing Systems(SASO \u201915). IEEE, 71\u201380."},{"key":"e_1_3_2_1_21_1","volume-title":"The bottlenosedolphin communityof doubtful sound features a large proportion of long-lasting associations: cangeographic isolation explain this unique trait?Behavioral Ecology and Sociobiology 54, 4","author":"Lusseau D.","year":"2003","unstructured":"D. Lusseau , K. Schneider , O.\u00a0 J. Boisseau , P. Haase , E. Slooten , and S.M.Dawson. 2003. The bottlenosedolphin communityof doubtful sound features a large proportion of long-lasting associations: cangeographic isolation explain this unique trait?Behavioral Ecology and Sociobiology 54, 4 ( 2003 ), 396\u2013405. D. Lusseau, K. Schneider, O.\u00a0J. Boisseau, P. Haase, E. Slooten, and S.M.Dawson. 2003. The bottlenosedolphin communityof doubtful sound features a large proportion of long-lasting associations: cangeographic isolation explain this unique trait?Behavioral Ecology and Sociobiology 54, 4 (2003), 396\u2013405."},{"volume-title":"Proc. of the 2018 SIAM Intl. Conf. on Data Mining(SDM \u201918)","author":"Medya S.","key":"e_1_3_2_1_22_1","unstructured":"S. Medya , A. Silva , A. Singh , P. Basu , and A. Swami . 2018. Group centrality maximization via network design . In Proc. of the 2018 SIAM Intl. Conf. on Data Mining(SDM \u201918) . SIAM, 126\u2013134. S. Medya, A. Silva, A. Singh, P. Basu, and A. Swami. 2018. Group centrality maximization via network design. In Proc. of the 2018 SIAM Intl. Conf. on Data Mining(SDM \u201918). SIAM, 126\u2013134."},{"key":"e_1_3_2_1_23_1","volume-title":"A measure of betweenness centrality based on random walks. Social networks 27, 1","author":"Newman J.","year":"2005","unstructured":"M.\u00a0E.\u00a0 J. Newman . 2005. A measure of betweenness centrality based on random walks. Social networks 27, 1 ( 2005 ), 39\u201354. M.\u00a0E.\u00a0J. Newman. 2005. A measure of betweenness centrality based on random walks. Social networks 27, 1 (2005), 39\u201354."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.066127"},{"key":"e_1_3_2_1_25_1","unstructured":"L. Page S. Brin R. Motwani and T. Winograd. 1999. The PageRank citation ranking: Bringing order to the web.Technical Report. Stanford InfoLab. L. Page S. Brin R. Motwani and T. Winograd. 1999. The PageRank citation ranking: Bringing order to the web.Technical Report. Stanford InfoLab."},{"volume-title":"Proc. of the 36th Annual ACM Symp. on Theory of Computing(STOC \u201904)","author":"A.","key":"e_1_3_2_1_26_1","unstructured":"D.\u00a0 A. Spielman and S-H. Teng. 2004. Nearly-linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems . In Proc. of the 36th Annual ACM Symp. on Theory of Computing(STOC \u201904) . ACM. D.\u00a0A. Spielman and S-H. Teng. 2004. Nearly-linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems. In Proc. of the 36th Annual ACM Symp. on Theory of Computing(STOC \u201904). ACM."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2638591"},{"volume-title":"Proc. of the AAAI Conference on Artificial Intelligence(AAAI \u201919)","author":"W\u0105s T.","key":"e_1_3_2_1_28_1","unstructured":"T. W\u0105s , T. Rahwan , and O. Skibski . 2019. Random Walk Decay Centrality . In Proc. of the AAAI Conference on Artificial Intelligence(AAAI \u201919) . 2197\u20132204. T. W\u0105s, T. Rahwan, and O. Skibski. 2019. Random Walk Decay Centrality. In Proc. of the AAAI Conference on Artificial Intelligence(AAAI \u201919). 2197\u20132204."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1086\/jar.33.4.3629752"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.6"}],"event":{"name":"CODS COMAD 2021: 8th ACM IKDD CODS and 26th COMAD","acronym":"CODS COMAD 2021","location":"Bangalore India"},"container-title":["Proceedings of the 3rd ACM India Joint International Conference on Data Science & Management of Data (8th ACM IKDD CODS & 26th COMAD)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3430984.3431020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T18:44:31Z","timestamp":1673635471000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3430984.3431020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":31,"alternative-id":["10.1145\/3430984.3431020","10.1145\/3430984"],"URL":"https:\/\/doi.org\/10.1145\/3430984.3431020","relation":{},"subject":[],"published":{"date-parts":[[2021,1,2]]},"assertion":[{"value":"2021-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}