Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

node stress centrality (per node) #20

Open
mjafarpour87 opened this issue Mar 18, 2023 · 0 comments
Open

node stress centrality (per node) #20

mjafarpour87 opened this issue Mar 18, 2023 · 0 comments

Comments

@mjafarpour87
Copy link
Collaborator

The stress of a node n is the number of shortest paths passing through n . A node has a high stress if it is traversed by a high number of shortest paths. This parameter is defined only for networks without multiple edges.

The stress distribution gives the number of nodes with stress s for different values of s. The values for the stress are grouped into bins whose size grows exponentially by a factor of 10. The bins used for this distribution are {0}; [1, 10); [10, 100); ...

There is a tiny difference between stress centrality and betweenness centrality:
Stress vs betweenness centrality
Betweenness centrality assumes a random choice of a shortest path, stress centrality does not take this into account. Stress centrality measures the absolute number of shortest paths while betweenness centrality measures the fraction of the shortest paths passing through a node.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant