Linear phase transition in random linear constraint satisfaction problems
From MaRDI portal
Publication:1881641
DOI10.1007/s00440-004-0345-zzbMath1109.90058OpenAlexW3138456406MaRDI QIDQ1881641
Publication date: 5 October 2004
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01183947/file/dmAC0111.pdf
Linear programming (90C05) Stochastic programming (90C15) Combinatorial probability (60C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Right-convergence of sparse random graphs ⋮ Combinatorial approach to the interpolation method and scaling limits in sparse random graphs ⋮ Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models ⋮ Invariant probability measures and dynamics of exponential linear type maps ⋮ The planted matching problem: phase transitions and exact results ⋮ Weighted enumeration of spanning subgraphs in locally tree-like graphs
