[{"content":" Download Paper Supplementary Material Preprint Code and data Abstract We examine how scale-free networks lose connectivity when edges are systematically removed based on shortest-path distances between randomly selected node pairs. Using a budget parameter to control whether paths are eliminated, we conduct large-scale simulations on scale-free networks with power-law degree distributions. We find that the percolation transition is identical to the one observed on Erdős–Rényi networks, denoting independence from the degree exponent. A key discovery is that the removal process drastically homogenizes the heterogeneous structure of scale-free networks before the shortest-path percolation transition takes place, distinguishing finite and infinite budget scenarios.\nEstimation of the Critical Exponents of the SPP on Scale-free Networks Citation M. Kim, L. Cirigliano, C. Castellano, H. Sun, R. Jankowski, A. Poggialini, and F. Radicchi, \u0026ldquo;Shortest-path percolation on scale-free networks,\u0026rdquo; Physical Review E 113, 014314 (2026).\n@article{PhysRevE.113.014314, title = {Shortest-path percolation on scale-free networks}, author = {Kim, Minsuk and Cirigliano, Lorenzo and Castellano, Claudio and Sun, Hanlin and Jankowski, Robert and Poggialini, Anna and Radicchi, Filippo}, journal = {Phys. Rev. E}, volume = {113}, pages = {014314}, year = {2026}, doi = {10.1103/PhysRevE.113.014314}, url = {https://journals.aps.org/pre/abstract/10.1103/PhysRevE.113.014314} } ","permalink":"https://minsuk-daniel-kim.me/papers/paper3/","summary":"We study how scale-free networks lose connectivity when edges are systematically removed along shortest paths between randomly selected node pairs. Through large-scale simulations, we find that the percolation transition is identical to that observed on Erdős–Rényi networks, denoting independence from the degree exponent. A key discovery is that the removal process drastically homogenizes the heterogeneous structure of scale-free networks before the transition takes place.","title":"Shortest-path percolation on scale-free networks"},{"content":" Download Paper Preprint Code and data Abstract We present a dynamic percolation framework for studying resource depletion in transportation networks. Agents consume network edges along cost-optimal paths, causing the system to transition from functional to non-functional states. Applied to the US air transportation system, the analysis reveals that unrestricted carrier cooperation could yield a 30% efficiency increase compared to the non-cooperative scenario. While requiring major airlines to share market portions, such arrangements would enhance system resilience to disruptions like flight cancellations. The findings suggest code-sharing agreements could provide substantial benefits without modifying operational costs.\nSchematic Diagram of the Minimum-cost Percolation Model Citation M. Kim, C. T. Diggans, and F. Radicchi, \u0026ldquo;Modeling resource consumption in the US air transportation system via minimum-cost percolation,\u0026rdquo; Nature Communications 16, 8105 (2025).\n@article{kim2025modeling, title = {Modeling resource consumption in the {US} air transportation system via minimum-cost percolation}, author = {Kim, Minsuk and Diggans, C. Tyler and Radicchi, Filippo}, journal = {Nature Communications}, volume = {16}, pages = {8105}, year = {2025}, doi = {10.1038/s41467-025-63489-w}, url = {https://doi.org/10.1038/s41467-025-63489-w} } ","permalink":"https://minsuk-daniel-kim.me/papers/paper2/","summary":"We present a dynamic percolation framework for studying resource depletion in transportation networks. Agents consume network edges along cost-optimal paths, causing the system to transition from functional to non-functional states. Applied to the US air transportation system, we find that unrestricted carrier cooperation could yield a 30% efficiency increase compared to the non-cooperative scenario.","title":"Modeling resource consumption in the US air transportation system via minimum-cost percolation"},{"content":" Download Paper Supplementary Material Preprint Code and data Abstract We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a certain budget. As pairs of nodes are demanded and edges are removed, the macroscopic connected component of the graph disappears, i.e., the graph undergoes a percolation transition. Here, we study such a shortest-path-percolation transition in homogeneous random graphs where pairs of demanded origin-destination nodes are randomly generated, and fully characterize it by means of finite-size scaling analysis. If budget is finite, the transition is identical to the one of ordinary percolation, where a single giant cluster shrinks as edges are removed from the graph; for infinite budget, the transition becomes more abrupt than the one of ordinary percolation, being characterized by the sudden fragmentation of the giant connected component into a multitude of clusters of similar size.\nSchematic Diagram of the Shortest-path percolation model Citation M. Kim and F. Radicchi, Shortest-path percolation on random networks, Physical Review Letters 133, 047402 (2024).\n@article{PhysRevLett.133.047402, title = {Shortest-Path Percolation on Random Networks}, author = {Kim, Minsuk and Radicchi, Filippo}, journal = {Phys. Rev. Lett.}, volume = {133}, issue = {4}, pages = {047402}, numpages = {5}, year = {2024}, month = {Jul}, publisher = {American Physical Society}, doi = {10.1103/PhysRevLett.133.047402}, url = {https://link.aps.org/doi/10.1103/PhysRevLett.133.047402} } Related material ","permalink":"https://minsuk-daniel-kim.me/papers/paper1/","summary":"We propose a bond-percolation model to describe the consumption and exhaustion of resources in transport networks. Edges forming minimum-length paths between origin-destination nodes are removed when below a budget threshold, eventually causing the network to undergo a percolation transition. We show that finite budget yields a transition identical to ordinary percolation, while infinite budget leads to a more abrupt fragmentation of the giant connected component.","title":"Shortest-path percolation on Random Networks"},{"content":" Mailing address Minsuk Kim\nCenter for Complex Networks and Systems Research\nLuddy School of Informatics, Computing, and Engineering\nIndiana University Bloomington\nOffice address Luddy Center for Artificial Intelligence\n1015 East 11th St.\nBloomington, IN 47408\nOffice location ","permalink":"https://minsuk-daniel-kim.me/location/","summary":"\u003chr\u003e\n\u003ch4 id=\"mailing-address\"\u003eMailing address\u003c/h4\u003e\n\u003cp\u003eMinsuk Kim\u003cbr\u003e\nCenter for Complex Networks and Systems Research\u003cbr\u003e\nLuddy School of Informatics, Computing, and Engineering\u003cbr\u003e\nIndiana University Bloomington\u003c/p\u003e\n\u003chr\u003e\n\u003ch4 id=\"office-address\"\u003eOffice address\u003c/h4\u003e\n\u003cp\u003eLuddy Center for Artificial Intelligence\u003cbr\u003e\n1015 East 11th St.\u003cbr\u003e\nBloomington, IN 47408\u003c/p\u003e\n\u003chr\u003e\n\u003ch4 id=\"office-location\"\u003eOffice location\u003c/h4\u003e\n\u003ciframe src=\"https://www.google.com/maps/embed?pb=!1m18!1m12!1m3!1d3093.042401829639!2d-86.52464262344425!3d39.173756771666426!2m3!1f0!2f0!3f0!3m2!1i1024!2i768!4f13.1!3m3!1m2!1s0x886c67191563decd%3A0xe86d6e042f73a832!2sLuddy%20Center%20for%20Artificial%20Intelligence!5e0!3m2!1sen!2sus!4v1775585029334!5m2!1sen!2sus\" width=\"700\" height=\"500\" style=\"border:0;\" allowfullscreen=\"\" loading=\"lazy\" referrerpolicy=\"no-referrer-when-downgrade\"\u003e\u003c/iframe\u003e","title":"Location"}]