ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a directed graph with NN vertices satisfying the hypotheses in Theorem 1. Assume that ϵ>0\epsilon>0 is small and θ>0\theta>0. Let the input-free CTRNN have NN cells, piecewise affine activation function ϕp\phi_p, and connection weights wijw_{ij} defined as in the paper. Almost-complete realisation conjecture. There exists δc(ϵ,θ)>0\delta_c(\epsilon,\theta)>0 such that, for every 0<δ<δc0<\delta<\delta_c, there is an open set W^ex⊂R4\hat{W}_{\mathrm{ex}}\subset\mathbb{R}^{4} of parameters (ws,wm,wt,wp)(w_s,w_m,w_t,w_p) for which the dynamics contains an excitable network attractor with threshold δ\delta giving an almost complete realisation of GG. The conjecture strengthens the theorem by asserting an almost complete, rather than merely topological, realisation through an appropriate open choice of parameters; the source does not provide a resolution, so its status remains open.

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.