scholarly journals The Legendre Structure of the Parisi Formula

2016 ◽  
Vol 348 (3) ◽  
pp. 751-770 ◽  
Author(s):  
Antonio Auffinger ◽  
Wei-Kuo Chen
Keyword(s):  
2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Johan Wästlund

International audience We explore a similarity between the $n$ by $n$ random assignment problem and the random shortest path problem on the complete graph on $n+1$ vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his $\zeta (2)$ limit theorem for the assignment problem.


2005 ◽  
Vol 17 (07) ◽  
pp. 793-857 ◽  
Author(s):  
DMITRY PANCHENKO

In [11], Talagrand gave a rigorous proof of the Parisi formula in the classical Sherrington–Kirkpatrick (SK) model. In this paper, we build upon the methodology developed in [11] and extend Talagrand's result to the class of SK type models in which the spins have arbitrary prior distribution on a bounded subset of the real line.


2014 ◽  
Vol 42 (3) ◽  
pp. 946-958 ◽  
Author(s):  
Dmitry Panchenko
Keyword(s):  

2017 ◽  
Vol 45 (6B) ◽  
pp. 4617-4631 ◽  
Author(s):  
Antonio Auffinger ◽  
Wei-Kuo Chen

Sign in / Sign up

Export Citation Format

Share Document