Conjecture on activated iterative graph normalization for maximal independent sets
Statement
Let 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 . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.