activity
20092023
most citedIdentifying optimal targets of network attack by belief propagation

180 citations · 1.1k across the 47 of their papers we have counts for

collaborators
Showing 2016 · physics.soc-phShow all

6 papers · 2 filters

physics.soc-ph2016★ 4 cited

Feedback arcs and node hierarchy in directed networks

Jin-Hua Zhao, Hai-Jun Zhou

Directed networks such as gene regulation networks and neural networks are connected by arcs (directed links). The nodes in a directed network are often strongly interwound by a hu…

physics.soc-ph2016★ 157 cited

Fast and simple decycling and dismantling of networks

Lenka Zdeborová, Pan Zhang, Hai-Jun Zhou

Decycling and dismantling of complex networks are underlying many important applications in network science. Recently these two closely related problems were tackled by several heu…

physics.soc-ph2016★ 1 cited

Optimal Disruption of Complex Networks

Jin-Hua Zhao, Hai-Jun Zhou

The collection of all the strongly connected components in a directed graph, among each cluster of which any node has a path to another node, is a typical example of the intertwini…

physics.soc-ph2016★ 5 cited

A spin glass approach to the directed feedback vertex set problem

Hai-Jun Zhou

A directed graph (digraph) is formed by vertices and arcs (directed edges) from one vertex to another. A feedback vertex set (FVS) is a set of vertices that contains at least one v…

physics.soc-ph2016

Serving by local consensus in the public service location game

Yi-Fan Sun, Hai-Jun Zhou

We discuss the issue of distributed and cooperative decision-making in a network game of public service location. Each node of the network can choose to be a provider of service wh…

physics.soc-ph2016★ 180 cited

Identifying optimal targets of network attack by belief propagation

Salomon Mugisha, Hai-Jun Zhou

For a network formed by nodes and undirected links between pairs of nodes, the network optimal attack problem aims at deleting a minimum number of target nodes to break the network…