24 citations · 50 across the 12 of their papers we have counts for
12 papers
Colour ratio in Prim's ranking of bipartite graphs
Félix Kahane, Minmin Wang
We consider a complete bipartite graph of size endowed with i.i.d. uniform edge weights and run Prim's Algorithm to obtain a ranking of its vertices. Let be the pro…
Revisiting scaling limits for critical inhomogeneous random graphs with finite third moments
Louigi Addario-Berry, Sasha Bell, Prabhanka Deka +4
We consider the rank-1 inhomogeneous random graph in the Brownian regime in the critical window. Aldous studied the weights of the components, and showed that this ordered sequence…
Random bipartite graphs with i.i.d. weights and applications to inhomogeneous random intersection graphs
Alastair Haig, Minmin Wang
We propose a random bipartite graph with weights assigned to both parts of the vertex sets. Edges are formed independently with probabilities that depend on these weights. This bip…
Stable trees as mixings of inhomogeneous continuum random trees
Minmin Wang
It has been claimed in Aldous, Miermont and Pitman [PTRF, 2004] that all Lévy trees are mixings of inhomogeneous continuum random trees. We give a rigorous proof of this claim in t…
Pruning, cut trees, and the reconstruction problem
Nicolas Broutin, Hui He, Minmin Wang
We consider a pruning of the inhomogeneous continuum random trees, as well as the cut trees that encode the genealogies of the fragmentations that come with the pruning. We propose…
Limits of multiplicative inhomogeneous random graphs and Lévy trees: Limit theorems
Nicolas Broutin, Thomas Duquesne, Minmin Wang
We consider a natural model of inhomogeneous random graphs that extends the classical Erd\H os-Rényi graphs and shares a close connection with the multiplicative coalescence, as po…