Shi Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shi Feng has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Balázs Gerencsér
HUN-REN Alfréd Rényi Institute of Mathematics Budapest Hungary
1 shared publication
Latest Publications
- 1 May 2026
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (2) , 1547-1569
Optimal matching problem on the Boolean cube
We establish upper and lower bounds for the expected Wasserstein-1 distance between the random empirical measure and the uniform measure on the Boolean cube. Our analysis leverages techniques from Fourier analysis, following the framework introduced in (Ann. Appl. Probab. 31 (2021) 2567–2584), as well as methods from large deviations theory.
- 1 May 2026
- Published by Bernoulli Society for Mathematical Statistics and Probability in Bernoulli
- Vol. 32 (2) , 1547-1569
Optimal matching problem on the Boolean cube
We establish upper and lower bounds for the expected Wasserstein-1 distance between the random empirical measure and the uniform measure on the Boolean cube. Our analysis leverages techniques from Fourier analysis, following the framework introduced in (Ann. Appl. Probab. 31 (2021) 2567–2584), as well as methods from large deviations theory.
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 31 (none) , 1-27
Mixing on the cycle with constant size perturbation
Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible transition probabilities are used. More precisely, a mixing time of O(n k+2 k+1) can be achieved by adding k random edges to the cycle, keeping k fixed while n→∞. The construction builds upon a biased random walk along the cycle.
- 1 January 2026
- Published by Institute of Mathematical Statistics in Electronic Journal of Probability
- Vol. 31 (none) , 1-27
Mixing on the cycle with constant size perturbation
Considering a Markov chain defined on a cycle, near-quadratic improvement of mixing is shown when only a subtle perturbation is introduced to the structure and non-reversible transition probabilities are used. More precisely, a mixing time of O(n k+2 k+1) can be achieved by adding k random edges to the cycle, keeping k fixed while n→∞. The construction builds upon a biased random walk along the cycle.