Conjecture that iterative graph normalization always converges
Statement
Let be a node-weighted graph, and let iterative graph normalization (IGN) denote the iteration of graph normalization, with a non-linear activation applied after each normalization. Iterative graph normalization convergence conjecture. Iterative graph normalization always converges. The paper proves convergence for complete graphs and studies local attractivity of maximal independent sets, but general convergence remains unproved.
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.