Node importance

As explained in Graph Algorithms for Data Science

Node importance is a graph property that quantifies the significance of a node according to a chosen criterion such as influence over information flow.

Node importance quantifies how significant a node is according to a chosen criterion. Centrality algorithms identify important or central nodes, including nodes that strongly influence information flow between communities. section 1.1

Analyzing node importance supports practical graph tasks:

• Identify influential nodes that can control, withhold, or redirect information between communities. section 1.1
• Design marketing strategies for spreading information through a network. section 1.1
• Find nodes in favorable positions for accomplishing a specific task. section 1.1

Influence between communities

A node providing the only connection between communities can become highly important because information flows through it. Such a node may influence what reaches each community or support targeted information spreading. section 1.1

Figure 1.9 Identifying influential nodes

Use the influential-nodes figure to visualize how node importance relates to information flow through a graph. section 1.1

How Graph Algorithms for Data Science covers it

How deep it goes

Defines importance through centrality and information-flow influence but does not specify a calculation or implementation.

Examples

Uses bridge nodes between communities, social media influencers, information spreading, and targeted marketing as examples.

What you can do after

Evaluate influential nodes and apply their positions to information-spreading or targeting strategies.

How it connects

Connects node importance with centrality algorithms, community detection, information flow, recommendations, marketing, and machine learning.

liveBookmanning.com

Read Graph Algorithms for Data Science on liveBook Get the book at manning.com

Related concepts

• PageRankmeasured by · PageRank is a link-analysis algorithm that estimates the relative importance of nodes in a directed graph from the structure and importance of incoming links.
• centralitymeasured by · Centrality is a family of graph measures that quantify a node’s structural importance or influence according to specified criteria.

This explainer was generated by Manning's knowledge graph from the text of Graph Algorithms for Data Science. The section links point to the parts of the book it draws on.