Indexing metadata

Random matching problems on the complete graph


 
Dublin Core PKP Metadata Items Metadata for this Document
 
1. Title Title of document Random matching problems on the complete graph
 
2. Creator Author's name, affiliation, country Johan Wästlund; Department of Mathematical Sciences, Chalmers University of Technology, Göteborg, Sweden
 
3. Subject Discipline(s)
 
3. Subject Keyword(s) Minimum matching, exponential, expectation, mean field, network.
 
3. Subject Subject classification 60C05, 90C27, 90C35.
 
4. Description Abstract The edges of the complete graph on $n$ vertices are assigned independent exponentially distributed costs. A $k$-matching is a set of $k$ edges of which no two have a vertex in common. We obtain explicit bounds on the expected value of the minimum total cost $C_{k,n}$ of a $k$-matching. In particular we prove that if $n = 2k$ then $\pi^2/12 < EC_{k,n} < \pi^2/12 + \log n/n$.
 
5. Publisher Organizing agency, location
 
6. Contributor Sponsor(s) The Swedish Research Council
 
7. Date (YYYY-MM-DD) 2008-05-12
 
8. Type Status & genre Peer-reviewed Article
 
8. Type Type
 
9. Format File format PDF
 
10. Identifier Uniform Resource Identifier http://ecp.ejpecp.org/article/view/1372
 
10. Identifier Digital Object Identifier 10.1214/ECP.v13-1372
 
11. Source Journal/conference title; vol., no. (year) Electronic Communications in Probability; Vol 13
 
12. Language English=en
 
14. Coverage Geo-spatial location, chronological period, research sample (gender, age, etc.)
 
15. Rights Copyright and permissions The Electronic Journal of Probability applies the Creative Commons Attribution License (CCAL) to all articles we publish in this journal. Under the CCAL, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles published in EJP, so long as the original authors and source are credited. This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.

Summary of the Creative Commons Attribution License

You are free
  • to copy, distribute, display, and perform the work
  • to make derivative works
  • to make commercial use of the work
under the following condition of Attribution: others must attribute the work if displayed on the web or stored in any electronic archive by making a link back to the website of EJP via its Digital Object Identifier (DOI), or if published in other media by acknowledging prior publication in this Journal with a precise citation including the DOI. For any further reuse or distribution, the same terms apply. Any of these conditions can be waived by permission of the Corresponding Author.