Calculates different network statistics.

Node Analyzer:

- Node degree: Counts the number of incident edges. The percent degree is the percentage of edges in comparison to the total amount of edges.
- In/out degree: Counts the number of incoming/outgoing edges. The percent incoming/outgoing degree is the percentage of edges in comparison to the total amount of edges.
- Closeness centrality: Divides the number of nodes of the component by the sum of all distances from the analyzed node to all other nodes within the component. The node with the highest value is the most central node of its component.
- Node weight: The sum of the weight of all incident edges and the average weight.
- Clustering coefficient: Analyzes the neighborhood of the node. If they form a clique the coefficient is 1 and if no neighbor is connected to another neighbor it is 0.
- Hubs & Authority: Assigns hub and authority scores to each node depending on the topology of the network. The essential idea is that a node is a hub to the extent that it links to authoritative nodes, and is an authority to the extent that it is referenced by 'hub' nodes. The analyzer considers existing edge weights as similarities and thus converts the edge weight to a distance by calculating edgeWeight - maxEdgeWeight. To calculate the score the implementation of JUNG the Java Universal Network/Graph Framework is used.
- Barycenter: Assigns scores to each node according to the sum of its distances to all other nodes. Since the edge weight by default represents a similarity it is converted to a distance by computing maxEdgeWeight - edgeWeight. To calculate the score the implementation of JUNG the Java Universal Network/Graph Framework is used.

- Edge degree: Counts the number of incident nodes. The percent degree is the percentage of nodes in comparison to the total amount of nodes.
- Edge weight: The sum of the weight of all incident nodes and the average weight.

- Connected component: Counts the number of connected components and analyzes the size (number of nodes) of each component.
- Partition counter: The number of partitions in this graph.
- Node counter: The number of nodes in this graph.
- Edge counter: The number of edges in this graph.

- Percentage to analyze
- The percentage of objects to analyze.
- Multithreaded
- If ticket the objects are analyzed in parallel.
- Wide summary table
- If ticket the summary table represents each value in its own column otherwise it represents each value in its own row.

- This node has no views

- 01_Tarceva_neighbor_network_from_SureChEMBLKNIME Hub
- 02_NetworkAnalytics_meets_TextProcessingKNIME Hub
- 02_Topic Detection Analysis_Deployment_Web PortalKNIME Hub
- 03_Applying_Text_and_Network_Analysis_Techniques_to_ForumsKNIME Hub
- 03_Co-occurrence_NetworkKNIME Hub
- Show all 38 workflows

- No links available

You want to see the source code for this node? Click the following button and we’ll use our super-powers to find it for you.

To use this node in KNIME, install the extension KNIME Network Mining from the below update site following our NodePit Product and Node Installation Guide:

v5.2

A zipped version of the software site can be downloaded here.

Deploy, schedule, execute, and monitor your KNIME workflows locally, in the cloud
or on-premises – with our brand new **NodePit Runner**.

Do you have feedback, questions, comments about NodePit, want to support this platform, or want your own nodes or workflows listed here as well? Do you think, the search results could be improved or something is missing? Then please get in touch! Alternatively, you can send us an email to mail@nodepit.com, follow @NodePit on Twitter or botsin.space/@nodepit on Mastodon.

**Please note that this is only about NodePit. We do not provide general support for KNIME — please use the KNIME forums instead.**