ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let μ\mu be a “sufficiently nice” probability measure on R\mathbb{R} with EX∼μX=0\mathbb{E}_{X \sim \mu}X=0 and EX∼μX2=1\mathbb{E}_{X \sim \mu}X^2=1, let λ∈[0,+∞]\lambda\in[0,+\infty], and suppose that N⋅J\sqrt{N}\cdot J has i.i.d. entries distributed as μ\mu. Let T=T(N,μ,λ)T=T(N,\mu,\lambda) be the random runtime of reluctant dynamics on an N×NN\times N random matrix JJ. Polynomial runtime scaling conjecture. There exist constants α=α(μ,λ)>0\alpha=\alpha(\mu,\lambda)>0 and β=β(μ,λ)>0\beta=\beta(\mu,\lambda)>0 such that

T(N,μ,λ)α(μ,λ)Nβ(μ,λ)→1\frac{T(N,\mu,\lambda)}{\alpha(\mu,\lambda)N^{\beta(\mu,\lambda)}}\to 1

in probability as N→∞N\to\infty. This strengthens prior evidence for polynomial runtime scaling in the classical Sherrington–Kirkpatrick model with Gaussian entries to sufficiently nice entry distributions more generally; the statement remains conjectural.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.