Hanqing Zhao

collaborators

2 papers

cond-mat.stat-mech2021

Nonreversible Markov chain Monte Carlo algorithm for efficient generation of Self-Avoiding Walks

Hanqing Zhao, Marija Vucelja

We introduce an efficient nonreversible Markov chain Monte Carlo algorithm to generate self-avoiding walks with a variable endpoint. In two dimensions, the new algorithm slightly o…

cs.LG2018

An $O (N)$ Sorting Algorithm: Machine Learning Sort

Hanqing Zhao, Yuehan Luo

We propose an $O (N \cdot M)$ sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting a…

Nonreversible Markov chain Monte Carlo algorithm for efficient generation of Self-Avoiding Walks

An O(N) Sorting Algorithm: Machine Learning Sort

An $O (N)$ Sorting Algorithm: Machine Learning Sort