Longmin Wang

According to our database, Longmin Wang authored at least 3 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

The speed of a biased walk on a Galton-Watson tree without leaves is monotonic for low values of bias.

He Song, Longmin Wang, Kai-Nan Xiang

J. Appl. Probab., 2025

2020

An invariance principle and a large deviation principle for the biased random walk on ${\mathbb{Z}}^{\lowercase{\textbf{\textit{d}}}}$.

Yuelin Liu, Vladas Sidoravicius, Longmin Wang, Kai-Nan Xiang

J. Appl. Probab., 2020

2018

The largest component in critical random intersection graphs.

Bin Wang, Longmin Wang, Kai-Nan Xiang

Discuss. Math. Graph Theory, 2018