***** To join INSNA, visit http://www.insna.org *****
What is it that this is in aid of?
First: I assume that by "geodesic" you mean "shortest path", in which
case the lengths of all shortest paths will (by definition) be the
same, and so this matrix would not be able to distinguish between
"lots of short paths" and "few long paths". Perhaps this is your
intent, of course.
Second: Depending on the topology of your network, there can be an
exponential number of such paths connecting two vertices.
So it may be worth reconsidering whether calculating this matrix is a
good solution to whatever problem you're trying to solve.
On Tue, Mar 23, 2010 at 9:42 AM, Manolis Tranos <[log in to unmask]> wrote:
> ***** To join INSNA, visit http://www.insna.org *****
> Dear SOCNET members,
> I am working on a weighted network and trying to calculate a matrix, each
> cell of which will be the sum of the weights of all the possible geodesics
> between any pair of nodes in the network.
> Any suggestions on how to calculate such a matrix will be more than
> Best regards,
> _____________________________________________________________________ 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.
Joshua O'Madadhain: Information Scientist, Musician, Philosopher-At-Tall
It's that moment of dawning comprehension that I live for. -- Bill Watterson
My opinions are too rational and insightful to be those of any organization.
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.