Chenyang Zhong

most citedMallows permutation models with

L^{1}

and

L^{2}

distances I: hit and run algorithms and mixing times

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2023

The length of the longest increasing subsequence of Mallows permutation models with $L^{1}$ and $L^{2}$ distances

Chenyang Zhong

Introduced by Mallows in statistical ranking theory, Mallows permutation model is a class of non-uniform probability measures on the symmetric group $S_{n}$ that depend on a distance…

math.PR2021★ 2 cited

Mallows permutation models with $L^{1}$ and $L^{2}$ distances I: hit and run algorithms and mixing times

Chenyang Zhong

Mallows permutation model, introduced by Mallows in statistical ranking theory, is a class of non-uniform probability measures on the symmetric group $S_{n}$ . The model depends on a…

The length of the longest increasing subsequence of Mallows permutation models with L1 and L2 distances

Mallows permutation models with L1 and L2 distances I: hit and run algorithms and mixing times

The length of the longest increasing subsequence of Mallows permutation models with $L^{1}$ and $L^{2}$ distances

Mallows permutation models with $L^{1}$ and $L^{2}$ distances I: hit and run algorithms and mixing times