Replica symmetry of the minimum matching
نویسنده
چکیده
We establish the soundness of the replica symmetric ansatz introduced by M. Mézard and G. Parisi for the minimum matching problem in the pseudo-dimension d mean field model for d ≥ 1. The case d = 1 corresponds to the π2/6-limit for the assignment problem proved by D. Aldous in 2001. We introduce a game-theoretical framework by which we establish the analogous limit also for d > 1.
منابع مشابه
Replica Symmetry and Combinatorial Optimization
We establish the soundness of the replica symmetric ansatz (introduced by M. Mézard and G. Parisi) for minimum matching and the traveling salesman problem in the pseudo-dimension d mean field model for d ≥ 1. The case d = 1 of minimum matching corresponds to the π2/6-limit for the assignment problem established by D. Aldous in 2001, and the analogous limit for the d = 1 case of TSP was recently...
متن کاملMaximum matching on random graphs
– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...
متن کاملReplica Theory and the Geometry of Symmetry Breaking
In the study of Replica Symmetry Breaking (RSB), one is led to consider functions f of pseu-domatrices, i.e. of matrices of order , with a real, rather than an integer, number. We propose a mathematically rigorous deenition of pseudomatrices, and show that from this it follows that the minimum of f over the space of pseudomatrices Q(x; y) which depend only on (x ?y) is also a critical point for...
متن کاملMinimum vertex cover problems on random hypergraphs: replica symmetric solution and a leaf removal algorithm.
The minimum vertex-cover problems on random α-uniform hypergraphs are studied using two different approaches, a replica method in statistical mechanics of random systems and a leaf removal algorithm. It is found that there exists a phase transition at the critical average degree e/(α-1), below which a replica symmetric ansatz in the replica method holds and the algorithm estimates exactly the s...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کامل