Prediction and prevention of disproportionally dominant agents in complex networks

DOI10.1073/PNAS.2003632117zbMath1485.05168arXiv1711.09890OpenAlexW3093440660WikidataQ100693621 ScholiaQ100693621MaRDI QIDQ5073191

Sandro Claudio Lera, Alex P. Pentland, Didier Sornette

Publication date: 5 May 2022

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.09890

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Computational Optimal Transport: With Applications to Data Science
• Theory of Zipf's law and beyond
• Statistical models for company growth
• Generalised central limit theorems for growth rate distribution of complex systems
• Emergence of Scaling in Random Networks
• The Limits of Monopolization Through Acquisition
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• Selection, Growth, and the Size Distribution of Firms
• Zipf's Law for Cities: An Explanation
• On the Mechanics of Firm Growth
• THE FAIR REWARD PROBLEM: THE ILLUSION OF SUCCESS AND HOW TO SOLVE IT

This page was built for publication: Prediction and prevention of disproportionally dominant agents in complex networks