3 papers
math.PR2026
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 pr…
math.PR2025
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…
math.PR2025
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…