Iterative Graph Normalization (IGN) Overview

• The paper introduces IGN as a dynamical system that iteratively normalizes node weights to converge to binary indicators representing maximal independent sets.
• It details a methodology using componentwise activations and weighted regularized variants (WRGN) to balance convergence speed, stability, and repulsivity of non-optimal solutions.
• IGN bridges combinatorial optimization with differentiable programming, enabling practical applications in graph matching, clustering, and assignment problems.

Searching arXiv for relevant papers on Iterative Graph Normalization and related terminology. Iterative Graph Normalization (IGN) denotes the discrete-time iteration of a graph normalization map on node or assignment weights, introduced as a differentiable dynamical system for combinatorial optimization, especially Maximum Weight Independent Set (MWIS) and related matching formulations (Guigues, 2020, Guigues, 6 May 2026). In its basic form on a simple undirected graph with adjacency matrix $A$, IGN repeatedly applies

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$

optionally followed by a componentwise activation $h$, thereby driving nonnegative weights toward binary indicators of independent sets (Guigues, 2020). A terminological caveat is essential: in the separate literature on higher-order graph representation learning, “IGN” also denotes invariant graph networks rather than iterative graph normalization; that usage is unrelated except for the acronym (Geerts, 2020). Within the optimization literature, IGN emphasizes the iterative dynamics induced by Graph Normalization (GN), while more recent work distinguishes a weighted, regularized variant, WRGN, as the practically useful form for weighted instances (Guigues, 6 May 2026).

1. Terminology and formal setup

The original IGN formulation considers a simple undirected graph over $V=\{1,\dots,n\}$, represented by a binary adjacency matrix $A\in M_n(\{0,1\})$ with zero diagonal, together with a nonnegative node-weight vector $x\in\mathbb{R}_+^n$; the weighted graph is $G=(A,x)$ (Guigues, 2020). For node $i$, the neighborhood is $V(i)=\{j\in V\mid A_{ij}=1\}$, the degree is $\deg(i)=|V(i)|$, and the support of a weight vector is $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$0 (Guigues, 2020).

The normalization map is defined by Hadamard division: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$1 Activated normalization applies a componentwise nonlinearity $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$2: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$3 and IGN is the iteration

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$4

(Guigues, 2020).

Normalizability is defined by the condition $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$5 componentwise; equivalently, $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$6 is normalizable iff $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$7, where

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$8

This condition ensures that every denominator in the normalization is positive (Guigues, 2020).

The 2026 refinement rephrases the same iterative concept in terms of GN and IGN: GN is the normalization map, while IGN is explicitly the repeated application $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$9 until convergence (Guigues, 6 May 2026). That work further introduces Weighted Regularized Graph Normalization (WRGN), which incorporates positive vertex weights $h$0, a bias $h$1, and a regularization parameter $h$2 through

$h$3

with update

$h$4

This weighted regularized dynamics is presented as the weight-aware and provably binarizing version of IGN (Guigues, 6 May 2026).

A separate terminological clarification arises from graph representation learning. In “The expressive power of kth-order invariant graph networks,” “IGN” denotes invariant graph networks, not iterative graph normalization. There, k-IGNs are higher-order, permutation-invariant neural architectures on $h$5-tuple-indexed features with $h$6-equivariant linear maps and invariant pooling (Geerts, 2020). This usage should not be conflated with graph normalization dynamics.

2. Core dynamics and structural properties

In the 2020 formulation, GN and IGN possess several basic structural properties. The map $h$7 sends weights to $h$8, preserves support under $h$9, is scale invariant in the sense that $V=\{1,\dots,n\}$0 for $V=\{1,\dots,n\}$1, and depends only on neighborwise ratios $V=\{1,\dots,n\}$2 (Guigues, 2020). GN also commutes with graph automorphisms: if $V=\{1,\dots,n\}$3 is a permutation satisfying $V=\{1,\dots,n\}$4, then $V=\{1,\dots,n\}$5 (Guigues, 2020). Fixed points of the unactivated map satisfy a local condition: at node $V=\{1,\dots,n\}$6, either $V=\{1,\dots,n\}$7 or the $V=\{1,\dots,n\}$8-th component of $V=\{1,\dots,n\}$9 equals $A\in M_n(\{0,1\})$0 (Guigues, 2020).

The activated map requires $A\in M_n(\{0,1\})$1 and $A\in M_n(\{0,1\})$2, together with either strict convexity on $A\in M_n(\{0,1\})$3, or the mixed convex–concave condition $A\in M_n(\{0,1\})$4, strict convexity on $A\in M_n(\{0,1\})$5, and strict concavity on $A\in M_n(\{0,1\})$6 (Guigues, 2020). These assumptions are used in the fixed-point and attractivity analysis.

The weighted regularized form recasts the same local closed-neighborhood normalization in a weight-tilted geometry. Letting $A\in M_n(\{0,1\})$7 and $A\in M_n(\{0,1\})$8, the WRGN update becomes

$A\in M_n(\{0,1\})$9

The normalization remains local, preserves support, is projective or scale-invariant, and maps any normalizable state into $x\in\mathbb{R}_+^n$0 (Guigues, 6 May 2026).

The assignment specialization is structurally analogous. In the line graph $x\in\mathbb{R}_+^n$1, with variables $x\in\mathbb{R}_+^n$2 representing matchings of row $x\in\mathbb{R}_+^n$3 to column $x\in\mathbb{R}_+^n$4, GN cross-normalizes each entry against all conflicting row and column competitors: $x\in\mathbb{R}_+^n$5 This provides a direct graph-normalization analogue of assignment normalization, but with hard combinatorial structure inherited from the line graph (Guigues, 6 May 2026).

3. Independent sets, binary fixed points, and local stability

A central structural result of the 2020 paper is that the only binary fixed points are maximal independent sets (MIS) (Guigues, 2020). For a graph $x\in\mathbb{R}_+^n$6, an independent set $x\in\mathbb{R}_+^n$7 satisfies $x\in\mathbb{R}_+^n$8 for all $x\in\mathbb{R}_+^n$9, and its indicator vector $G=(A,x)$0 has entries equal to $G=(A,x)$1 exactly on $G=(A,x)$2 (Guigues, 2020). The fixed-point proposition states: $G=(A,x)$3 The reasoning is explicit in the paper: if $G=(A,x)$4 is the indicator of an MIS, then on support nodes the closed-neighborhood denominator equals the node’s own mass, yielding $G=(A,x)$5, while outside the support at least one neighboring $G=(A,x)$6 forces $G=(A,x)$7; conversely, if a binary vector is not independent, some adjacent pair with $G=(A,x)$8 yields $G=(A,x)$9, so the point is not fixed (Guigues, 2020).

The same paper analyzes stability through the Jacobian of $i$0. Writing $i$1, the Jacobian entries are

$i$2

$i$3

or in matrix form,

$i$4

with diagonal $i$5 and $i$6 as specified in the paper (Guigues, 2020).

At an MIS indicator $i$7, the spectrum simplifies to

$i$8

and the spectral radius is

$i$9

Hence an MIS is attractive whenever $V(i)=\{j\in V\mid A_{ij}=1\}$0; if $V(i)=\{j\in V\mid A_{ij}=1\}$1, then every MIS in any graph is attractive; and if $V(i)=\{j\in V\mid A_{ij}=1\}$2, convergence to an MIS is quadratic in a neighborhood (Guigues, 2020).

Non-maximal independent sets are treated differently. Under the condition $V(i)=\{j\in V\mid A_{ij}=1\}$3 for all $V(i)=\{j\in V\mid A_{ij}=1\}$4, any non-maximal independent set is a repulsive point for $V(i)=\{j\in V\mid A_{ij}=1\}$5 (Guigues, 2020). The paper notes a practical trade-off: this repulsivity condition conflicts with quadratic convergence to MIS, since the latter requires $V(i)=\{j\in V\mid A_{ij}=1\}$6 (Guigues, 2020). A plausible implication is that activation design controls not only local rate but also which combinatorial structures can become attractors.

The 2026 WRGN analysis sharpens the picture. For any connected simple graph $V(i)=\{j\in V\mid A_{ij}=1\}$7, any $V(i)=\{j\in V\mid A_{ij}=1\}$8, any positive bias $V(i)=\{j\in V\mid A_{ij}=1\}$9, and any normalizable initialization $\deg(i)=|V(i)|$0, the WRGN sequence converges to a unique normalizable fixed point $\deg(i)=|V(i)|$1 (Guigues, 6 May 2026). For $\deg(i)=|V(i)|$2, every non-binary fixed point is strictly repulsive, and a binary fixed point with support $\deg(i)=|V(i)|$3 is asymptotically stable iff

$\deg(i)=|V(i)|$4

Every MWIS is a stable attractor, and any WRGN sequence with $\deg(i)=|V(i)|$5 converges to a $\deg(i)=|V(i)|$6-stable MIS while strictly increasing the relaxed MWIS objective $\deg(i)=|V(i)|$7 until convergence (Guigues, 6 May 2026).

4. Relation to MWIS and optimization theory

IGN is motivated by the Maximum Weight Independent Set problem: $\deg(i)=|V(i)|$8 or equivalently by the binary quadratic constraint $\deg(i)=|V(i)|$9 (Guigues, 2020, Guigues, 6 May 2026). In the 2020 formulation, IGN’s binary fixed points are MIS rather than necessarily maximum-weight solutions, so the method is characterized as a differentiable heuristic aiming to find a high-weight MIS by reweighting dynamics (Guigues, 2020).

The 2026 work strengthens this interpretation by introducing a relaxed primal objective on fuzzy memberships $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$00,

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$01

and proving that WRGN increases this quantity strictly at each iteration unless at a fixed point (Guigues, 6 May 2026). This moves the method from heuristic dynamics toward a monotone optimization scheme on a relaxation of MWIS.

An exact Majorization–Minimization interpretation is given in the weighted state space $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$02. The energy is

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$03

At iterate $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$04, define the separable quadratic majorant

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$05

This majorant upper bounds $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$06, is tangent at $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$07, and is strictly convex; minimizing it yields

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$08

which is exactly the WRGN update. The resulting MM inequalities are

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$09

so the energy decreases monotonically (Guigues, 6 May 2026).

The same update also admits a quasi-Newton description: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$10 The paper characterizes this as a preconditioned gradient step in which the diagonal preconditioner approximates inverse curvature and acts like an adaptive step size with implicit log-barriers (Guigues, 6 May 2026).

The optimization viewpoint is complemented by a weighted extension of the Motzkin–Straus theorem. On the weight-tilted simplex

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$11

consider

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$12

for $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$13. The local minima of $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$14 on $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$15 are in one-to-one correspondence with the $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$16-stable MISes of $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$17; if $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$18 is such an MIS, then

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$19

In particular, any MWIS is $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$20-stable and corresponds to a global minimum of $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$21 over the tilted simplex (Guigues, 6 May 2026). This establishes a precise bridge between the dynamical system, quadratic optimization, and combinatorial structure.

5. Replicator dynamics, Fisher-type monotonicity, and geometric interpretation

WRGN is also equivalent to a discrete-time replicator dynamics of a nonlinear evolutionary game (Guigues, 6 May 2026). Defining the simplex state

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$22

the dynamics becomes

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$23

with fitness

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$24

and average fitness $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$25 (Guigues, 6 May 2026).

A key identity links this evolutionary interpretation to the optimization objective: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$26 The paper interprets this as a Fisher-type statement: the population average fitness equals the next iteration’s weighted mass, and this quantity strictly increases off equilibrium (Guigues, 6 May 2026). Although the induced game is nonlinear and non-potential, the dynamics still admits monotone functionals, namely decreasing MM energy and increasing weighted mass.

The earlier 2020 paper also offered geometric evidence for structured dynamics. For any graph $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$27 of size $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$28, the image

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$29

is a hypersurface intersecting each line at most once, and on trees $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$30 for some $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$31 when $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$32 are positive (Guigues, 2020). For the path graph $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$33, the image of GN in $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$34 is the “Taco” hypersurface

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$35

with two binary fixed points, $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$36 and $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$37, acting as attractors under suitable $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$38 (Guigues, 2020). This suggests that the normalization map has a nontrivial projective geometry already on very small graphs.

The same paper conjectured global convergence of IGN and convergence to binary solutions for suitable nonlinear activations (Guigues, 2020). The later WRGN theory supplies stronger guarantees, but for the regularized weighted dynamics rather than all original activated variants. This suggests a historical progression from an experimentally motivated discrete dynamical system to a more fully characterized optimization method.

6. Assignment problems, Sinkhorn-related normalization, and ML integration

IGN has a direct assignment-problem specialization. The maximum weight bipartite matching problem can be represented as MWIS in the line graph of the bipartite graph, with optimal solution a permutation matrix maximizing $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$39 (Guigues, 2020). In this context, the 2020 paper defines cross normalization

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$40

and in vectorized form

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$41

where

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$42

Iterating activated cross normalization $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$43 yields Iterative Cross Normalization (ICN), intended to obtain a crisp assignment (Guigues, 2020).

This leads to a comparison with Sinkhorn–Knopp (SK). SK alternates row and column normalization,

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$44

and converges toward the Birkhoff polytope of doubly stochastic matrices, whereas ICN projects toward permutation matrices by normalizing simultaneously against row-and-column cross sums (Guigues, 2020). The distinction is summarized explicitly in the source: SK projects to $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$45, a soft doubly stochastic solution set, whereas ICN projects to $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$46, a crisp permutation set (Guigues, 2020).

The relation to Softassign is also direct: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$47 with entropy-regularized interpretation

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$48

As $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$49, Softassign tends almost surely to the optimal assignment under mild randomness assumptions, but remains soft in practice and often needs a cleanup step; the paper reports that combining SA with ICN yields crisp permutations efficiently (Guigues, 2020).

Both papers emphasize differentiability. GN, IGN, and ICN are differentiable on the normalizable interior because they are compositions of sparse neighbor sums or row/column sums and elementwise divisions, so they can be unrolled for a fixed number of iterations and trained by backpropagation (Guigues, 2020, Guigues, 6 May 2026). The cited application classes include graph and hypergraph matching, sequence alignment, clustering, ranking, structured sparse attention, dynamic network pruning, Mixture-of-Experts routing, and broader constrained resource allocation tasks (Guigues, 2020, Guigues, 6 May 2026). A plausible implication is that IGN is most naturally viewed not merely as a standalone solver but as a trainable combinatorial decision layer.

7. Empirical performance, limitations, and acronym ambiguity

The 2020 experimental study compared IGN with the greedy MWIS approximation algorithm of Kako–Ono–Hirata–Halldórsson, denoted WG. In that algorithm, the relative weighted degree is

$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$50

and the greedy rule repeatedly selects the node of minimum $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$51, adds it to the solution, and removes it with its neighbors (Guigues, 2020). The connection to normalization is exact: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$52 Thus IGN is described as a “soft” reweighting counterpart of WG, pushing up small-$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$53 nodes (Guigues, 2020).

On binomial random graphs $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$54 with weights uniform in $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$55, IGN’s solution weights were reported to be close to WG’s. For $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$56 and a power activation with $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$57, $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$58 instances yielded solutions “almost always identical,” and up to $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$59 the average relative gaps were reported as $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$60, with probability that IGN beats WG exceeding $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$61 up to about $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$62 for some settings (Guigues, 2020). For assignment problems, SA+ICN exactly solved AP with median gap $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$63 for $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$64 and $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$65, while for larger $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$66 up to $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$67, median and average gaps remained $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$68–$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$69; SA was reported to reduce ICN iterations by about $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$70 at $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$71, with example averages $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$72 versus $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$73 iterations (Guigues, 2020).

The 2026 work reports larger-scale MWIS results for warm-started WRGN. On real benchmarks up to $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$74 nodes and $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$75 edges, warm-start WRGN from a Bregman–Sinkhorn fractional solution typically reached solutions within about $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$76 of best-known MWIS in seconds on CPU; specific examples include AVR_024 and AVR_034 at $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$77 gap in $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$78s, AVR_023 and AVR_027 at $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$79 gap in $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$80s and $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$81s, and MSCD instances with warm-start gaps often $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$82–$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$83 and runtimes $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$84–$$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$85s (Guigues, 6 May 2026). Time per iteration is $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$86 for graph instances and $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$87 for ICN on assignment matrices; memory can become the main bottleneck on very large sparse graphs (Guigues, 2020, Guigues, 6 May 2026).

Several limitations remain explicit. In the 2020 framework, general convergence on arbitrary graphs was open, although complete graphs were solved exactly under a unique maximum-weight condition, and an $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$88-norm monotonicity conjecture was proposed as a route to proving convergence (Guigues, 2020). The paper also noted sensitivity to the activation derivative at zero: $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$89 gives quadratic convergence near MIS but can permit convergence to non-maximal independent sets, whereas $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$90 ensures repulsivity of non-maximal IS but slows local rates (Guigues, 2020). The 2026 paper, despite proving convergence and binarization for WRGN, still identifies multiple binary MIS attractors and dependence on initialization; $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$91-pursuit and warm starts are proposed to mitigate convergence to suboptimal MIS (Guigues, 6 May 2026).

Finally, the acronym ambiguity around “IGN” is itself a recurring source of confusion. In the higher-order GNN literature, k-IGN refers to invariant graph networks with linear $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$92-equivariant layers on $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$93-tuple-indexed features and invariant pooling, and the main result there is that k-IGNs are exactly as expressive as $$x^{k+1} \;=\; N_h(x^k), \qquad N(x) \;=\; x \oslash (A+I)x,$$94-WL in graph distinction power (Geerts, 2020). That usage is unrelated to graph-normalization dynamics, despite the identical acronym. For work on iterative graph normalization in the optimization sense, the relevant objects are GN, IGN, ICN, and WRGN rather than invariant graph networks (Guigues, 2020, Guigues, 6 May 2026).