***** To join INSNA, visit http://www.insna.org ***** <<<-------- phil-------->>> > I googled and found this paper by Ulrik Brandes on a faster method to > calculate betweeness centrality. > http://www.inf.uni-konstanz.de/algo/publications/b-fabc-01.pdf I'm > programming in Mathematica, and I entered and re-entered the algorithm > multiple times, but the values produced are (very) slightly off from the > betweeness values produced by the algorithm using conventional matrix > multiplication and pair summations. Has anyone played aroudn with this > thing and got it work? The betweeness procedure in Pajek is based on Brandes algorithm. A simpler, but slower algorithm for smaller networks was published in Batagelj V.: Semirings for Social Networks Analysis. Journal of Mathematical Sociology, 19(1994)1, 53-68. see preprint version at http://vlado.fmf.uni-lj.si/pub/preprint/SemiRings.pdf I put an old (1991-1993) implementation of this algorithm (combined with some other centrality measures) in pascal at http://vlado.fmf.uni-lj.si/pub/networks/stran/central.zip Vlado -- Vladimir Batagelj, University of Ljubljana, Department of Mathematics Jadranska 19, PO Box 2964, 1111 Ljubljana, Slovenia http://vlado.fmf.uni-lj.si _____________________________________________________________________ SOCNET is a service of INSNA, the professional association for social network researchers (http://www.insna.org). To unsubscribe, send an email message to [log in to unmask] containing the line UNSUBSCRIBE SOCNET in the body of the message.