A measure of betweenness centrality based on random walks Export

@article{citeulike:79840, abstract = {Betweenness is a measure of the centrality of a node in a network, and isnormally calculated as the fraction of shortest paths between node pairs thatpass through the node of interest. Betweenness is, in some sense, a measure ofthe influence a node has over the spread of information through the network. Bycounting only shortest paths, however, the conventional definition implicitlyassumes that information spreads only along those shortest paths. Here wepropose a betweenness measure that relaxes this assumption, includingcontributions from essentially all paths between nodes, not just the shortest,although it still gives more weight to short paths. The measure is based onrandom walks, counting how often a node is traversed by a random walk betweentwo other nodes. We show how our measure can be calculated using matrixmethods, and give some examples of its application to particular networks.}, archivePrefix = {arXiv}, author = {Newman, M. E. J.}, citeulike-article-id = {79840}, citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0309045}, citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0309045}, day = {1}, eprint = {cond-mat/0309045}, journal = {Social networks}, keywords = {betweenness}, month = {January}, posted-at = {2009-08-01 14:11:07}, priority = {2}, publisher = {Elsevier Science}, title = {A measure of betweenness centrality based on random walks}, url = {http://arxiv.org/abs/cond-mat/0309045}, volume = {27}, year = {2005} }

TY - JOUR ID - citeulike:79840 L3 - citeulike-article-id:79840 N2 - Betweenness is a measure of the centrality of a node in a network, and isnormally calculated as the fraction of shortest paths between node pairs thatpass through the node of interest. Betweenness is, in some sense, a measure ofthe influence a node has over the spread of information through the network. Bycounting only shortest paths, however, the conventional definition implicitlyassumes that information spreads only along those shortest paths. Here wepropose a betweenness measure that relaxes this assumption, includingcontributions from essentially all paths between nodes, not just the shortest,although it still gives more weight to short paths. The measure is based onrandom walks, counting how often a node is traversed by a random walk betweentwo other nodes. We show how our measure can be calculated using matrixmethods, and give some examples of its application to particular networks. JF - Social networks TI - A measure of betweenness centrality based on random walks PB - Elsevier Science VL - 27 KW - betweenness AU - Newman, MEJ PY - 2005/01/01/ UR - http://arxiv.org/abs/cond-mat/0309045 ER -