algorithms:eccentricity

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision | |||

algorithms:eccentricity [2018/10/17 10:41] systems |
algorithms:eccentricity [2018/12/20 14:23] (current) systems |
||
---|---|---|---|

Line 3: | Line 3: | ||

^Input parameter ^Type ^Default ^Description ^ | ^Input parameter ^Type ^Default ^Description ^ | ||

- | |Distance*|text|None |Link property acting as weight for the distance calculations. Must be positive numbers.| | + | |Distance|text|None |Link property acting as weight for the distance calculations. Must be positive numbers.| |

- | |As undirected*|Bool|False|Whether to consider a directed network as undirected. It substantially speeds up the execution.| | + | |As undirected|Bool|False|Whether to consider a directed network as undirected. It substantially speeds up the execution.| |

- | |Calculate eccentricity per connected component*|Bool|True| Whether to restrict the distance calculation to reachable nodes, avoiding divergences because formally a node that can not be reached from another node would have infinite eccentricity.| | + | |Calculate eccentricity per connected component|Bool|True| Whether to restrict the distance calculation to reachable nodes, avoiding divergences because formally a node that can not be reached from another node would have infinite eccentricity.| |

- | * //Advanced Configuration Parameter// | + | |

\\ | \\ | ||

In the following figure we show two networks. On the left hand side we plot a book characters network we color the nodes according to their eccentricity. The minimum value (3) corresponds to the green node, meaning that any other node is at most three hops away from it. Nodes colored in blue, pink and red have higher eccentricity (4, 5 and 6 respectively) and are not so well connected with the whole network. | In the following figure we show two networks. On the left hand side we plot a book characters network we color the nodes according to their eccentricity. The minimum value (3) corresponds to the green node, meaning that any other node is at most three hops away from it. Nodes colored in blue, pink and red have higher eccentricity (4, 5 and 6 respectively) and are not so well connected with the whole network. |

algorithms/eccentricity.txt · Last modified: 2018/12/20 14:23 by systems