Heuristic for Network Coverage Optimization Applied in Finding Organizational Change Agents

TL;DR

This paper introduces a new algorithm for selecting organizational change agents based on network coverage, demonstrating improved reach and influence compared to existing methods.

Contribution

The paper proposes a novel algorithm for change agent selection that enhances network coverage and identifies influential opinion leaders.

Findings

The new algorithm outperforms existing methods in network coverage.

Selected change agents are well connected and influential.

Improved organizational network reach achieved.

Abstract

Authors compare different ways of selecting change agents within network analysis paradigm and propose a new algorithm of doing so. All methods are evaluated against network coverage measure that calculates how many network members can be directly reached by selected nodes. Results from the analysis of organizational network show that compared to other methods the proposed algorithm provides better network coverage, at the same time selecting change agents that are well connected, influential opinion leaders.