The lower tail of the random minimum spanning tree.
Flaxman, Abraham D. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Near-minimal spanning trees : a scaling exponent in probability models”
The lower tail of the random minimum spanning tree.
The best bounds in a theorem of Russell Lyons.
Marchal, Philippe (1998)
Electronic Communications in Probability [electronic only]
Similarity:
Dynamical Percolation
Olle Häggström, Yuval Peres, Jeffrey E. Steif (1997)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
The two uniform infinite quadrangulations of the plane have the same law
Laurent Ménard (2010)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
We prove that the uniform infinite random quadrangulations defined respectively by Chassaing–Durhuus and Krikun have the same distribution.
Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings.
Bernardi, Olivier (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The number of -matchings in almost every tree is a zero residue.
Alon, Noga, Haber, Simi, Krivelevich, Michael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A bound for the Steiner tree problem in graphs
Ján Plesník (1981)
Mathematica Slovaca
Similarity: