2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.SI2018★ 2 cited
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…
cs.SI2013
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…