3 citations · 3 across the 3 of their papers we have counts for
5 papers · 1 filter
Criticality and universality in network dismantling
Lorenzo Cirigliano, Claudio Castellano, Minsuk Kim +2
Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications…
Shortest-path percolation on scale-free networks
Minsuk Kim, Lorenzo Cirigliano, Claudio Castellano +4
The shortest-path percolation (SPP) model aims at describing the consumption and eventual exhaustion of a network's resources. Starting from a network containing a macroscopic conn…
Modeling resource consumption in the US air transportation system via minimum-cost percolation
Minsuk Kim, C. Tyler Diggans, Filippo Radicchi
We introduce a dynamic percolation model aimed at describing the consumption, and eventual exhaustion, of resources in transportation networks. In the model, rational agents progre…
Shortest-path percolation on random networks
Minsuk Kim, Filippo Radicchi
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…
Reconstruction of multiplex networks via graph embeddings
Daniel Kaiser, Siddharth Patwardhan, Minsuk Kim +1
Multiplex networks are collections of networks with identical nodes but distinct layers of edges. They are genuine representations for a large variety of real systems whose element…