How to assign weight to a node in a directed network graph and calculate the effective node weight?
My Problem:
I have a set of nodes, with some nodes are connected by directional edges.
I want to assign the weights to each node and each edge.
Finally I would like to calculate effective node weights based on influence of the connected nodes.
Background:
Currently I am using JUNG to solve my problem.
I looked at JUNG package edu.uci.ics.jung.algorithms.scoring. But not sure if they would help me achieve my objectives.
Any help would be appreciated.
Thanks,
Ramesh
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Just for ease, here it is…
(1) Say I have a graph with many nodes of predetermined risk for each node.
(2) Now some of these nodes are connected to others with directional edges. These edges have variable thickness. i.e. Depending on the size of the edge, the resultant risk would vary.
(3) Now I would like to calculate the effective risk of these nodes based on the connectivity.
I have seen JUNG scoring packages. I am not sure which algorithm that I need to use based on my requirement. Can you please suggest which would be more appropriate & is there a sample implementation?
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
As I said above, I responded on StackOverflow (and have just done so again). Let's keep the discussion in one place, i.e., not here. :)
I will summarize my response there by saying that you still haven't defined your risk model and thus there is no way to define an algorithm and no way to help you. If you've got a paper on which your unspecified model is based, you should at least link it.
Joshua
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
How to assign weight to a node in a directed network graph and calculate the effective node weight?
My Problem:
I have a set of nodes, with some nodes are connected by directional edges.
I want to assign the weights to each node and each edge.
Finally I would like to calculate effective node weights based on influence of the connected nodes.
Background:
Currently I am using JUNG to solve my problem.
I looked at JUNG package edu.uci.ics.jung.algorithms.scoring. But not sure if they would help me achieve my objectives.
Any help would be appreciated.
Thanks,
Ramesh
Answered (to the extent currently possible) on your StackOverflow question: http://stackoverflow.com/questions/13982323/how-to-assign-weight-to-a-node-in-a-directed-network-graph-and-caculate-the-effe
(You're not really providing enough information about your requirements; I suggest you revise the question.)
Joshua
Joshua - I stated my question at http://stackoverflow.com/questions/13982323/how-to-assign-weight-to-a-node-in-a-directed-network-graph-and-caculate-the-effe
Just for ease, here it is…
(1) Say I have a graph with many nodes of predetermined risk for each node.
(2) Now some of these nodes are connected to others with directional edges. These edges have variable thickness. i.e. Depending on the size of the edge, the resultant risk would vary.
(3) Now I would like to calculate the effective risk of these nodes based on the connectivity.
I have seen JUNG scoring packages. I am not sure which algorithm that I need to use based on my requirement. Can you please suggest which would be more appropriate & is there a sample implementation?
As I said above, I responded on StackOverflow (and have just done so again). Let's keep the discussion in one place, i.e., not here. :)
I will summarize my response there by saying that you still haven't defined your risk model and thus there is no way to define an algorithm and no way to help you. If you've got a paper on which your unspecified model is based, you should at least link it.
Joshua