¶ Description
Compute leadership index from a social graph.
¶ Parameters
¶ Standard tab
Parameters:
- Definition of best contact in neighboring community
- Simple normalization - heaviest connection height
- Simple normalization - highest leadership ranking
- Simple normalization - highest leadership ranking wighted by connection weight
- Use community size for normalization - highest Leadership ranking weighted by connection weight
- Use community size for normalization - simple normalization - heighest Leadership ranking
- Use community size for normalization - highest leadeship ranking weighted by connection weight
- Stopping criterias
- Max number of iterations
- Stop when largest change in Leadership ranking between 2 iterations is below
- Treat disconnected components separately
¶ Advanced tab
Parameters:
- Columns (Arcs) from A to B on 1st pin
- Column with ID A
- Column with ID B
- Weight of connections A<->B
- Maximum value for a Node Id
- Communities on 2nd pin
- Node ID
- Node community
¶ About
The Leadership action button calculates the leadership influence of nodes within and across communities in a network graph. It ranks nodes based on their significance in facilitating communication between communities.
This action is used to identify the most influential nodes ("leaders") based on their positions in the network and their connection strengths. It considers community structure and allows for multiple normalization strategies.
¶ ⚙️ Configuration
-
Input 1: Connections
A: Source Node IDB: Target Node IDWeight: Strength of the connection between A and B
-
Input 2: Communities
A: Node IDCommunity: Community ID to which the node belongs
-
Normalization Strategy (choose only one):
Simple normalization - highest leadership ranking✅ (enabled in this example)
-
Stopping Criteria:
Max number of iterations: 10,000,000Threshold for change: 0Treat disconnected components separately: Enabled
¶ Example Input
¶ Connections Table
| A | B | Weight |
|---|---|---|
| 1 | 2 | 1 |
| 2 | 3 | 1 |
| 3 | 4 | 1 |
| 4 | 5 | 1 |
| 5 | 6 | 1 |
| 6 | 7 | 1 |
| 7 | 8 | 1 |
| 8 | 1 | 1 |
¶ Communities Table
| A | Community |
|---|---|
| 1 | 1 |
| 2 | 1 |
| 3 | 2 |
| 4 | 1 |
| 5 | 1 |
| 6 | 2 |
| 7 | 1 |
| 8 | 1 |
¶ Output
The result includes a new column, Leadership_(X), representing the computed leadership score for each node:
Nodes with higher values are more central or better positioned to influence other communities.
¶ Use Cases
- Detect community ambassadors
- Optimize inter-community communication
- Identify structural weaknesses in social or IT networks
¶ Notes
- Only one normalization option should be active at a time.
- Ensure that there are connections between communities, or the action will throw:
ERROR: nothing to compute
