5 citations · 7 across the 4 of their papers we have counts for
5 papers
Structural Optimization Makes Graph Classification Simpler and Better
Junran Wu, Jianhao Li, Yicheng Pan +1
In deep neural networks, better results can often be obtained by increasing the complexity of previously developed basic models. However, it is unclear whether there is a way to bo…
An Information-theoretic Perspective of Hierarchical Clustering
Yicheng Pan, Feng Zheng, Bingchen Fan
A combinatorial cost function for hierarchical clustering was introduced by Dasgupta \cite{dasgupta2016cost}. It has been generalized by Cohen-Addad et al. \cite{cohen2019hierarchi…
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…
Structure Entropy and Resistor Graphs
Angsheng Li, Yicheng Pan
We propose the notion of {\it resistance of a graph} as an accompanying notion of the structure entropy to measure the force of the graph to resist cascading failure of strategic v…
Rectangle Transformation Problem
Shaojiang Wang, Kun He, Yicheng Pan +1
In this paper, we propose the rectangle transformation problem (RTP) and its variants. RTP asks for a transformation by a rectangle partition between two rectangles of the same are…