Optimizing edge weights in the inverse eigenvector centrality problem
Scientists discover six ways to algorithmically engineer social influence.
Researchers have solved the 'inverse eigenvector centrality' problem, developing six optimization methods to manipulate network influence scores. Given a desired ranking of node importance, their algorithms calculate the exact edge weights needed to achieve it. Tested on real-world social networks, the framework shows how different strategies produce distinct network structures while maintaining the prescribed hierarchy. This provides a mathematical toolkit for network reconstruction, design, and systematic influence manipulation.
Why It Matters
This creates a blueprint for algorithmically controlling perceived influence and authority in any connected system, from social media to organizations.