Random matching problems on the complete graph.

@article{Wästlund2008,
author = {Wästlund, Johan},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {minimum matching; exponential; expectation; mean field; network},
language = {eng},
pages = {258-265},
publisher = {University of Washington},
title = {Random matching problems on the complete graph.},
url = {http://eudml.org/doc/233189},
volume = {13},
year = {2008},
}

TY - JOUR
AU - Wästlund, Johan
TI - Random matching problems on the complete graph.
JO - Electronic Communications in Probability [electronic only]
PY - 2008
PB - University of Washington
VL - 13
SP - 258
EP - 265
LA - eng
KW - minimum matching; exponential; expectation; mean field; network
UR - http://eudml.org/doc/233189
ER -