ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a directed graph on nn nodes, and let W=W(G;ε,δ)W=W(G;\varepsilon,\delta) be the associated combinatorial threshold-linear network (CTLN). A subset σ⊆[n]\sigma\subseteq[n] is a clique if G∣σG|_{\sigma} has all bidirectional edges between distinct vertices. A vertex v∉σv\notin\sigma is a target of σ\sigma if every j∈σj\in\sigma has j→vj\to v in GG, and σ\sigma is target-free if it has no external target. Assume

δ>0,0<ε<δδ+1.\delta>0,\qquad 0<\varepsilon<\frac{\delta}{\delta+1}.

The target-free clique conjecture. A subset σ\sigma is the support of a stable fixed point if and only if σ\sigma is a target-free clique. Target-free cliques are known to support stable fixed points, and the converse has been proved in several special cases, including oriented and symmetric graphs, networks with at most four nodes, and certain parameter ranges; the general statement 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.