ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a node-weighted graph with all node weights distinct. Let iterative graph normalization be applied with a suitable non-linear activation. Activated IGN maximal-independent-set conjecture. Iterative graph normalization converges to a maximal independent set of GG. This conjecture strengthens the general convergence claim by specifying the binary limit, and the paper presents it based on experiments and theoretical evidence; it 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.