Minmin Wang

collaborators

Showing math.PRShow all

2 papers · 1 filter

math.PR2023

Large random intersection graphs inside the critical window and triangle counts

Minmin Wang

We identify the scaling limit of random intersection graphs inside their critical windows. The limit graphs vary according to the clustering regimes, and coincide with the continuu…

math.PR2020

$k$ -cut model for the Brownian Continuum Random Tree

Minmin Wang

To model the destruction of a resilient network, Cai, Holmgren, Devroye and Skerman introduced the $k$ -cut model on a random tree, as an extension to the classic problem of cutting…

Large random intersection graphs inside the critical window and triangle counts

k-cut model for the Brownian Continuum Random Tree

$k$ -cut model for the Brownian Continuum Random Tree