Activation-Deactivation Dynamics

• Activation-Deactivation (AD) is a framework describing systems whose components switch between active and inactive states via stochastic or rule-based transitions.
• AD dynamics use mathematical models such as Markov processes, master equations, and field equations to reveal phase transitions, hysteresis, and critical behavior.
• Applications span opinion dynamics, network evolution, neurodynamics, molecular signaling, and machine learning explainability, offering insights into robust system design.

Activation–Deactivation (AD) mechanisms are fundamental to a broad range of dynamical systems, providing a unified conceptual and mathematical framework for systems whose components alternate between discrete active and inactive (deactivated) states. The AD paradigm appears in models of opinion dynamics, evolving networks, resource management, neurodynamics, signal transduction, aerosol microphysics, and machine learning explainability. AD protocols determine the stochastic or rule-based transitions between states and, through their interplay with intrinsic dynamics or network structure, induce diverse phase transitions, critical phenomena, and functional behaviors.

1. Mathematical Formulations of AD Dynamics

AD models specify a finite or countable set of units (agents, nodes, or regions), each characterized by a discrete activity state—typically active (A, 1, ON) or deactivated (D, 0, OFF). Transition mechanisms generally fall into two categories:

• Spontaneous Deactivation: An active agent transitions to the deactivated state, often with constant or state-dependent probability per unit time.
• Activation via Interactions or Forcing: A deactivated agent is reactivated by direct interaction with active peers or through external input, occasionally subject to further conditions (agreement, local field, spatial proximity).

Analytic formulations employ master equations, Markov processes, or coupled ODE/PDEs to capture the population or spatial mean activity. For example, in models of opinion dynamics, the time evolution of active population fractions $f_o$ with opinion $o$ is governed by

$\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$

where $w$ is the deactivation probability, $p$ encodes the interaction sign, $g$ is the activation efficiency, $x_o$ the inactive fraction, and $f_o$ the active fraction for each opinion state $o$ (Pires et al., 2021). In continuous-time Markov models, the infinitesimal generator quantifies ON–OFF transitions with rates $\lambda$ (ON→OFF) and $o$0 (OFF→ON), yielding steady-state probabilities and cumulative ON-time distributions (Heni et al., 2012).

In the field equation formalism for AD on measurable spaces, the evolution of the activation probability field $o$1 at location $o$2 arises from local activation ($o$3) and deactivation ($o$4) rates, potentially incorporating thresholds, spatial kernels, or marked graphs:

$o$5

Specializations admit Poisson-binomial thinning, local/nonlocal kernels, and can exhibit traveling waves, phase transitions, or chaos (Bastian et al., 2022).

2. AD-Induced Phase Transitions and Critical Behavior

The interaction between activation and deactivation dynamics fundamentally reshapes the phase structure of collective systems. In kinetic exchange models of opinion, an explicit AD rule gives rise to two nonequilibrium phase transitions and three macroscopic phases:

• Ordered phase (O): Macroscopic alignment (magnetization $o$6), with persistent activity ($o$7).
• Disordered phase (D): No net order ($o$8), activity sustained ($o$9).
• Absorbing phase (A): Full deactivation ($\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$0); the system is frozen.

These transitions occur at analytically calculable critical points:

• Ferromagnetic–paramagnetic (Ising-like) transition: $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$1, with $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$2, independent of AD rates.
• Active–absorbing (contact-process type) transition: $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$3, with $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$4, controlled directly by the deactivation rate $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$5 (Pires et al., 2021).

The phase diagram in the $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$6-plane reveals both sequential (O→D→A) and direct (O→A) transitions, depending on parameter values.

For activation–deactivation field equations, crossing critical values of deactivation probability or feedback strength induces discontinuous jumps in the stationary active fraction, hysteresis, or even spatiotemporal chaos (Bastian et al., 2022).

3. AD in Network Growth and Clustering

In network evolution models, AD dynamics coupled with nodal fitness control both topology and temporal activity patterns. Each node is assigned a fixed fitness $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$7 at birth and can be active (participating in edge formation) or inactive (frozen). Nodes are deactivated at rates inversely proportional to their fitness, $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$8, and replaced by newly activated nodes (Xu et al., 2010).

The resulting topology displays universal scaling laws:

• With homogeneous fitness distributions, the degree distribution is exponential.
• With heterogeneous (e.g., power-law) fitness, networks become scale-free: $\frac{dx_o}{dt} = w f_o - (1-p) g x_o f_o,$9.
• The local clustering coefficient scales as $w$0 and the global clustering as $w$1, where $w$2 is the size of the active set. These behaviors persist regardless of whether the degree distribution is exponential or scale-free.

Thus, fitness-driven AD provides a minimal mechanism for generating diverse network architectures found in real systems, including aging (node deactivation), robust clustering, and natural turnover (Xu et al., 2010).

4. AD Protocols in Engineered and Biological Systems

AD schemes underpin resource and energy allocation strategies in wireless and biological networks. In load-coupled wireless systems, optimization over cell-cluster activation/deactivation schedules directly minimizes energy consumption, subject to user QoS and mutual interference. The combinatorial optimization (NP-hard) can be cast as a mixed-integer program or relaxed to LP via rate-vector vertices, with solutions obtained by column generation and local-interference enumeration, achieving $w$340% energy savings and scalability to tens of cells (Lei et al., 2015).

In molecular signaling, a weakly-activated deactivation cascade (with $w$4 steps and activation/deactivation rates $w$5) yields an exact convolution solution for the output species. When all deactivation rates are identical ($w$6), the output is given by an incomplete gamma function:

$w$7

enabling analytic model reduction, yet retaining a quantitative description of delay, amplification, and filtering (Beguerisse-Diaz et al., 2011).

In ad hoc wireless networks with battery constraints, ON/OFF AD Markovian models permit analytical calculation of node lifetime, energy consumption, and the impact of burstiness on network longevity (Heni et al., 2012).

5. AD in Collective and Environmental Dynamics

Environmental physical systems often exhibit AD phenomena with nonlinear and bifurcating dynamics. In monodisperse cloud condensation nuclei (CCN) microphysics, the activation or deactivation of droplets is controlled by supersaturation and competing growth–evaporation feedbacks. The system exhibits a canonical saddle-node bifurcation at the critical RH, with the activation timescale diverging as $w$8. When population effects (RH–droplet coupling) are included, the system supports a cusp catastrophe, where hysteresis emerges even in the quasi-static limit (Arabas et al., 2016).

Two qualitatively distinct hysteresis mechanisms exist:

• Kinetically-limited (rate-limited) hysteresis: Due to finite growth/evaporation rates under dynamic environmental conditions.
• Equilibrium (cusp-driven) hysteresis: All-or-nothing switching, robust to forcing rates, controlled by population and ambient RH.

Numerical integration of AD microphysical systems demands stiff solvers and adaptive time-stepping to resolve rapid transitions, especially during deactivation events associated with cusp jumps.

6. AD Paradigms in Machine Learning Explainability

The AD mechanism has recently been generalized to neural network interpretability, forming the Activation–Deactivation (AD) paradigm and the concrete ConvAD framework (Chanchal et al., 1 Oct 2025). Rather than occluding input pixels (which creates out-of-distribution perturbations), AD effectually prunes internal activations whose receptive fields lie within masked input regions. For each convolutional layer, a binary mask propagates via mean-value convolutions and a thresholding scheme:

$w$9

where $p$0 reports the mask fraction in the receptive field.

ConvAD checkpoints inserted throughout the network ensure that:

• The classification decision boundary is preserved for unmasked inputs,
• Explanations are strictly more robust (up to 62.5%) against background perturbations, compared to conventional occlusion approaches,
• Explanation masks tend to be 5–20% larger than the most efficient occlusion while providing causal attribution.

The method is domain-agnostic, parameter-free apart from the masking threshold, and introduces negligible computational overhead, offering a principled approach to robust post-hoc explainable AI (Chanchal et al., 1 Oct 2025).

7. Universal and Emergent Properties of AD Systems

Across diverse application domains, AD mechanisms induce a set of universal emergent properties:

• Nonequilibrium Phase Transitions: As deactivation and activation rates cross system-specific thresholds, AD systems transition sharply between high-activity (“alive”), fluctuating (“critical”), and fully inactive (“absorbing” or “dead”) steady states.
• Hysteresis and Bifurcation: Feedback between population activity and environmental or network variables can generate complex bifurcation structures (saddle-node, cusp), with corresponding memory, hysteresis loops, and catastrophic regime shifts.
• Robustness and Flexibility: The inclusion of AD mechanisms enables systems to buffer perturbations, switch rapidly between states (e.g., re-awakening in neurodynamics or energy-saving in wireless grids), and accommodate both short transients and persistent inactivity.
• Scalable Theoretical Formalism: AD field equations and probabilistic (Markov, counting measure) approaches accommodate spatial, networked, and threshold effects, supporting predictions of macroscopic observables and critical points.

These features highlight the AD framework as a central mathematical and conceptual tool for analyzing, optimizing, and understanding multistate, interacting, and adaptive complex systems.