We consider the random reversible Markov kernel K obtained by assigning i.i.d. nonnegative weights to the edges of the complete graph over n vertices and normalizing by the corresponding row sum. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback