Independence Attractors in Graph Dynamics

• Independence attractors are compact subsets of the complex plane defined by the limit of roots of iterated independence polynomials, linking graph theory and complex dynamics.
• They emerge from the iteration of a reduced independence polynomial, where preimages of -1 under successive lexicographic graph products reveal intricate fractal structures.
• The framework delineates various topologies—ranging from real line segments to fractal sets—with connectivity properties governed by the dynamics of critical orbits.

An independence attractor is a compact subset of the complex plane characterizing the asymptotic root set of iterated independence polynomials associated to the lexicographic powers of a finite simple graph. The concept builds a bridge between algebraic graph invariants and Julia-set theory from complex dynamics, providing a new class of graph-theoretic attractors with rich geometric and topological properties.

1. Definition and Formal Construction

Let $G$ be a finite simple graph with independence number $\alpha(G)$, and independence polynomial

$I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$

where $a_j$ counts the independent sets of size $j$. The $m$-fold lexicographic power $G^m$ is formed by repeated lexicographic products. The roots of the independence polynomial of $G^m$, denoted $\mathrm{Roots}(I_{G^m})$, are studied in the limit $m \to \infty$ with respect to the Hausdorff metric on compact subsets of the plane.

The independence attractor of $\alpha(G)$0, denoted $\alpha(G)$1, is

$\alpha(G)$2

This limit is well-defined, yielding a compact set that is invariant under the polynomial dynamics derived from $\alpha(G)$3's structure. A reduced independence polynomial $\alpha(G)$4 encodes the iteration: $\alpha(G)$5, so the roots at stage $\alpha(G)$6 are the preimages of $\alpha(G)$7 under the $\alpha(G)$8-fold iteration of $\alpha(G)$9 (Khetawat et al., 27 May 2025, Manna et al., 6 Aug 2025).

2. Julia Set Correspondence and Independence Fractals

Classic results from complex dynamics show that, except for a discrete set associated to "super-attracting" multiple roots at $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$0, the independence attractor $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$1 equals the Julia set $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$2 of the polynomial $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$3:

$I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$4

in all cases except where $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$5 is a multiple root of $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$6 (Khetawat et al., 27 May 2025, Manna et al., 6 Aug 2025). The independence fractal $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$7. The topology of $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$8, therefore, is dictated by the critical orbit structure of $I_G(z) = \sum_{j=0}^{\alpha(G)} a_j z^j,$9 and falls into regimes familiar from the Fatou-Julia theory (connected, totally disconnected, disconnected but not totally, etc.).

3. Topological Classification: Circles and Segments

Research has precisely characterized the possible simple topologies realizable as independence attractors:

• No Circular Attractors: For any nontrivial finite graph $a_j$0, $a_j$1 can never be a geometric circle. If $a_j$2 is not a multiple root, a polynomial with a circular Julia set must be conjugate to $a_j$3, $a_j$4, but positivity of $a_j$5's coefficients and $a_j$6 forces $a_j$7, corresponding only to the empty graph. If $a_j$8 is a multiple root, invariance is broken by the basin of $a_j$9 (Khetawat et al., 27 May 2025).
• Line Segment Attractors: If $j$0 is a segment, then

$j$1

for some $j$2. The segment is always real, classified using affine conjugation to Chebyshev polynomials, and constraints on positivity and binomial divisibility restrict $j$3 to these integer values. For independence number 4, explicit graph constructions realize all four options (Khetawat et al., 27 May 2025).

| Attractor | Independence polynomial $j$4 (for $j$5) | Example type | |----------------|-----------------------------------------------------------|-------------------| | $j$6 | $j$7 | Connected | | $j$8 | $j$9 | Connected | | $m$0 | $m$1 | Disconnected | | $m$2 | $m$3 | Disconnected |

Outside these cases, independence attractors exhibit more intricate (fractal) topology, faithfully reflecting Julia sets of $m$4.

4. Connectivity and Critical Orbit Dichotomy

The connectivity properties of independence attractors are governed by the dynamics of critical points of $m$5, with precise discriminant-based conditions:

• Connected attractor: Every critical orbit of $m$6 remains bounded.
• Totally disconnected: All critical orbits escape to infinity.
• Disconnected but not totally: Some, but not all, critical orbits escape.

For independence polynomials of degree three, these conditions are refined by explicit discriminants $m$7 and $m$8. For special cases such as $m$9, the attractor forms $G^m$0 (a circle plus isolated point), otherwise the regime is determined algorithmically from the coefficients (Manna et al., 6 Aug 2025).

Condition	Connectivity type
$G^m$1	Totally disconnected
$G^m$2 ($G^m$3)	Circle plus point
$G^m$4, $G^m$5	Connected
$G^m$6, $G^m$7	Disconnected but not totally
(others, see (Manna et al., 6 Aug 2025))	Varies (see text for details)

5. Explicit Examples and Realizability

Constructive results demonstrate that for independence number 4, both connected and disconnected graphs realize all four possible segment attractors. The independence polynomial factorization and composition correspond to various configurations (single graph, product of smaller graphs). Infinitely many non-isomorphic graphs can realize a given segment, with explicit component factor polynomials provided for disconnected examples (Khetawat et al., 27 May 2025).

For independence number 3, the paper provides examples for every connectivity type—complete graphs with an edge removed (totally disconnected), unions of isolated vertices (circle plus point), and unions of cliques or components (parabolic-disconnected or connected, as per critical discriminant) (Manna et al., 6 Aug 2025).

6. Open Problems and Research Directions

Key unresolved questions include:

• Which other Jordan curves (beyond real segments) can occur as independence attractors?
• Can the topological classification be extended for graphs with larger independence numbers $G^m$8?
• Which reduced independence polynomials $G^m$9 are conformally conjugate to monic unicritical polynomials $G^m$0—potentially leading to new classes of attractor sets via classic complex dynamics results?
• Systematic determination of graph families whose attractors possess fractal or other higher-genus topology.

A plausible implication is that further exploration of the connection between independence polynomial iteration and polynomial dynamics will yield new invariants of interest in both graph theory and holomorphic dynamical systems (Khetawat et al., 27 May 2025, Manna et al., 6 Aug 2025).

7. Significance and Broader Context

The independence attractor framework incorporates algebraic graph invariants, functional iteration, and complex dynamics, providing a precise and calculable invariant capturing the global asymptotics of root loci for graph polynomials under lexicographic powering. The interaction with Julia set theory permits the importation of powerful techniques from holomorphic dynamics, establishing attractor-based dichotomies and trichotomies analogous to classic results on the Mandelbrot and Julia sets. Unlike classical attractor notions in dissipative ODEs, independence attractors may manifest as topologically connected sets (segments), disconnected but non-totally disconnected, fractal, or even totally disconnected, depending on both discrete graph structure and the resultant polynomial dynamics.

These results also highlight the constraints imposed by graph-theoretic positivity on the palette of attainable dynamical behaviors, in contrast with general polynomial dynamics where Julia sets can be circles, Sierpiński gaskets, or other exotica. Further classification, especially in higher independence number regimes, promises to elucidate the intersection of discrete, algebraic, and dynamical systems phenomena.