Search: onr:"swepub:oai:DiVA.org:liu-51715" >
Concentration of th...
Concentration of the cost of a random matching problem
-
- Hessler, Martin, 1979- (author)
- Linköpings universitet,Tillämpad matematik,Tekniska högskolan
-
- Wästlund, Johan (author)
- Linköpings universitet,Tillämpad matematik,Tekniska högskolan
-
(creator_code:org_t)
- English.
- Related links:
-
http://urn.kb.se/res...
-
show more...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- Let Mn be the minimum cost of a perfect matching on a complete graph on n vertices whose edges are assigned independent exponential costs. It follows from work of D. Aldous that Mn converges in probability to π2/12. This was earlier conjectured by M. Mézard and G. Parisi. We establish the more precise result that E | Mn – π2/12| = O(n-1/2).
Subject headings
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Keyword
- MATHEMATICS
- MATEMATIK
Publication and Content Type
- vet (subject category)
- ovr (subject category)
To the university's database