--- title: Random Threshold-Directed Network Model url: https://www.emergentmind.com/topics/random-threshold-directed-network-model type: topic --- # Random Threshold-Directed Network Model The term **Random Threshold–Directed Network Model** is most coherently understood, in the literature considered here, as an umbrella designation for random-network constructions in which state changes are controlled by threshold rules and propagate along directed or effectively directed interactions. The relevant formalisms are not identical: they include Boolean threshold dynamics on random directed graphs, threshold-triggered avalanches on Erdős–Rényi networks with dynamically induced directionality, ordered acyclic random digraphs with a sharp reachability threshold, and directed threshold contagion analyzed by dynamic message passing. Taken together, these models define a technically connected class of threshold-mediated spreading and activation processes, with phase transitions located by distinct control parameters such as the average in-degree $K$, the link probability $p$, or message-transmission kernels [1012.3287] [1401.4270] [1209.2088] [1312.2070]. ## 1. Scope and defining ingredients Across the cited literature, threshold-directed models combine three recurrent elements: a random network ensemble, a node-level activation or awareness variable, and a threshold rule that determines whether a node changes state. Directionality may be explicit in the graph definition, as in the directed configuration model and the ordered digraph, or implicit in the propagation process, as in the avalanche model on an undirected Erdős–Rényi network. | Paper | Random network ensemble | Threshold mechanism | |---|---|---| | [1012.3287] | Directed random network with average in-degree $K$ | Boolean threshold update with $\Theta_0(0)=0$ | | [1401.4270] | Static undirected Erdős–Rényi graph $G(N,p)$ | Awareness crosses $\phi=1$ under external kicks and neighbor sharing | | [1209.2088] | Ordered directed random graph on $\{v_1,\dots,v_n\}$ | Reachability transition at $p^*=\log n/n$ | | [1312.2070] | Sparse directed configuration model | Adoption after receiving at least $T_i$ transmissions | This comparison shows that “threshold” does not denote a single universal observable. In one model it is a deterministic activation boundary for a weighted input sum, in another it is an awareness level, in another it is a connectivity threshold for the emergence of a macroscopic reachable set, and in another it is an adoption requirement based on the number of informed in-neighbors. A plausible implication is that the phrase names a modeling family rather than a single canonical stochastic process. ## 2. Binary threshold networks as a biologically motivated null model In the formulation of Rybarsch and Bornholdt, the network has $N$ nodes with Boolean states $$ s_i(t)\in\{0,1\}, $$ and directed couplings $w_{ij}\in\{+1,-1,0\}$, where present links are assigned weights $+1$ or $-1$ with equal probability and absent links have $w_{ij}=0$. The synchronous update rule is $$ s_i(t+1)=\Theta_0\!\left(\sum_{j=1}^N w_{ij}s_j(t)-\theta_i\right), $$ with the modified threshold function $$ \Theta_0(x)= \begin{cases} 1,&x>0\\ 0,&x\le 0 \end{cases} $$ and, crucially, $\Theta_0(0)=0$ rather than the conventional $\Theta(0)=1$ [1012.3287]. The random-network ensemble is defined by occupying each ordered pair $(j\to i)$ independently with probability $K/N$, so that the average in-degree is $K=\langle k_i\rangle$. In the $N\to\infty$ limit, the in-degree distribution is Poisson, $$ p(k)=e^{-K}\frac{K^k}{k!}. $$ Most of the analysis takes $\theta_i=0$, so that only the sign of the weighted sum matters. The central dynamical quantity is the activity $b\equiv\langle s\rangle$. Damage spreading is analyzed through the probability $p_s(k)$ that a node with indegree $k$ flips its output if one input is flipped, $$ p_s(k)=\frac12+\sum_{i=1}^k(-1)^i\binom{k-1}{i}X_i b^i, $$ with $$ X_1=\frac14,\qquad X_i=X_{i-1}\cdot\frac{2i-1}{i+1}. $$ Averaging over the Poisson indegree distribution gives $$ \langle p_s\rangle(K)=\frac1K\sum_{k=1}^\infty k\,p(k)\,p_s(k), $$ and the sensitivity is defined as $$ \lambda(K)=K\cdot\langle p_s\rangle(K). $$ The critical point is determined by $\lambda(K_c)=1$. A complementary route uses the activity-evolution equation. For a node with indegree $k$, $$ b_{t+1}(k)=\sum_{i=1}^k(-1)^{i+1}2^{-i}\binom{2i-1}{i-1}\binom{k}{i}b_t^i, $$ and averaging over $p(k)$ yields $$ b_{t+1}=\sum_{k=1}^\infty p(k)\,b_{t+1}(k). $$ In the long-time limit there is a stable fixed point $b_\infty(K)$. For $K\le 2$, the only fixed point is $b_\infty=0$, whereas for $K>2$ a nonzero fraction of nodes remains active. The transition coincides with the damage-spreading criterion, and finite-size scaling from $N=50$ to $N=800$ gives $K_c(\infty)=2.00\pm0.01$, with the asymptotic critical activity satisfying $b_c(N)\to0$ as $N\to\infty$ [1012.3287]. The biological motivation is explicit. The model enforces that “off” nodes do not contribute to downstream targets and that zero total input does not spuriously activate a node. On this basis it is proposed as a natural null model for biological networks. The authors translated the budding yeast network of Li et al. (2004) and the fission yeast network of Davidich and Bornholdt (2008) into the simpler $s\in\{0,1\}$ threshold framework with $\theta_i=0$, $\pm1$ weights, and synchronous $\Theta_0$ updates. The resulting networks reproduce exactly the published wild-type temporal activation sequences, while self-loops previously required for degradation or bistability are replaced by the use of $\Theta_0(0)=0)$ together with the sign of net input [1012.3287]. ## 3. Threshold-triggered avalanches on Erdős–Rényi networks Ausloos and collaborators study a different threshold construction on a static, undirected Erdős–Rényi graph $G(N,p)$, where each node is connected to any other independently with probability $p$ and the degree distribution is binomial, $$ P(k)=\binom{N-1}{k}p^k(1-p)^{N-1-k}, $$ with generating function $$ G_0(x)=[1-p+px]^{N-1}. $$ Although the links carry no built-in direction, the awareness-spreading dynamics induces an effective direction during each avalanche [1401.4270]. Each node $i$ carries a real awareness $a_i(t)\in[0,1]$ and a fixed threshold $\phi$, set to unity in the simulations: $$ H_i\equiv\phi=1\qquad \forall i. $$ Initial conditions are drawn uniformly on $[0,1]$, so that $a_i(t_0)<\phi$ for all $i$ and no spontaneous avalanche occurs at $t_0$. Avalanches are triggered by repeated external-field applications. At the $h$-th application, one chooses uniformly at random a node $i_h$ with $a_{i_h}<\phi$ and imposes $$ a_{i_h}\leftarrow a_{i_h}+\nu, $$ with $\nu=0.01$ or $0.10$ in the reported simulations. If the kick pushes $a_{i_h}$ above threshold, the node activates and shares its current awareness equally among its $n_i$ neighbors that still satisfy $a_j<\phi$: $$ a_j\leftarrow a_j+\left[\frac{a_i}{n_i}\right]. $$ Any neighbor whose updated awareness reaches $a_j\ge\phi$ becomes newly active in the same time step, leading to a breadth-first cascade. There is no reset after firing and no dissipation: awareness only grows. The statistical output is quantitatively specific. Avalanche sizes $S$ have cumulative distribution function $$ F(S)=1-\exp\!\left[-(S/\alpha)^\beta\right], $$ that is, a Weibull law, with fit parameters $\alpha(p)$ and $\beta(p)$ depending only on $p$ and not on $\nu$. Avalanche durations $T$ obey exponential tails, $$ G(T)=1-\exp[-T/\mu], $$ with $\mu$ depending weakly on $p$ but not on $\nu$. The paper explicitly reports that no pure power law $P(S)\sim S^{-\tau}$ was observed [1401.4270]. Several global observables are also fitted analytically. The total number of avalanches before full awareness satisfies $$ N_A\simeq 8+0.1\,p^2, $$ independent of $\nu$, while the total number of field applications required to reach $a_i\ge\phi$ for all nodes is $$ N_h\simeq \frac1\nu\left[6+0.02\,p^{-5/2}\right]. $$ The numbers of “hot” nodes, defined by $\phi-0.1\phi0, $$ one has, with probability $1-o(1)$ as $n\to\infty$: - if $c<1$, then $$ R=n^{c+o(1)}=o(n); $$ - if $c=1$, then $$ R=o(n); $$ - if $c>1$, then $$ R=\left(1-\frac1c+o(1)\right)n, $$ so in particular $R=\Omega(n)$ [1209.2088]. The subcritical and supercritical asymptotics are supported by bounds on $\mathbb E[R]$. Letting $X=R-1$, for $i>1$ one obtains $$ \mathbb P(\mathcal R_i)\le \mathbb E[X_i] = \sum_{\ell=0}^{i-2}\binom{i-2}{\ell}p^{\ell+1} = p(1+p)^{i-2} \le p\,e^{pi}, $$ hence $$ \mathbb E[X] =\sum_{i=2}^n\mathbb P(\mathcal R_i) \le \sum_{i=1}^n p\,e^{pi} = p\,\frac{e^{p(n+1)}-1}{e^p-1}. $$ For $c<1$, this gives $\mathbb E[X]\le n^{c+o(1)}$, and Markov’s inequality implies $R=n^{c+o(1)}$ a.a.s. For $c>1$, a refined argument yields $\mathbb E[X]\le(1-1/c+o(1))n$, and a two-stage exploration argument produces the matching lower bound [1209.2088]. The proof strategy is noteworthy because it relies on elementary tools rather than a heavy branching-process formalism. Upper bounds come from path counting and union bounds; concentration uses Markov’s inequality and Chebyshev’s inequality; the lower bound is obtained from an exploration process in which the gaps between successive reachable vertices are geometrically distributed with success parameter $1-(1-p)^k$. This distinguishes the model from undirected Erdős–Rényi percolation: the phase transition concerns a source-rooted reachable set in an ordered digraph, not the emergence of an undirected giant component. ## 5. Directed threshold contagion and dynamic message passing The message-passing framework of Karrer, Newman, and collaborators addresses threshold adoption on sparse directed networks. The adjacency matrix is defined by $$ A_{ij}= \begin{cases} 1,&\text{if there is a directed edge }j\to i,\\ 0,&\text{otherwise,} \end{cases} $$ so that only in-neighbors can influence a node. The network is drawn from the directed configuration model with joint degree distribution $p_{k^{\rm in},k^{\rm out}}$, and in the limit $n\to\infty$ the ensemble is locally tree-like [1312.2070]. Each vertex $i$ has a threshold $T_i\in\{1,2,\dots\}$. Unless it is an initial adopter, it starts with awareness $a_i(0)=0$; if it is an initial adopter, one may set $a_i(0)=T_i$. At time $t$, node $i$ is an adopter if $a_i(t)\ge T_i$ and susceptible otherwise. Let $\partial_i^{\rm in}$ denote the set of in-neighbors of $i$. The central message variable is $$ U_{i\leftarrow j}(t)=\Pr[\text{“$j$ has not informed $i$” by time }t] $$ in the cavity graph where $i$ is removed. If $i$ is not an initial adopter, the probability that exactly $a$ distinct in-neighbors of $i$ have informed it by time $t$ is $$ P_a^i(t)= \sum_{\substack{\Theta\subseteq\partial_i^{\rm in}\\|\Theta|=a}} \prod_{j\in\Theta}[1-U_{i\leftarrow j}(t)] \prod_{j\in\partial_i^{\rm in}\setminus\Theta}U_{i\leftarrow j}(t), $$ and the susceptible probability is $$ P_S^i(t)=\sum_{a=0}^{T_i-1}P_a^i(t),\qquad P_I^i(t)=1-P_S^i(t). $$ Transmission is governed by a kernel $$ f_{ji}(t-t')=r_{ji}(t-t')\exp\!\left[-\int_0^{\,t-t'}r_{ji}(s)\,ds\right], $$ where $r_{ji}(\tau)$ is the instantaneous transmission rate $\tau$ after adoption. A common choice is $r_{ji}(\tau)=\beta e^{-\gamma\tau}$, which yields $$ f_{ji}(\tau)=\beta e^{-(\beta+\gamma)\tau}. $$ The message-passing equation may be written as $$ -\frac{d}{dt}U_{i\leftarrow j}(t) = f_{ji}(t)\,[1-P_S^j(0)] + P_S^j(0)\int_0^t f_{ji}(t-t')\,p_I^{\,j\setminus i}(t')\,dt', $$ or, after integration by parts, $$ U_{i\leftarrow j}(t) = 1-\int_0^t f_{ji}(\tau)\,d\tau + P_S^j(0)\int_0^t f_{ji}(\tau)\,P_S^{\,j\setminus i}(t-\tau)\,d\tau. $$ These equations are exact on any directed tree and are described as a very good approximation on loopy graphs when loops are long and correlations between incoming edges remain weak [1312.2070]. In the thermodynamic limit of the directed configuration model, all edges are statistically identical, and one introduces $$ U(t)=\langle U_{i\leftarrow j}(t)\rangle,\qquad Q(t)=\Pr[\text{following a random edge leads to a cavity-susceptible vertex at }t]. $$ The self-consistent equation becomes $$ U(t)=1-\int_0^t f(\tau)\,d\tau + P_S(0)\int_0^t f(\tau)\,Q(t-\tau)\,d\tau, $$ which for $f(\tau)=\beta e^{-(\beta+\gamma)\tau}$ reduces to the ODE $$ \frac{dU}{dt}=-(\beta+\gamma)U(t)+\gamma+\beta P_S(0)Q(t). $$ The long-time fixed point $u=U(\infty)$ satisfies a cascade condition obtained by expansion about $u=1$; this gives the directed analogue of the Watts-cascade criterion [1312.2070]. The significance of this formulation is methodological. It provides complete time evolution of adoption probabilities on arbitrary tree-like directed networks, accommodates heterogeneous thresholds and non-Markovian transmission kernels, and yields closed-form population-level equations in the large-network limit. At the same time, its exactness is conditional: the paper’s claim of exactness is restricted to directed trees, with asymptotic accuracy on sparse locally tree-like random graphs. ## 6. Conceptual relations, applications, and interpretive issues The models surveyed here are unified less by a single microscopic rule than by a shared architecture of threshold-mediated propagation on random networks. In the biological null model, the threshold acts on the signed input sum and the critical control parameter is the average in-degree $K$. In the avalanche model, a fixed awareness threshold $\phi=1$ interacts with external driving and equal sharing among neighbors. In the ordered directed graph, the central threshold is structural: the link probability crosses $p^*=\log n/n$ and the reachable set from one seed changes from $o(n)$ to $\Omega(n)$. In the DMP framework, thresholds are node-specific adoption requirements on directed in-neighbor transmissions [1012.3287] [1401.4270] [1209.2088] [1312.2070]. The application domains are correspondingly diverse. The Boolean threshold network is explicitly framed as a null model for biological networks and is used to reproduce wild-type temporal activation sequences in budding yeast and fission yeast cell-cycle control. The avalanche model is presented as a model of opinion spreading on a network under repeated external stimulation. The ordered directed graph is related to spreading processes in temporally ordered populations. The DMP model addresses social behaviors such as trends and opinions and extends naturally to heterogeneous thresholds and non-Markovian dynamics [1012.3287] [1401.4270] [1209.2088] [1312.2070]. Several interpretive cautions follow directly from the cited results. First, threshold dynamics does not by itself imply scale-free avalanche statistics: the avalanche model reports Weibull size distributions and exponential duration tails, with no pure power law observed [1401.4270]. Second, “direction” is model-dependent: it may be built into the adjacency matrix, imposed by vertex order, or induced only during a cascade on an undirected substrate. Third, criticality is likewise model-specific. The biological Boolean network has a dynamical critical connectivity $K_c=2.00$ in the thermodynamic limit, whereas the ordered digraph has a sharp structural threshold at $\log n/n$, and the DMP model formulates cascade onset through a linear stability condition around the cavity fixed point [1012.3287] [1209.2088] [1312.2070]. Taken together, these works show that threshold-directed random-network models occupy a common conceptual space at the intersection of statistical mechanics, percolation, contagion theory, and network dynamics. Their differences are substantive rather than superficial: each model encodes a distinct notion of activation, a distinct source of randomness, and a distinct notion of phase transition. This suggests that the topic is best approached comparatively, with careful attention to whether the threshold acts on weighted inputs, awareness accumulation, path reachability, or message-based adoption probabilities. Source: https://www.emergentmind.com/topics/random-threshold-directed-network-model