Mean field and corrections for the Euclidean Minimum Matching problem

Details Mean field and corrections for the Euclidean Minimum Matching problem Mean field and corrections for the Euclidean Minimum Matching problem

1997-01-24

arxiv.org/abs/cond-mat/9701182v1

Phys. Rev. Lett. 79, 167 (1997)

Physics

Condensed Matter

Disordered Systems and Neural Networks

source and one figure. Submitted to PRL

Scientific paper

10.1103/PhysRevLett.79.167

Consider the length $L_{MM}^E$ of the minimum matching of N points in d-dimensional Euclidean space. Using numerical simulations and the finite size scaling law $< L_{MM}^E > = \beta_{MM}^E(d) N^{1-1/d}(1+A/N+... )$, we obtain precise estimates of $\beta_{MM}^E(d)$ for $2 \le d \le 10$. We then consider the approximation where distance correlations are neglected. This model is solvable and gives at $d \ge 2$ an excellent ``random link'' approximation to $\beta_{MM}^E(d)$. Incorporation of three-link correlations further improves the accuracy, leading to a relative error of 0.4% at d=2 and 3. Finally, the large d behavior of this expansion in link correlations is discussed.

Affiliated with

Also associated with

No associations

Rating

Mean field and corrections for the Euclidean Minimum Matching problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Mean field and corrections for the Euclidean Minimum Matching problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mean field and corrections for the Euclidean Minimum Matching problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88028