Angsheng Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Angsheng Li has a total of 55 co-authors. Here are the top co-authors by number of shared publications:
Yicheng Pan
7 shared publicationsXi Yong
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P. R. China
6 shared publications- S. Barry Cooper
University of Leeds
5 shared publications - Peng Zhang
Shandong University
4 shared publications - Yicheng Pan
State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences
4 shared publications - Andrew Lewis-Pye
London School of Economics, London, United Kingdom
3 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4499-4509
When Does Structural Entropy Track Labels? Margins, Diagnostics, and Failure Modes in Graph Clustering
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4499-4509
Open AccessWhen Does Structural Entropy Track Labels? Margins, Diagnostics, and Failure Modes in Graph Clustering
- Open Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 114-122
Minimum Entropy Principle Guided Graph Neural Networks
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 114-122
Open AccessMinimum Entropy Principle Guided Graph Neural Networks
- Open Access
- 3 June 2019
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 3
Emergence of Network Bifurcation Triggered by Entanglement
In many non-linear systems, such as plasma oscillation, boson condensation, chemical reaction, and even predatory-prey oscillation, the coarse-grained dynamics are governed by an equation containing anti-symmetric transitions, known as the anti-symmetric Lotka-Volterra (ALV) equations. In this work, we prove the existence of a novel bifurcation mechanism for the ALV equations, where the equilibrium state can be drastically changed by flipping the stability of a pair of fixed points. As an application, we focus on the implications of the bifurcation mechanism for evolutionary networks; we found that the bifurcation point can be determined quantitatively by the microscopic quantum entanglement. The equilibrium state can be critically changed from one type of global demographic condensation to another state that supports global cooperation for homogeneous networks. In other words, our results indicate that there exist a class of many-body systems where the macroscopic properties are invariant with a certain amount of microscopic entanglement, but they can be changed abruptly once the entanglement exceeds a critical value. Furthermore, we provide numerical evidence showing that the emergence of bifurcation is robust against the change of the network topologies, and the critical values are in good agreement with our theoretical prediction. These results show that the bifurcation mechanism could be ubiquitous in many physical systems, in addition to evolutionary networks.
- 3 June 2019
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 3
Open AccessEmergence of Network Bifurcation Triggered by Entanglement
In many non-linear systems, such as plasma oscillation, boson condensation, chemical reaction, and even predatory-prey oscillation, the coarse-grained dynamics are governed by an equation containing anti-symmetric transitions, known as the anti-symmetric Lotka-Volterra (ALV) equations. In this work, we prove the existence of a novel bifurcation mechanism for the ALV equations, where the equilibrium state can be drastically changed by flipping the stability of a pair of fixed points. As an application, we focus on the implications of the bifurcation mechanism for evolutionary networks; we found that the bifurcation point can be determined quantitatively by the microscopic quantum entanglement. The equilibrium state can be critically changed from one type of global demographic condensation to another state that supports global cooperation for homogeneous networks. In other words, our results indicate that there exist a class of many-body systems where the macroscopic properties are invariant with a certain amount of microscopic entanglement, but they can be changed abruptly once the entanglement exceeds a critical value. Furthermore, we provide numerical evidence showing that the emergence of bifurcation is robust against the change of the network topologies, and the critical values are in good agreement with our theoretical prediction. These results show that the bifurcation mechanism could be ubiquitous in many physical systems, in addition to evolutionary networks.
- Open Access
Emergence of Network Bifurcation Triggered by Entanglement
In many non-linear systems, such as plasma oscillation, boson condensation, chemical reaction, and even predatory-prey oscillation, the coarse-grained dynamics are governed by an equation containing anti-symmetric transitions, known as the anti-symmetric Lotka-Volterra (ALV) equations. In this work, we prove the existence of a novel bifurcation mechanism for the ALV equations, where the equilibrium state can be drastically changed by flipping the stability of a pair of fixed points. As an application, we focus on the implications of the bifurcation mechanism for evolutionary networks; we found that the bifurcation point can be determined quantitatively by the microscopic quantum entanglement. The equilibrium state can be critically changed from one type of global demographic condensation to another state that supports global cooperation for homogeneous networks. In other words, our results indicate that there exist a class of many-body systems where the macroscopic properties are invariant with a certain amount of microscopic entanglement, but they can be changed abruptly once the entanglement exceeds a critical value. Furthermore, we provide numerical evidence showing that the emergence of bifurcation is robust against the change of the network topologies, and the critical values are in good agreement with our theoretical prediction. These results show that the bifurcation mechanism could be ubiquitous in many physical systems, in addition to evolutionary networks.
Open AccessEmergence of Network Bifurcation Triggered by Entanglement
In many non-linear systems, such as plasma oscillation, boson condensation, chemical reaction, and even predatory-prey oscillation, the coarse-grained dynamics are governed by an equation containing anti-symmetric transitions, known as the anti-symmetric Lotka-Volterra (ALV) equations. In this work, we prove the existence of a novel bifurcation mechanism for the ALV equations, where the equilibrium state can be drastically changed by flipping the stability of a pair of fixed points. As an application, we focus on the implications of the bifurcation mechanism for evolutionary networks; we found that the bifurcation point can be determined quantitatively by the microscopic quantum entanglement. The equilibrium state can be critically changed from one type of global demographic condensation to another state that supports global cooperation for homogeneous networks. In other words, our results indicate that there exist a class of many-body systems where the macroscopic properties are invariant with a certain amount of microscopic entanglement, but they can be changed abruptly once the entanglement exceeds a critical value. Furthermore, we provide numerical evidence showing that the emergence of bifurcation is robust against the change of the network topologies, and the critical values are in good agreement with our theoretical prediction. These results show that the bifurcation mechanism could be ubiquitous in many physical systems, in addition to evolutionary networks.
- Open Access
- 15 August 2018
- Published by Springer Nature in Nature Communications
- Vol. 9 (1) , 1-12
Decoding topologically associating domains with ultra-low resolution Hi-C data by graph structural entropy
Submegabase-size topologically associating domains (TAD) have been observed in high-throughput chromatin interaction data (Hi-C). However, accurate detection of TADs depends on ultra-deep sequencing and sophisticated normalization procedures. Here we propose a fast and normalization-free method to decode the domains of chromosomes (deDoc) that utilizes structural information theory. By treating Hi-C contact matrix as a representation of a graph, deDoc partitions the graph into segments with minimal structural entropy. We show that structural entropy can also be used to determine the proper bin size of the Hi-C data. By applying deDoc to pooled Hi-C data from 10 single cells, we detect megabase-size TAD-like domains. This result implies that the modular structure of the genome spatial organization may be fundamental to even a small cohort of single cells. Our algorithms may facilitate systematic investigations of chromosomal domains on a larger scale than hitherto have been possible.
- 15 August 2018
- Published by Springer Nature in Nature Communications
- Vol. 9 (1) , 1-12
Open AccessDecoding topologically associating domains with ultra-low resolution Hi-C data by graph structural entropy
Submegabase-size topologically associating domains (TAD) have been observed in high-throughput chromatin interaction data (Hi-C). However, accurate detection of TADs depends on ultra-deep sequencing and sophisticated normalization procedures. Here we propose a fast and normalization-free method to decode the domains of chromosomes (deDoc) that utilizes structural information theory. By treating Hi-C contact matrix as a representation of a graph, deDoc partitions the graph into segments with minimal structural entropy. We show that structural entropy can also be used to determine the proper bin size of the Hi-C data. By applying deDoc to pooled Hi-C data from 10 single cells, we detect megabase-size TAD-like domains. This result implies that the modular structure of the genome spatial organization may be fundamental to even a small cohort of single cells. Our algorithms may facilitate systematic investigations of chromosomal domains on a larger scale than hitherto have been possible.
- 7 June 2018
- Published by SAGE Publications in Computability
- Vol. 7 (2-3) , 171-177
Pointed computations and Martin-Löf randomness
Schnorr showed that a real X is Martin-Löf random if and only if K ( X ↾ n ) ⩾ n − c for some constant c and all n , where K denotes the prefix-free complexity function. Fortnow (unpublished) and Nies, Stephan and Terwijn [J. Symbolic Logic 70 (2005
- 7 June 2018
- Published by SAGE Publications in Computability
- Vol. 7 (2-3) , 171-177
Pointed computations and Martin-Löf randomness
Schnorr showed that a real X is Martin-Löf random if and only if K ( X ↾ n ) ⩾ n − c for some constant c and all n , where K denotes the prefix-free complexity function. Fortnow (unpublished) and Nies, Stephan and Terwijn [J. Symbolic Logic 70 (2005
- 28 May 2018
- Published by Cambridge University Press (CUP) in Network Science
- Vol. 6 (2) , 251-264
Establishing social cooperation: The role of hubs and community structure
Prisoner's Dilemma (PD) games have become a well-established paradigm for studying the mechanisms by which cooperative behavior may evolve in societies consisting of selfish individuals. Recent research has focused on the effect of spatial and connectivity structure in promoting the emergence of cooperation in scenarios where individuals play games with their neighbors, using simple “memoryless” rules to decide their choice of strategy in repeated games. While heterogeneity and structural features such as clustering have been seen to lead to reasonable levels of cooperation in very restricted settings, no conditions on network structure have been established, which robustly ensure the emergence of cooperation in a manner that is not overly sensitive to parameters such as network size, average degree, or the initial proportion of cooperating individuals. Here, we consider a natural random network model, with parameters that allow us to vary the level of “community” structure in the network, as well as the number of high degree hub nodes. We investigate the effect of varying these structural features and show that, for appropriate choices of these parameters, cooperative behavior does now emerge in a truly robust fashion and to a previously unprecedented degree. The implication is that cooperation (as modelled here by PD games) can become the social norm in societal structures divided into smaller communities, and in which hub nodes provide the majority of inter-community connections.
- 28 May 2018
- Published by Cambridge University Press (CUP) in Network Science
- Vol. 6 (2) , 251-264
Establishing social cooperation: The role of hubs and community structure
Prisoner's Dilemma (PD) games have become a well-established paradigm for studying the mechanisms by which cooperative behavior may evolve in societies consisting of selfish individuals. Recent research has focused on the effect of spatial and connectivity structure in promoting the emergence of cooperation in scenarios where individuals play games with their neighbors, using simple “memoryless” rules to decide their choice of strategy in repeated games. While heterogeneity and structural features such as clustering have been seen to lead to reasonable levels of cooperation in very restricted settings, no conditions on network structure have been established, which robustly ensure the emergence of cooperation in a manner that is not overly sensitive to parameters such as network size, average degree, or the initial proportion of cooperating individuals. Here, we consider a natural random network model, with parameters that allow us to vary the level of “community” structure in the network, as well as the number of high degree hub nodes. We investigate the effect of varying these structural features and show that, for appropriate choices of these parameters, cooperative behavior does now emerge in a truly robust fashion and to a previously unprecedented degree. The implication is that cooperation (as modelled here by PD games) can become the social norm in societal structures divided into smaller communities, and in which hub nodes provide the majority of inter-community connections.
- 23 March 2017
- Published by Springer Nature in Algorithmica
- Vol. 80 (5) , 1412-1438
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
- 23 March 2017
- Published by Springer Nature in Algorithmica
- Vol. 80 (5) , 1412-1438
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
- Open Access
Pointed computations and Martin-Löf randomness
Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains true if we can merely require that the initial segments of the real corresponding to a computable increasing sequence of lengths are incompressible. The purpose of this note is to establish the following generalization of this fact. We show that a real is X Martin-Loef random if and only if its initial segments corresponding to a pointedly X-computable sequence (r_n) (where r_n is computable from X in a self-delimiting way, so that at most the first r_n bits of X are queried in the computation) of lengths are incompressible. On the other hand we also show that there are reals which are very far from being Martin-Loef random, yet they compute an increasing sequence of lengths at which their initial segments are incompressible.
Open AccessPointed computations and Martin-Löf randomness
Schnorr showed that a real is Martin-Loef random if and only if all of its initial segments are incompressible with respect to prefix-free complexity. Fortnow and independently Nies, Stephan and Terwijn noticed that this statement remains true if we can merely require that the initial segments of the real corresponding to a computable increasing sequence of lengths are incompressible. The purpose of this note is to establish the following generalization of this fact. We show that a real is X Martin-Loef random if and only if its initial segments corresponding to a pointedly X-computable sequence (r_n) (where r_n is computable from X in a self-delimiting way, so that at most the first r_n bits of X are queried in the computation) of lengths are incompressible. On the other hand we also show that there are reals which are very far from being Martin-Loef random, yet they compute an increasing sequence of lengths at which their initial segments are incompressible.
- 1 January 2017
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 466, 211-223
Resistance maximization principle for defending networks against virus attack
- 1 January 2017
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 466, 211-223
Resistance maximization principle for defending networks against virus attack