Neighborhood preferences in random matching problems

Details Neighborhood preferences in random matching problems Neighborhood preferences in random matching problems

2000-12-18

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

Physics

Condensed Matter

Statistical Mechanics

16 pages, 1 figure

Scientific paper

10.1007/PL00011144

We consider a class of random matching problems where the distance between two points has a probability law which, for a small distance l, goes like l^r. In the framework of the cavity method, in the limit of an infinite number of points, we derive equations for p_k, the probability for some given point to be matched to its k-th nearest neighbor in the optimal configuration. These equations are solved in two limiting cases : r=0 - where we recover p_k=1/2^k, as numerically conjectured by Houdayer et al. and recently rigorously proved by Aldous - and r -> +infty. For 0

Affiliated with

Also associated with

No associations

Rating

Neighborhood preferences in random matching problems 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 Neighborhood preferences in random matching problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neighborhood preferences in random matching problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180586