186 citations · 221 across the 16 of their papers we have counts for
1 paper · 1 filter
Yves Le Jan
We study biased spanning forests on the complete graph \(K_N\), obtained by assigning weight proportional to \(κ^q\) to spanning trees on \(K_N\cup\{Δ\}\), where \(q\) is the degre…