5 citations · 14 across the 14 of their papers we have counts for
7 papers · 1 filter
The idemetric property: when most distances are (almost) the same
George Barmpalias, Neng Huang, Andrew Lewis-Pye +4
We introduce the \emph{idemetric} property, which formalises the idea that most nodes in a graph have similar distances between them, and which turns out to be quite standard among…
Community Structures Are Definable in Networks: A Structural Theory of Networks
Angsheng Li, Yicheng Pan, Jiankou Li
We found that neither randomness in the ER model nor the preferential attachment in the PA model is the mechanism of community structures of networks, that community structures are…
Provable Security of Networks
Angsheng Li, Yicheng Pan, Wei Zhang
We propose a definition of {\it security} and a definition of {\it robustness} of networks against the cascading failure models of deliberate attacks and random errors respectively…
Homophyly Networks -- A Structural Theory of Networks
Angsheng Li, Jiankou Li, Yicheng Pan
A grand challenge in network science is apparently the missing of a structural theory of networks. The authors have showed that the existence of community structures is a universal…
Community Structures Are Definable in Networks, and Universal in Real World
Angsheng Li, Jiankou Li, Yicheng Pan
Community detecting is one of the main approaches to understanding networks \cite{For2010}. However it has been a longstanding challenge to give a definition for community structur…
Dimensions, Structures and Security of Networks
Angsheng Li, Wei Zhang, Yicheng Pan
One of the main issues in modern network science is the phenomenon of cascading failures of a small number of attacks. Here we define the dimension of a network to be the maximal n…
Homophyly and Randomness Resist Cascading Failure in Networks
Angsheng Li, Wei Zhang, Yicheng Pan +1
The universal properties of power law and small world phenomenon of networks seem unavoidably obstacles for security of networking systems. Existing models never give secure networ…