A proof of Parisi's conjecture on the random assignment problem
From MaRDI portal
Publication:1434092
DOI10.1007/s00440-003-0308-9zbMath1055.90056arXivmath/0303214OpenAlexW2099870086WikidataQ122940982 ScholiaQ122940982MaRDI QIDQ1434092
Johan Wästlund, Svante Linusson
Publication date: 1 July 2004
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0303214
Stochastic programming (90C15) Combinatorial probability (60C05) Random matrices (algebraic aspects) (15B52)
Related Items
Distributionally robust mixed integer linear programs: persistency models with applications ⋮ Asymptotic behavior of the expected optimal value of the multidimensional assignment problem ⋮ The mean field traveling salesman and related problems ⋮ The planted matching problem: sharp threshold and infinite-order phase transition ⋮ Extrema of a multinomial assignment process ⋮ Replica symmetry of the minimum matching ⋮ Minimum Cost Matching in a Random Graph with Random Costs ⋮ Random-link matching problems on random regular graphs ⋮ Anomalous scaling of the optimal cost in the one-dimensional random assignment problem ⋮ The Blind Passenger and the Assignment Problem ⋮ The stable marriage problem: an interdisciplinary review from the physicist's perspective ⋮ On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph ⋮ Central limit theorems for combinatorial optimization problems on sparse Erdős-Rényi graphs ⋮ Local tail bounds for functions of independent random variables ⋮ Random assignment problems ⋮ On random multi-dimensional assignment problems ⋮ Efficient algorithms for three‐dimensional axial and planar random assignment problems ⋮ A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment ⋮ A survey of max-type recursive distributional equations ⋮ Weight of a link in a shortest path tree and the Dedekind Eta function ⋮ Edge flows in the complete random-lengths network ⋮ Random assignment problems on \(2d\) manifolds ⋮ The random fractional matching problem ⋮ The \(k\)-assignment polytope ⋮ Strong and weighted matchings in inhomogenous random graphs ⋮ The planted matching problem: phase transitions and exact results ⋮ On the number ofk-cycles in the assignment problem for random matrices ⋮ The Effect of Adding Randomly Weighted Edges ⋮ The minimum perfect matching in pseudo-dimension 0 < q < 1 ⋮ A general method for lower bounds on fluctuations of random variables ⋮ Typical values of extremal-weight combinatorial structures with independent symmetric weights ⋮ Asymptotic results for random multidimensional assignment problems
This page was built for publication: A proof of Parisi's conjecture on the random assignment problem
