betaFeedback

WorksPhysics and Astronomy

Percolation under Edge-Reversal: Creation and Destruction of Strong Connectivity in Directed Networks

Abstract

We study how the connectivity of a directed network changes when each edge is independently reversed with probability pp, while the underlying connections remain fixed. Reversal changes the in- and out-degrees, and we derive the exact transformation of the joint in–out-degree distribution and characterize its evolution under repeated reversal. However, the transformation does not rewire the network, and every edge still connects the same pair of vertices. As a result, the transformed degree distribution alone does not determine whether a giant strongly connected component exists, and a reconstruction based only on the transformed degrees can even place the network on the wrong percolation state. For the directed configuration model, we account for the preserved structure by separately tracking edges that retain or reverse their original direction, leading to a two-type branching process. From this formalism, we obtain explicit analytical criteria for the creation or destruction of a giant strongly connected component and illustrate these contrasting outcomes with empirical examples. Consistent with the predicted creation criterion, randomizing edge directions in a S. cerevisiae transcriptional regulation network dramatically increases the size of the largest strongly connected component. In the San Diego directed road network, the degree moments satisfy the destruction criterion, and the largest strongly connected component decreases to virtually zero, although its decline occurs well below the predicted configuration-model threshold. These results provide a framework for assessing the sensitivity of mutual reachability to changes or uncertainty in edge directions and show that directional disorder can either enable or suppress global connectivity without changing the underlying connections.

Introduction

Directions encode function in many networks. They distinguish upstream from downstream regulation, supply from demand, sender from receiver, predator from prey, and one-way from two-way accessibility. A convenient way to probe how much a network depends on this information is therefore to perturb directions while keeping the underlying set of connections fixed. Here we study the simplest such perturbation: each directed edge is independently reversed with probability pp on the otherwise quenched network structure, meaning that every edge connects the same two vertices as before and only its direction may change.

The operation itself has clear precedents. Random orientations of a fixed graph have been studied in probabilistic graph theory [7, 8, 9]. Direction randomization has also been used as a null model in network science [10, 13], and partial edge reversals have been used to probe loop structure and global directionality in empirical networks [11, 12]. Independent reversal has been studied directly for the strongly connected component of divisor graphs [19]. Related work has developed percolation theory for random directed networks containing both unidirectional and bidirectional edges [5], while strong-connectivity transitions induced by one-way links have been studied in two-dimensional lattice models [14]. Our goal here is to develop an explicit theory for the effect of edge-reversal noise on degree statistics and, for directed configuration models, on percolation when the original edge pairings are preserved.

Generating functions provide a convenient way to describe how edge reversal changes the joint in–out-degree distribution, building on the standard treatment of arbitrary-degree directed random graphs [1]. Predicting percolation, however, requires more information in our setting because reversal preserves the original edge pairings. Reversing edge directions is therefore not equivalent to rebuilding a random graph from the transformed degree distribution. A current directed edge can arise in two different ways—as an original edge that retained its direction or as an original edge that was reversed. Following these two kinds of edges samples different excess-degree distributions and therefore gives different expected numbers of outgoing edges available for further exploration. We accordingly keep the two cases distinct in a two-type branching process. This construction builds on the standard branching-process description of giant components in sparse directed degree-sequence and configuration models [2, 3], and is closely related to multitype and correlated random-graph formalisms used when edge or stub classes carry information not contained in the degree distribution alone [4, 5, 6].

For a directed configuration model, keeping track of the two possible arrival types—through a retained or a reversed edge—leads to a two-type branching description of percolation. Its largest eigenvalue determines the percolation threshold for a giant strongly connected component to exists. Because reversal changes the relative contribution of the two arrival types to the largest eigenvalue, the resulting threshold can move either upward or downward as reversal noise increases, so the same perturbation can create a giant strongly connected component in an initially subcritical network and destroy it in an initially supercritical one. Importantly, this behavior is not determined by the transformed in–out-degree distribution alone: in sufficiently asymmetric cases, a reconstruction based only on that distribution can even predict the wrong connectivity phase.

The configuration model provides a useful baseline for interpreting empirical directed networks. However, real-world directed networks may also contain hierarchy, reciprocity, clustering, geometry, and other forms of organization not encoded by the joint degree distribution [15, 16, 17]. We illustrate the resulting framework using a S. cerevisiae transcriptional network distributed by SNAP [21, 22] and the San Diego freeway-and-ramp subnetwork extracted from an OpenStreetMap-derived city network [23, 24, 25]. These examples exhibit creation and destruction of strong connectivity, respectively, treating reversal as a topology-preserving stress test of how strongly connectivity depends on the observed edge orientations.

Edge-reversal transformation and degree statistics

Consider a directed graph with joint in–out-degree distribution P0(ki,ko)P_0(k_i,k_o), where kik_i and kok_o denote the in- and out-degree of a vertex, and ktot=ki+kok_{\mathrm{tot}} = k_i + k_o is its total degree. Each edge is independently reversed with probability pp and retains its original direction with probability q=1−pq = 1 - p. The endpoints of every edge remain fixed, so the perturbation changes only edge directions and leaves the underlying undirected graph unchanged.

Multiple edges and oppositely directed edges between the same pair of vertices, when present, are treated as distinct labelled edges and are reversed independently. Allowing such edges is natural for the directed configuration model and keeps the reversal operation well defined without additional merging or rejection rules. They are not required for the degree-level results derived below. In sparse configuration-model limits, occasional multiple or opposite-direction edges do not affect the leading percolation threshold, although they may be more relevant in finite, strongly heterogeneous, or highly reciprocal networks.

Consider now a vertex with initial in-degree kik_i and out-degree kok_o. After the perturbation, its incoming edges can have two origins: original incoming edges that were not reversed and original outgoing edges that were reversed. Let nn and mm denote the numbers of edges of these two types, respectively. Then, the new in- and out-degrees are

ki′=n+m,ko′=ki+ko−n−m.(1)k_i' = n + m,\qquad k_o' = k_i + k_o - n - m. \tag*{(1)}

In particular, ki′+ko′=ki+kok_i' + k_o' = k_i + k_o, and the total degree of every vertex is exactly conserved. Since edges are reversed independently, nn and mm are statistically independent and follow binomial distributions with parameters (ki,q)(k_i,q) and (ko,p)(k_o,p), respectively. Therefore, after edges are reversed with probability pp, the new degree distribution can be written as

Pp(ki′,ko′)=∑ki∑koP0(ki,ko)∑n=0ki∑m=0ko(kin)qnpki−n(kom)pmqko−mδki′,n+mδko′,ki+ko−n−m.(2)P_p(k_i',k_o') = \sum_{k_i}\sum_{k_o} P_0(k_i,k_o) \sum_{n=0}^{k_i}\sum_{m=0}^{k_o} \binom{k_i}{n} q^n p^{k_i-n} \binom{k_o}{m} p^m q^{k_o-m} \delta_{k_i',n+m}\delta_{k_o',k_i+k_o-n-m}. \tag*{(2)}

We now define the generating function of the joint in–out-degree distribution after the perturbation by

P^p(zi,zo)=∑ki∑koPp(ki,ko)zikizoko,(3)\hat{P}_p(z_i,z_o) = \sum_{k_i}\sum_{k_o} P_p(k_i,k_o)z_i^{k_i}z_o^{k_o}, \tag*{(3)}

and similarly define P^0(zi,zo)\hat{P}_0(z_i,z_o) for the original joint in–out-degree distribution. Using (2), we see that these two generating functions are related by

P^p(zi,zo)=P^0(qzi+pzo,pzi+qzo).(4)\hat{P}_p(z_i,z_o) = \hat{P}_0(qz_i+pz_o,pz_i+qz_o). \tag*{(4)}

Equation (4) gives the exact change in the joint in–out-degree distribution under edge-reversal noise. It is a degree-level identity and does not require a configuration-model, tree-like, or other random-graph assumption.

Several invariants follow immediately. Since reversal leaves ktotk_{\mathrm{tot}} unchanged at every vertex, the total-degree distribution Ptot(ktot)P_{\mathrm{tot}}(k_{\mathrm{tot}}) is unchanged. Its generating function,

P^tot(ztot)=P^p(ztot,ztot)=P^0(ztot,ztot),(5)\widehat{P}_{\mathrm{tot}}(z_{\mathrm{tot}})=\widehat{P}_{p}(z_{\mathrm{tot}},z_{\mathrm{tot}})=\widehat{P}_{0}(z_{\mathrm{tot}},z_{\mathrm{tot}}), \tag*{(5)}

is therefore invariant. The numbers of vertices and edges are also unchanged, as are all weakly connected components, because the underlying undirected graph is fixed.

Finally, each directed edge contributes one unit to the total in-degree and one unit to the total out-degree of the network. Their mean values are therefore equal and remain invariant under reversal:

⟨ki⟩p=⟨ko⟩p=μ,μ=⟨ktot⟩2.(6)\langle k_i\rangle_p=\langle k_o\rangle_p=\mu,\qquad\mu=\frac{\langle k_{\mathrm{tot}}\rangle}{2}. \tag*{(6)}

Iteration of the transformation and stationary orientation statistics

The transformation can be iterated. Two independent reversal rounds with probabilities p1p_1 and p2p_2 reverse an edge relative to its initial orientation exactly when one, but not both, reversals occur. This happens with probability p1+p2−2p1p2p_1+p_2-2p_1p_2. After nn rounds with the same pp, the probability to finally reverse an edge is the probability that during the nn rounds the number of partial reversals is an odd number. This is simply the sum for all odd numbers of a binomial distribution with parameters nn and pp, which gives

pn=1−(1−2p)n2,qn=1−pn,(7)p_n=\frac{1-(1-2p)^n}{2},\qquad q_n=1-p_n, \tag*{(7)}

and the joint degree generating function becomes

P^n(zi,zo)=P^0(qnzi+pnzo,pnzi+qnzo).(8)\widehat{P}_n(z_i,z_o)=\widehat{P}_0(q_nz_i+p_nz_o,p_nz_i+q_nz_o). \tag*{(8)}

The factor 1−2p1-2p in Eq. (7) carries the memory of the initial orientation. After nn rounds, this directional memory is reduced by the factor (1−2p)n(1-2p)^n. For 0<p<10<p<1, we have ∣1−2p∣<1|1-2p|<1, so this memory vanishes as n→∞n\to\infty and pn⟶12p_n\longrightarrow\frac{1}{2}. The limiting joint degree distribution is therefore

P^∞(zi,zo)=P^0(zi+zo2,zi+zo2),\widehat{P}_{\infty}(z_i,z_o)=\widehat{P}_0\left(\frac{z_i+z_o}{2},\frac{z_i+z_o}{2}\right),
P∞(ki,ko)=Ptot(ki+ko)(ki+koki)2−(ki+ko).(9)P_{\infty}(k_i,k_o)=P_{\mathrm{tot}}(k_i+k_o)\binom{k_i+k_o}{k_i}2^{-(k_i+k_o)}. \tag*{(9)}

Equation (9) has a direct interpretation. Conditional on a vertex having total degree ktot=ki+kok_{\mathrm{tot}}=k_i+k_o, each of its incident edges is equally likely to point inward or outward in the limiting ensemble. Hence, the limiting network remains directed, but its edge orientations no longer retain information about their initial directions and every vertex has equal expected value for its in- and out-degree, while the actual values fluctuate from vertex to vertex. Thus, repeated reversal converges to the uniform distribution over all possible orientations of that skeleton. At p=1/2p=1/2, this distribution is reached in a single round, since every edge is then equally likely to have either orientation.

The endpoints are exceptional. At p=0p=0 no edge changes direction, whereas at p=1p=1 every edge reverses at every round, producing a deterministic two-cycle between the original network and its global reversal. Finally, global reversal does not change the strongly connected components (SCC). Moreover, reversal with probability 1−p1-p is equivalent, up to a global reversal, to reversal with probability pp. SCC statistics are therefore symmetric under p↔1−pp\leftrightarrow1-p. We consequently restrict attention to 0≤p≤1/20\leq p\leq1/2, over which increasing pp corresponds to increasing edge orientation noise.

Exact evolution of second-order degree moments

We next consider how reversal noise changes the second-order degree moments. Define the initial second factorial moments of the in- and out-degree and the mixed factorial moment as

Fi≡⟨ki(ki−1)⟩0,Fo≡⟨ko(ko−1)⟩0,(10)F_i\equiv\langle k_i(k_i-1)\rangle_0,\qquad F_o\equiv\langle k_o(k_o-1)\rangle_0, \tag*{(10)}

and

Fio≡⟨kiko⟩0.(11)F_{io}\equiv\langle k_i k_o\rangle_0. \tag*{(11)}

Differentiating the generating-function transformation in Eq. (4) gives

Fi(p)=q2Fi+p2Fo+2pqFio,(12)F_i(p)=q^2F_i+p^2F_o+2pqF_{io}, \tag*{(12)}
Fo(p)=p2Fi+q2Fo+2pqFio,(13)F_o(p)=p^2F_i+q^2F_o+2pqF_{io}, \tag*{(13)}
Fio(p)=(q2+p2)Fio+pq(Fi+Fo).(14)F_{io}(p)=(q^2+p^2)F_{io}+pq(F_i+F_o). \tag*{(14)}

Thus, the second-order degree moments after one reversal step are determined exactly by the corresponding moments of the original network.

For the mixed factorial moment, Eq. (14) gives

Fio(p)−Fio=pq(Fi+Fo−2Fio)=pq[⟨(ki−ko)2⟩0−⟨ktot⟩0].(15)\begin{aligned} F_{io}(p)-F_{io}=pq(F_i+F_o-2F_{io}) \\ &=pq\left[\langle(k_i-k_o)^2\rangle_0-\langle k_{\mathrm{tot}}\rangle_0\right]. \tag*{(15)} \end{aligned}

The sign of the quantity in brackets therefore determines whether reversal noise increases or decreases the mixed in–out degree moment.

After nn rounds with the same reversal probability 0<p<10<p<1, the mixed factorial moment is

Fio,n=Fio,∞+(1−2p)2n(Fio−Fio,∞),(16)F_{io,n}=F_{io,\infty}+(1-2p)^{2n}(F_{io}-F_{io,\infty}), \tag*{(16)}

where

Fio,∞=⟨ktot(ktot−1)⟩04=Fi+Fo+2Fio4.(17)F_{io,\infty}=\frac{\langle k_{\mathrm{tot}}(k_{\mathrm{tot}}-1)\rangle_0}{4}=\frac{F_i+F_o+2F_{io}}{4}. \tag*{(17)}

Since (1−2p)2n→0(1-2p)^{2n}\to0 as n→∞n\to\infty for 0<p<10<p<1, Eq. (16) shows explicitly that Fio,nF_{io,n} converges to Fio,∞F_{io,\infty}. At p=1/2p=1/2, the random-orientation limit is reached after a single reversal step.

The relevance of Eq. (15) stems from the fact that, for uncorrelated random networks, the percolation transition takes place when

⟨kiko⟩⟨ki⟩>1.(18)\frac{\langle k_i k_o\rangle}{\langle k_i\rangle} > 1. \tag*{(18)}

Therefore, the possibility of increasing or decreasing the mixed in–out degree moment opens up the possibility that percolated networks may be destroyed by noise or that non-percolated ones may percolate. However, as we explain in the next section, the new percolation transition cannot be directly derived from Eq. (15).

Percolation under edge reversal with fixed edge pairings

The results in the section above are exact averages over the edge-reversal process for a fixed initial graph. They describe how the degree statistics change under reversal noise, but they do not by themselves determine the existence or size of giant directed components.

Knowing only the new joint in–out-degree distribution after reversal is not enough to predict the percolation behavior of the actual reversed network. In an ordinary directed configuration model, following a randomly chosen directed edge leads to a vertex with probability proportional to its in-degree. The expected number of outgoing edges available from the vertex reached in this way is therefore

⟨kiko⟩⟨ki⟩=Fioμ.(19)\frac{\langle k_i k_o\rangle}{\langle k_i\rangle} = \frac{F_{io}}{\mu}. \tag*{(19)}

This quantity is the mean branching factor for directed exploration. The percolation threshold occurs when it reaches unity, Fio/μ=1F_{io}/\mu= 1 [1].

One might therefore try to apply Eq. (19) directly to the transformed degree distribution. This would amount to constructing a new directed configuration model from the transformed in- and out-degrees, with the stubs paired uniformly at random, with branching factor

Rdeg(p)=Fio(p)μ=(q2+p2)Fio+pq(Fi+Fo)μ.(20)R_{\mathrm{deg}}(p) = \frac{F_{io}(p)}{\mu} = \frac{(q^2+p^2)F_{io}+pq(F_i+F_o)}{\mu}. \tag*{(20)}

Such a construction preserves the transformed degree statistics, but not the edge pairings of the original graph. It therefore differs from the reversal process studied here, in which the same pairs of vertices remain connected and only the edge directions change.

This distinction matters because the preserved pairings contain information relevant to directed percolation that is not encoded in the transformed degree distribution alone. After reversal, a current outgoing edge can arise in two different ways: it can be an original outgoing edge that retained its direction, or an original incoming edge that was reversed. Following these two types of edges reaches vertices through different original stub types and therefore samples different excess-degree distributions. This motivates a two-type branching description, consistent with hidden-stub and correlated-percolation formalisms [4, 5, 6].

Two-type branching matrix

From this point on, we introduce a directed percolation calculation for the problem of edge reversal with fixed edge pairings studied here. We consider the large NN limit of sparse directed configuration models with joint degree distribution converging to P0(ki,ko)P_0(k_i,k_o). The total numbers of incoming and outgoing stubs are equal, the stubs are initially matched uniformly at random, and neighborhoods are locally tree-like, so following directed edges through the network can be approximated by a branching process implying that each newly reached vertex generates a number of outgoing edges that can be followed to new vertices, while repeated visits to previously reached vertices are negligible at this stage. A giant directed component appears when this exploration has a positive probability of continuing indefinitely in the large-network limit. Survival of this branching process then identifies the appearance of extensive directed components, including the Strongly Connected Component (SCC) of nodes that are mutually reachable following directed paths. This is the standard setting used in giant-SCC results for directed degree-sequence models [2, 3].

The only additional information needed after reversal is whether a current edge kept its original direction or was reversed. We therefore distinguish two types of edge in the branching process: retained edges and reversed edges. To see why the two types must be distinguished, consider following a current outgoing edge and arriving at its target vertex. If the edge was retained, then it was originally an incoming edge of the vertex that we reach. A vertex with original degrees (ki,ko)(k_i,k_o) is therefore reached with probability proportional to its original in-degree, and so distributed as

kiP0(ki,ko)μ.(21)\frac{k_i P_0(k_i,k_o)}{\mu}. \tag*{(21)}

Once there, its kok_o original outgoing edges remain outgoing with probability qq, while its remaining ki−1k_i-1 original incoming edges become outgoing if they are reversed, with probability pp.

If instead the edge that we followed was itself reversed, then it was originally an outgoing edge of the vertex that we reach. Vertices are therefore sampled with probability

koP0(ki,ko)μ.(22)\frac{k_o P_0(k_i,k_o)}{\mu}. \tag*{(22)}

In this case, one of the kok_o original outgoing edges has already been used to reach the vertex, leaving ko−1k_o-1 such edges, while all kik_i original incoming edges remain available to become outgoing through reversal.

To construct the mean offspring matrix, we average the numbers of available outgoing edges using the degree distribution conditioned on the arrival type. We label retained edges as type 1 and reversed edges as type 2, and define Mab(p)M_{ab}(p) as the mean number of outgoing edges of type bb available at a vertex reached through an edge of type aa. Here, outgoing always refers to the direction after the perturbation.

For arrival through a retained edge, the original degrees of the vertex reached are distributed according to Eq. (21). Its kok_o original outgoing edges are retained with probability qq, while each of its ki−1k_i-1 remaining original incoming edges becomes outgoing with probability pp. Therefore,

M11(p)=∑ki,kokiP0(ki,ko)μqko=qFioμ,M_{11}(p)=\sum_{k_i,k_o}\frac{k_iP_0(k_i,k_o)}{\mu}qk_o=\frac{qF_{io}}{\mu},
M12(p)=∑ki,kokiP0(ki,ko)μp(ki−1)=pFiμ.M_{12}(p)=\sum_{k_i,k_o}\frac{k_iP_0(k_i,k_o)}{\mu}p(k_i-1)=\frac{pF_i}{\mu}.

The subtraction of one in the second expression excludes the original incoming edge through which the vertex was reached.

For arrival through a reversed edge, the corresponding degree distribution is Eq. (22). In this case, the arrival edge was originally outgoing, leaving ko−1k_o-1 original outgoing edges that can retain their direction, while all kik_i original incoming edges can become outgoing through reversal. Thus,

M21(p)=∑ki,kokoP0(ki,ko)μq(ko−1)=qFoμ,M_{21}(p)=\sum_{k_i,k_o}\frac{k_oP_0(k_i,k_o)}{\mu}q(k_o-1)=\frac{qF_o}{\mu},
M22(p)=∑ki,kokoP0(ki,ko)μpki=pFioμ.M_{22}(p)=\sum_{k_i,k_o}\frac{k_oP_0(k_i,k_o)}{\mu}pk_i=\frac{pF_{io}}{\mu}.

Combining these four conditional averages gives the mean offspring matrix

M(p)=1μ(qFiopFiqFopFio).(23)M(p)=\frac{1}{\mu} \begin{pmatrix} qF_{io} & pF_i\\ qF_o & pF_{io} \end{pmatrix}. \tag*{(23)}

The rows specify whether the current vertex was reached through a retained or a reversed edge, respectively, and the columns specify whether the next edge followed is retained or reversed.

The same construction can be carried out backward, by following edges against their direction. This interchanges FiF_i and FoF_o, but the resulting matrix has the same eigenvalues. Consequently, forward and backward exploration have the same growth threshold. The largest eigenvalue of M(p)M(p) is

Λ(p)=Fio+(1−2p)2Fio2+4pqFiFo2μ.(24)\Lambda(p)=\frac{F_{io}+\sqrt{(1-2p)^2F_{io}^{2}+4pqF_iF_o}}{2\mu}. \tag*{(24)}

In the Appendix A, we show that this eigenvalue is the effective branching factor of the two-type process. In the configuration-model regime described above, directed exploration becomes extensive when

Λ(p)>1.\Lambda(p)>1.

The same condition governs the appearance of giant in- and out-components and, when both are present, of a giant strongly connected component. The corresponding component-size equations are derived in Appendix A.

At p=0p=0, no edge is reversed, so the two-type description reduces to the usual directed configuration-model result,

Λ(0)=Fioμ.(25)\Lambda(0)=\frac{F_{io}}{\mu}. \tag*{(25)}

At p=1/2p=1/2, each edge direction is randomized with equal probability, and

Λ(1/2)=Fio+FiFo2μ.(26)\Lambda(1/2)=\frac{F_{io}+\sqrt{F_iF_o}}{2\mu}. \tag*{(26)}

For comparison, let Rdeg(p)R_{\mathrm{deg}}(p) denote the branching factor obtained by discarding the original edge pairings and constructing a new directed configuration model from the transformed degree distribution alone. At p=1/2p=1/2, the difference between this degree-only prediction and the branching factor of the actual reversal process is

Rdeg(1/2)−Λ(1/2)=(Fi−Fo)24μ≥0.(27)R_{\mathrm{deg}}(1/2)-\Lambda(1/2)=\frac{(\sqrt{F_i}-\sqrt{F_o})^2}{4\mu}\geq0. \tag*{(27)}

Thus, even when the edge directions have been completely randomized, a network obtained by reversing directions while preserving the original edge pairings is generally not equivalent to a new configuration-model network constructed only from the resulting degree distribution.

Creation, destruction, and repeated reversal

On the interval 0≤p≤1/20\leq p\leq1/2, the quantity pq=p(1−p)pq=p(1-p) increases monotonically from 0 to 1/41/4, while (1−2p)2(1-2p)^2 decreases from 1 to 0. It follows from Eq. (24) that the branching factor Λ(p)\Lambda(p) is itself monotonic:

Λ(p) increases if FiFo>Fio2,Λ(p) decreases if FiFo<Fio2,Λ(p) remains constant if FiFo=Fio2.(28)\begin{aligned} \Lambda(p)&\text{ increases if }F_iF_o>F_{io}^{2},\\ \Lambda(p)&\text{ decreases if }F_iF_o<F_{io}^{2},\\ \Lambda(p)&\text{ remains constant if }F_iF_o=F_{io}^{2}. \tag*{(28)} \end{aligned}

Because Λ(p)\Lambda(p) is monotonic on 0≤p≤1/20\leq p\leq1/2, the possibility of a noise-induced transition can be determined entirely from its values at the two endpoints. Using Eq. (25) and Eq. (26), a noise-induced creation of a giant strongly connected component occurs when

Fioμ<1<Fio+FiFo2μ.(29)\frac{F_{io}}{\mu}<1<\frac{F_{io}+\sqrt{F_iF_o}}{2\mu}. \tag*{(29)}

so that the network is subcritical at p=0p=0 but becomes supercritical as the directions are randomized. Conversely, a destruction transition occurs when

Fioμ>1>Fio+FiFo2μ.(30)\frac{F_{io}}{\mu} > 1 > \frac{F_{io}+\sqrt{F_iF_o}}{2\mu}. \tag*{(30)}

so that a giant strongly connected component present initially is lost as the reversal probability increases. If both endpoint values are on the same side of one, no percolation transition occurs on 0≤p≤1/20 \le p \le1/2.

When the endpoint values lie strictly on opposite sides of one, monotonicity guarantees a unique transition probability 0<pc<1/20 < p_c < 1/2. At the transition,

Λ(pc)=1.\Lambda(p_c)=1.

Defining ηc=pc(1−pc)\eta_c=p_c(1-p_c), after some algebra we obtain

ηc=μ(Fio−μ)Fio2−FiFo,pc=1−1−4ηc2.(31)\eta_c=\frac{\mu(F_{io}-\mu)}{F_{io}^{2}-F_iF_o}, \qquad p_c=\frac{1-\sqrt{1-4\eta_c}}{2}. \tag*{(31)}

The minus sign in the expression for pcp_c selects the solution in the interval 0<pc<1/20 < p_c < 1/2. Finally, requiring Λ(0)\Lambda(0) and Λ(1/2)\Lambda(1/2) to lie on opposite sides of one ensures that Eq. (31) corresponds to the physical percolation transition.

The same framework also applies to repeated reversal. After nn rounds with the same reversal probability pp, an edge has the effective reversal probability pnp_n given by Eq. (7). Substituting pnp_n into Eq. (24) gives

Λn=Fio+FiFo+(1−2p)2n(Fio2−FiFo)2μ.(32)\Lambda_n=\frac{F_{io}+\sqrt{F_iF_o+(1-2p)^{2n}(F_{io}^{2}-F_iF_o)}}{2\mu}. \tag*{(32)}

For 0<p<10 < p < 1, (1−2p)2n→0(1-2p)^{2n}\to0 as n→∞n\to\infty, and therefore

Λn⟶Fio+FiFo2μ=Λ(1/2).(33)\Lambda_n\longrightarrow\frac{F_{io}+\sqrt{F_iF_o}}{2\mu}=\Lambda(1/2). \tag*{(33)}

If FiFo>Fio2F_iF_o>F_{io}^{2}, this limiting value is approached from below; if FiFo<Fio2F_iF_o<F_{io}^{2}, it is approached from above. When FiFo=Fio2F_iF_o=F_{io}^{2}, the branching factor is unchanged by reversal.

Examples

Creation from sources and sinks in a bipartite directed network

Consider an initially acyclic configuration-model ensemble in which half of the vertices are pure sources, with degrees (0,k)(0,k), and the other half are pure sinks, with degrees (k,0)(k,0). Thus every edge in the original bipartite network points from a source to a sink. A directed path therefore stops as soon as it reaches a sink, so the initial network cannot contain a giant strongly connected component.

The joint degree generating function is

P^0(x,y)=xk+yk2,\widehat{P}_0(x,y)=\frac{x^k+y^k}{2},
μ=k2,Fi=Fo=k(k−1)2,Fio=0.(34)\mu=\frac{k}{2}, \qquad F_i=F_o=\frac{k(k-1)}{2}, \qquad F_{io}=0. \tag*{(34)}

The vanishing mixed moment Fio=0F_{io}=0 reflects the complete separation between sources and sinks: no vertex has both incoming and outgoing edges initially. Substituting these moments into Eq. (24) gives

Λ(p)=(k−1)pq.(35)\Lambda(p)=(k-1)\sqrt{pq}. \tag*{(35)}

At p=0p=0, Λ(0)=0\Lambda(0)=0, consistent with the absence of sustained directed paths. As edges are reversed, however, some of the original source-to-sink edges become sink-to-source edges. Sinks can then acquire outgoing edges and sources can acquire incoming edges, allowing directed paths to alternate between the two vertex classes and creating return routes that were absent in the original orientation.

A giant strongly connected component appears when Λ(p)\Lambda(p) crosses one. Solving Λ(pc)=1\Lambda(p_c)=1 gives

pc=1−1−4/(k−1)22,(36)p_c=\frac{1-\sqrt{1-4/(k-1)^2}}{2}, \tag*{(36)}

where the root in the interval 0≤pc≤1/20\le p_c\le1/2 has been chosen. Such a transition is possible only for k≥4k\ge4, because at complete direction randomization

Λ(1/2)=k−12,\Lambda(1/2) = \frac{k-1}{2},

which exceeds one only when k>3k > 3.

For the simplest case, k=4k = 4, pc≃0.127322p_c \simeq0.127322. By contrast, a degree-only reconstruction based on the transformed degrees gives Rdeg(p)=6pqR_{\mathrm{deg}}(p) = 6pq, and would place the transition at p≃0.211325p \simeq0.211325. The difference arises because the degree-only reconstruction discards the original source–sink edge pairings, whereas the actual reversal process preserves them.

Importantly, the transition is produced without adding or removing any edges. Reversal changes only their directions, but this is sufficient to create directed return paths on the same underlying bipartite network and thereby generate a giant strongly connected component. Figure 1 shows numerical simulations of this toy example confirming our predictions.

Figure 1. Creation of a giant strongly connected component in the k=4k=4 bipartite ensemble. The solid curve is the solution of the two-type component equations in Appendix A. Symbols show the mean largest-SCC fraction from synthetic configuration-model simulations. Blue and orange dotted vertical lines mark the two-type and degree-only threshold predictions, respectively. The orange dashed curve is the degree-only prediction. Open circles and filled squares show the smaller and larger simulated sizes, respectively; error bars indicate one standard error over 12 realizations.

Destruction in an initially balanced directed ensemble

Consider an initially balanced directed configuration-model ensemble with joint degree generating function

P^0(x,y)=67xy+17x2y2.(37)\widehat{P}_0(x,y) = \frac{6}{7}xy + \frac{1}{7}x^2y^2. \tag*{(37)}

Thus, a fraction 6/76/7 of the vertices have one incoming and one outgoing edge, (ki,ko)=(1,1)(k_i,k_o) = (1,1), while the remaining fraction 1/71/7 have two incoming and two outgoing edges, (ki,ko)=(2,2)(k_i,k_o) = (2,2). Every vertex therefore has equal in- and out-degree in the original network.

The corresponding moments are

μ=87,Fi=Fo=27,Fio=107.(38)\mu= \frac{8}{7}, \qquad F_i = F_o = \frac{2}{7}, \qquad F_{io} = \frac{10}{7}. \tag*{(38)}

At p=0p = 0, the branching factor is

Λ(0)=Fioμ=54>1,\Lambda(0) = \frac{F_{io}}{\mu} = \frac{5}{4} > 1,

so the initial network is in the supercritical regime and supports a giant strongly connected component.

Edge reversal has the opposite effect from the previous bipartite example. Although the mean in- and out-degrees remain unchanged, individual vertices need no longer remain balanced. For example, a vertex that initially has one incoming and one outgoing edge can, after reversal, end up with two incoming edges or two outgoing edges. Such local imbalances reduce the ability of directed paths to continue in both directions through the network.

Substituting the moments in Eq. (24) for the effective branching factor of the two types gives

Λ(p)=5+25−96pq8.(39)\Lambda(p) = \frac{5 + \sqrt{25 - 96pq}}{8}. \tag*{(39)}

Since FiFo<Fio2F_iF_o < F_{io}^2, this quantity decreases monotonically as pp increases from 0 to 1/21/2. At complete randomization of the edge directions,

Λ(1/2)=34<1.\Lambda(1/2) = \frac{3}{4} < 1.

The network therefore passes from the supercritical to the subcritical regime as the reversal probability increases.

The destruction threshold is obtained from Λ(pc)=1\Lambda(p_c) = 1, giving

pc=1−1/32≃0.211325.(40)p_c = \frac{1 - 1/\sqrt{3}}{2} \simeq0.211325. \tag*{(40)}

Thus, once approximately 21% of the edges are independently reversed, the branching process becomes subcritical in the large-network limit.

For comparison, reconstructing a new directed configuration model from the transformed degree distribution alone gives

Rdeg(p)=54−2pq,R_{\mathrm{deg}}(p) = \frac{5}{4} - 2pq,

which crosses one at

p≃0.146447.p \simeq0.146447.

The degree-only reconstruction therefore predicts the loss of the giant strongly connected component substantially earlier than the pairing-preserving reversal calculation. The difference arises because the actual reversal process keeps the original edge pairings, whereas the degree-only construction retains only the transformed degree statistics. Figure 2 shows numerical simulations, confirming again our predictions.

Figure 2. Destruction of the giant strongly connected component for Eq. (37). The branching prediction is pc≃0.211325p_c \simeq0.211325, rather than the degree-only value 0.1464470.146447. The blue solid and orange dashed curves show the pairing-aware and degree-only predictions; matching dotted vertical lines mark their thresholds. Open circles and filled squares show the smaller and larger simulated sizes, respectively, with one-standard-error bars over 12 realizations. Finite graphs retain small SCCs in the subcritical regime, while the extensive fraction vanishes in the random-graph limit.

Degree-only reconstruction can predict the wrong percolation phase

The previous two examples have Fi=FoF_i = F_o. In that symmetric case, the degree-only and pairing-preserving branching criteria become equal at p=1/2p = 1/2, although they can differ for intermediate reversal probabilities. To show that the distinction can be qualitative rather than merely quantitative, consider the degree distribution with characteristic function

P^0(x,y)=14x4y+58y+18xy2.(41)\hat{P}_0(x,y) = \frac{1}{4}x^4y + \frac{5}{8}y + \frac{1}{8}xy^2. \tag*{(41)}

This distribution contains three types of vertices: a fraction 1/41/4 have degrees (ki,ko)=(4,1)(k_i,k_o) = (4,1), a fraction 5/85/8 have degrees (0,1)(0,1), and a fraction 1/81/8 have degrees (1,2)(1,2). The network is therefore strongly asymmetric in its in- and out-degree statistics, even though the mean in- and out-degrees remain equal, as required for a directed network. The corresponding moments are

μ=98,Fi=3,Fo=14,Fio=54.(42)\mu= \frac{9}{8}, \qquad F_i = 3, \qquad F_o = \frac{1}{4}, \qquad F_{io} = \frac{5}{4}. \tag*{(42)}

Two combinations of these moments control two different responses to reversal noise:

Fi+Fo−2Fio=34>0,FiFo−Fio2=−1316<0.(43)F_i + F_o - 2F_{io} = \frac{3}{4} > 0, \qquad F_iF_o - F_{io}^{2} = -\frac{13}{16} < 0. \tag*{(43)}

The first quantity determines the change of the mixed factorial moment Fio(p)F_{io}(p), while the second determines the change of the true branching factor Λ(p)\Lambda(p). Their opposite signs therefore imply that these two quantities move in opposite directions as pp increases. Indeed, the degree-only reconstruction gives

Rdeg(p)=109+23pq,(44)R_{\mathrm{deg}}(p) = \frac{10}{9} + \frac{2}{3}pq, \tag*{(44)}

which increases with reversal noise and remains larger than one for the entire interval 0≤p≤1/20 \le p \le1/2. If one considered only the transformed degree distribution, one would therefore conclude that the network remains in the supercritical regime. The pairing-preserving branching calculation gives a different result:

Λ(p)=5+25−52pq9.(45)\Lambda(p) = \frac{5 + \sqrt{25 - 52pq}}{9}. \tag*{(45)}

Because FiFo<Fio2F_iF_o < F_{io}^{2}, Λ(p)\Lambda(p) decreases monotonically with pp. Initially,

Λ(0)=109>1,\Lambda(0) = \frac{10}{9} > 1,

so the network is supercritical. As the edge directions are randomized, however, the branching factor falls and eventually crosses the percolation threshold. Solving Λ(pc)=1\Lambda(p_c) = 1 gives

pc=1−2/132≃0.222650.(46)p_c = \frac{1 - 2/\sqrt{13}}{2} \simeq0.222650. \tag*{(46)}

Thus the giant strongly connected component is predicted to disappear once the reversal probability exceeds approximately 0.223. The contrast is especially clear at complete direction randomization, p=1/2p = 1/2:

Λ(1/2)=5+239≃0.94046<1,\Lambda(1/2) = \frac{5 + 2\sqrt{3}}{9} \simeq0.94046 < 1,
Rdeg(1/2)=2318>1.(47)R_{\mathrm{deg}}(1/2) = \frac{23}{18} > 1. \tag*{(47)}

The two descriptions therefore predict different connectivity phases: the degree-only reconstruction remains supercritical, whereas the pairing-preserving calculation is subcritical. This example clearly shows why the transformed joint degree distribution alone is not sufficient to determine percolation under edge reversal. The quantity Fio(p)/μF_{io}(p)/\mu, which would be the branching factor of a newly rewired configuration model with the transformed degrees, actually increases with pp. Nevertheless, the true branching factor of the edge-reversal process decreases because the original edge pairings are preserved and retained and reversed edges sample those pairings differently. Figure 3 shows simulation results confirming these predictions.

Figure 3. Asymmetric destruction example, Eq. (41). The two-type theory predicts the loss of the extensive SCC at pc≃0.22265p_c \simeq0.22265, while the degree-only comparison remains supercritical for all 0≤p≤1/20 \leq p \leq1/2. The blue solid and orange dashed curves show the pairing-aware and degree-only predictions, respectively; the blue dotted line marks the pairing-aware threshold. Open circles and filled squares show the smaller and larger synthetic configuration-model sizes, respectively, with one-standard-error bars over 12 realizations. Sampling near the transition is limited and the figure is intended as a consistency check rather than a finite-size scaling study.

Applications to real directed networks

For an empirical directed network, edge reversal can be used as a sensitivity test of how strongly connectivity depends on the observed edge directions. The network connections are kept fixed, each edge is independently reversed with probability pp, and the resulting response is measured through

SGSCC(p),SGIN(p),SGOUT(p).(48)S_{\mathrm{GSCC}}(p), \qquad S_{\mathrm{GIN}}(p), \qquad S_{\mathrm{GOUT}}(p). \tag*{(48)}

These curves show how mutual reachability changes as the edge orientations are progressively randomized. The empirical response can be compared with two configuration-model baselines. The first is the pairing-aware two-type model developed above, which accounts for the different roles of retained and reversed edges. The second is the degree-only reconstruction, in which a new directed configuration model is built from the transformed degree distribution Pp(ki,ko)P_p(k_i,k_o) and the original edge pairings are discarded. Differences between the empirical response and either baseline indicate structural information not contained in that particular random-graph description, such as reciprocity, clustering, geometry, motifs, and degree correlations [15, 16, 17].

The same procedure can also be used when edge directions are uncertain rather than deliberately perturbed. A uniform pp provides a simple reference test, while edge-specific reversal probabilities can be used when confidence in the inferred directions varies from edge to edge.

Creation of strong connectivity in a S. cerevisiae transcriptional regulation network

We illustrate this procedure using the S. cerevisiae transcriptional regulation network distributed by SNAP of Milo et al. [21, 22]. The network contains 690 vertices and 1,094 directed edges, including 12 self-regulatory loops. Removing those loops leaves N=690N = 690, E=1082E = 1082, with no isolated vertices. The analysis uses only directed topology; regulatory signs do not enter the reversal process. The largest weakly connected component contains 664 vertices, whereas the observed largest strongly connected component contains only three:

SGSCC(0)=3690≃0.00435.(49)S_{\mathrm{GSCC}}(0) = \frac{3}{690} \simeq0.00435. \tag*{(49)}

Thus the observed orientation supports very little mutual reachability, despite an almost network-spanning weakly connected component.

The loop-free network has mean degree and factorial moments

μ=1.568116,Fi0=0.565217,\mu= 1.568116,\qquad F_{i0} = 0.565217,
Fi=34.730435,Fo=2.802899.(50)F_i = 34.730435,\qquad F_o = 2.802899. \tag*{(50)}

The pairing-aware branching factor consequently satisfies

Λ(0)=0.36044<1<Λ(1/2)=3.32616.(51)\Lambda(0) = 0.36044 < 1 < \Lambda(1/2) = 3.32616. \tag*{(51)}

Unlike a case in which reversal merely enlarges an already-supercritical core, this degree sequence satisfies the creation criterion. Solving Λ(pc)=1\Lambda(p_c) = 1 gives pc≃0.01648p_c \simeq0.01648, corresponding to about 17.8 reversed edges on average. The degree-only reconstruction instead predicts pcdeg≃0.02835p_c^{\mathrm{deg}} \simeq0.02835. These are configuration-model thresholds inferred from the empirical degree sequence, rather than sharp transition points of this finite fixed network.

Figure 4 compares the empirical reversal response with the two configuration-model baselines. Each empirical point averages 300 independent reversal realizations. The mean largest-SCC fraction increases to SGSCC(0.05)≈0.02S_{\mathrm{GSCC}}(0.05) \approx0.02 at p=0.05p = 0.05, to SGSCC(0.5)≈0.3S_{\mathrm{GSCC}}(0.5) \approx0.3 at p=0.5p = 0.5. Randomizing the directions therefore produces a strongly connected core containing about 31% of the network, starting from less than half a percent.

Figure 4. Creation of strong connectivity in the S. cerevisiae transcriptional network under edge-reversal noise. Symbols show the mean largest-SCC fraction on the fixed empirical network over 300 reversal realizations. The solid and dashed lines connect the reported sampled predictions of the pairing-aware two-type and degree-only configuration-model baselines, respectively; the connecting segments are guides to the eye. Vertical lines mark their predicted thresholds pc≃0.01648p_c \simeq0.01648 and pcdeg≃0.02835p_c^{\mathrm{deg}} \simeq0.02835. The inset resolves the small-pp region. The error bar at p=1/2p = 1/2 is the reported standard error; uncertainties at the other displayed points were not retained in the available numerical summary.

The pairing-aware baseline predicts SGSCC(0.2)≈0.2S_{\mathrm{GSCC}}(0.2) \approx0.2 and SGSCC(1/2)≈0.3S_{\mathrm{GSCC}}(1/2) \approx0.3, close to the corresponding empirical values. The degree-only reconstruction gives 0.12571 and 0.24740, respectively. Retaining the distinction between original and reversed arrivals therefore improves the description of both the predicted creation threshold and the upper part of the response curve. Agreement is less close at intermediate noise: at p=0.05p = 0.05 and p=0.1p = 0.1, the two-type baseline gives 0.04399 and 0.11008, respectively, slightly larger than the empirical values.

Gene-regulatory networks provide a natural setting for this type of directionality test because their interpretation depends strongly on which genes regulate which others, and directed loops can be sensitive to reversal of even a small fraction of edges [11]. Uniform reversal probability remains a deliberately simple perturbation: real uncertainty in regulatory directions may be heterogeneous, correlated, or absent for particular interaction types. Finally, changes in SCC structure should not by themselves be interpreted as evidence for changes in oscillatory behavior, dynamical stability, regulatory strength, or biological function.

Destruction of strong connectivity in the San Diego freeway network

A complementary empirical example is provided by the San Diego freeway-and-ramp subnetwork [23, 24]. We use the simplified directed multigraph from [25]. We retain edges whose highway classifications consist exclusively of motorway and/or motorway_link, together with all their incident vertices. Original edge directions, parallel edges, and reciprocal arcs are retained; self-loops are excluded. No restriction to the largest connected component is made. This construction selects a road class within the supplied city boundary, rather than the complete urban street network.

The resulting graph contains N=1608N = 1608, E=1932E = 1932, and its largest SCC initially contains 668 vertices, giving SGSCC(0)=668/1608≃0.41542S_{\mathrm{GSCC}}(0) = 668/1608 \simeq0.41542. Its degree moments are

μ=1.201493,Fio=1.476990,Fi=0.730100,Fo=0.696517.(52)\begin{aligned} \mu&= 1.201493, & F_{io} &= 1.476990, \\ F_i &= 0.730100, & F_o &= 0.696517. \tag*{(52)} \end{aligned}

Substitution into Eq. (24) yields

Λ(0)=1.22930>1>Λ(1/2)=0.91141.(53)\Lambda(0) = 1.22930 > 1 > \Lambda(1/2) = 0.91141. \tag*{(53)}

The empirical degree sequence therefore satisfies the destruction criterion, complementing the creation example above. The pairing-aware configuration-model branching factor crosses one at pc≃0.27165p_c \simeq0.27165. This value is the threshold of the configuration-model baseline, not an independently measured critical point of the finite road graph.

For each of 300 independent realizations, we assign independent uniform random variates to the labelled edges and reverse an edge whenever its variate is below pp. Figure 5 shows the resulting mean largest-SCC fraction. It decreases to 0.17157 at p=0.05p = 0.05, 0.03975 at p=0.1p = 0.1, and

Figure 5. Destruction of strong connectivity in the San Diego freeway-and-ramp subnetwork. Mean largest-SCC fraction on the fixed empirical graph over 300 independent reversal realizations; error bars indicate one standard error and connecting segments are guides to the eye.

0.00817 at p=0.2p = 0.2. At fair random orientation,

SGSCC(1/2)=0.00573±0.00013,(54)S_{\mathrm{GSCC}}(1/2) = 0.00573 \pm0.00013, \tag*{(54)}

where the uncertainty is the standard error across realizations. Thus an initial strongly connected core containing about 42% of the vertices is reduced to a largest SCC containing about nine vertices on average.

The endpoint criterion and the empirical reversal response agree on destruction, but the configuration-model threshold does not accurately locate the observed decline: the empirical largest SCC is already small well below pcp_c. Spatial organization and correlations beyond the single-vertex degree distribution are not represented by this baseline. The finite-network experiment demonstrates loss of a large strongly connected core, rather than a finite-size scaling verification of a critical point. Reversal here is a topological sensitivity test; it does not model traffic capacities, congestion, travel times, or turn restrictions.

Discussion

Independent edge reversal changes the directions of connections while preserving which vertices they join. We obtain an exact description of how this process changes the incoming and outgoing degrees of each vertex while leaving its total degree unchanged. Repeated reversal gradually erases the initial directional organization, making each edge equally likely to point either way. These local changes alter the directed paths through the network and can therefore reshape its large-scale connectivity. Understanding this global response requires keeping track of how the connections were originally arranged. Networks with the same incoming and outgoing degree distributions can respond differently because reversal preserves the original connections. Our theory captures this information by distinguishing paths that arrive along retained edges from those that arrive along reversed edges. This distinction leads to explicit conditions under which reversal creates or destroys a giant strongly connected component.

The synthetic examples show why this distinction matters. Reversal can create strong connectivity in an initially acyclic source–sink network or destroy it in an initially balanced directed ensemble. In the asymmetric example, the transformed mixed moment increases while the pairing-aware branching factor decreases. A degree-only reconstruction consequently predicts a supercritical network even where the pairing-preserving ensemble is subcritical. The transformed degree statistics therefore need not identify even the correct percolation phase.

The empirical examples illustrate both the usefulness and the limits of the theory. In the S. cerevisiae regulatory network, the degree moments satisfy the creation criterion, and reversal expands the largest SCC from approximately 0.435% to 30.6% of the vertices. The pairing-aware prediction closely describes the response at larger reversal probabilities, whereas the degree-only reconstruction underestimates the resulting core. In the San Diego freeway-and-ramp subnetwork, the moments instead satisfy Λ(0)>1>Λ(1/2)\Lambda(0) > 1 > \Lambda(1/2), and the largest SCC decreases from approximately 41.5% to 0.573% of the vertices. The endpoint criterion agrees with the observed destruction, although the empirical decline occurs substantially earlier than the predicted configuration-model threshold.

The scope of these results depends on the level of description. The degree transformation applies to arbitrary directed networks, whereas the percolation predictions rely on the locally tree-like configuration-model ensemble. Geometry, clustering, reciprocity, and correlations between adjacent vertices can therefore produce departures from the predicted response. A small nonzero largest SCC in a finite graph also remains compatible with the absence of an extensive component in the asymptotic theory. The empirical examples demonstrate creation and destruction of large strongly connected cores, but do not establish the predicted critical points through finite-size scaling.

Directional uncertainty provides a further motivation for this analysis. In regulatory networks inferred from gene-expression data, a statistical association may be easier to establish than which gene regulates the other. In causal networks inferred from observational data, distinct edge orientations can be compatible with the same observed dependencies. Brain networks reconstructed from diffusion MRI present a related limitation: the measurements do not distinguish afferent from efferent pathways and therefore generally yield undirected connections. These settings motivate testing how connectivity conclusions depend on assumed orientations. Independent reversal provides a simple reference perturbation, although realistic uncertainty may be heterogeneous or correlated, and additional constraints, such as acyclicity in causal models, require a different orientation-sampling procedure. Our empirical experiments test directional sensitivity rather than estimate errors in the recorded edge directions.

Edge reversal provides a controlled probe of how strongly mutual reachability depends on direction when the underlying connections remain fixed. The pairing-aware theory supplies an explicit baseline for this experiment: it identifies when orientation changes alone can create or destroy extensive strong connectivity, while departures from its predictions reveal the need to account for network structure beyond the original degree distribution.

More broadly, these results show that the same set of connections can support markedly different patterns of mutual accessibility depending on its orientation. Directional disorder can either enable or suppress large-scale connectivity, so randomizing directions need not simply degrade an existing network. This dual role makes directionality an independent dimension of network organization and motivates studying orientation changes alongside the addition, removal, or rewiring of connections.

Data and code

The empirical network data were obtained from publicly available sources: SNAP for the S. cerevisiae transcriptional network [21, 22], and the OpenStreetMap-derived collection distributed through Netzschleuder for the San Diego network [23, 24, 25]. All data generated for the analyses and the code used for network preprocessing, numerical simulations, analytical verification, and figure generation are available from the authors upon request.

Acknowledgments

The authors acknowledge support from Grant No. PID2022-137505NB-C22 funded by MCIN/AEI/10.13039/501100011033 and by ERDF/EU and Grant No. PID2025-169261NB-C21 funded by MCIU/AEI/10.13039/501100011033.

Giant-component equations

We derive the sizes of the giant directed components using the finite-component generating-function approach of Ref. [5]. We consider the sparse, locally tree-like configuration-model regime described in the main text, with original joint degree distribution P0(ki,ko)P_0(k_i,k_o). Each labelled edge has a single direction and is independently reversed with probability pp, while its endpoints remain fixed. There are therefore no undirected or bidirectional edges in the branching description.

The configuration-model assumption applies to the original network. Its incoming and outgoing stubs are matched uniformly at random, so the original transition probabilities are

Po(0)(k′∣k)=ki′P0(k′)μ,Pi(0)(k′∣k)=ko′P0(k′)μ.(55)P_o^{(0)}(\mathbf{k}' \mid\mathbf{k}) = \frac{k_i'P_0(\mathbf{k}')}{\mu}, \qquad P_i^{(0)}(\mathbf{k}' \mid\mathbf{k}) = \frac{k_o'P_0(\mathbf{k}')}{\mu}. \tag*{(55)}

where k=(ki,ko)\mathbf{k}=(k_i,k_o) denotes the original degrees and μ=⟨ki⟩0=⟨ko⟩0\mu=\langle k_i\rangle_0=\langle k_o\rangle_0. Correlations between the in- and out-degree of the same vertex are allowed. After reversal, we retain the distinction between edges that kept their direction and edges that reversed, since these two types sample different original stub distributions.

Finite-component distributions

Let Go(so∣k)G_o(s_o\mid\mathbf{k}) denote the probability that a vertex with original degrees k\mathbf{k} has a finite out-component containing sos_o vertices, including the vertex itself. Similarly, Gi(si∣k)G_i(s_i\mid\mathbf{k}) is the probability that its finite in-component contains sis_i vertices. We also define G(si,so∣k)G(s_i,s_o\mid\mathbf{k}) as the probability that both components are finite and have sizes sis_i and sos_o, respectively. Their generating functions are

G^o(zo∣k)=∑so≥1Go(so∣k)zoso,\widehat{G}_o(z_o\mid\mathbf{k})=\sum_{s_o\geq1}G_o(s_o\mid\mathbf{k})z_o^{s_o},
G^i(zi∣k)=∑si≥1Gi(si∣k)zisi,\widehat{G}_i(z_i\mid\mathbf{k})=\sum_{s_i\geq1}G_i(s_i\mid\mathbf{k})z_i^{s_i},
G^(zi,zo∣k)=∑si,so≥1G(si,so∣k)zisizoso.(56)\widehat{G}(z_i,z_o\mid\mathbf{k})=\sum_{s_i,s_o\geq1}G(s_i,s_o\mid\mathbf{k})z_i^{s_i}z_o^{s_o}. \tag*{(56)}

The corresponding unconditional generating functions G^o(zo)\widehat{G}_o(z_o), G^i(zi)\widehat{G}_i(z_i), and G^(zi,zo)\widehat{G}(z_i,z_o) are obtained by averaging over P0(k)P_0(\mathbf{k}). All distributions include the average over the independent edge reversals.

The sums run only over finite component sizes. Their total probability can therefore be smaller than one above the percolation threshold. In particular, G^o(1)\widehat{G}_o(1) is the probability that the out-component is finite, whereas G^(1,1)\widehat{G}(1,1) is the probability that both components are finite. Consequently, G^(1,z)\widehat{G}(1,z) is generally different from G^o(z)\widehat{G}_o(z) above the threshold. Values of the generating functions at unity are understood as limits from below.

With the convention that GIN and GOUT both include the GSCC, their relative sizes are

SGIN=1−G^o(1),SGOUT=1−G^i(1).(57)S_{\mathrm{GIN}}=1-\widehat{G}_o(1),\qquad S_{\mathrm{GOUT}}=1-\widehat{G}_i(1). \tag*{(57)}

A vertex belongs to the GIN when its out-component is extensive, and to the GOUT when its in-component is extensive. Membership in the GSCC requires both conditions. Inclusion–exclusion therefore gives

SGSCC=1−G^o(1)−G^i(1)+G^(1,1).(58)S_{\mathrm{GSCC}}=1-\widehat{G}_o(1)-\widehat{G}_i(1)+\widehat{G}(1,1). \tag*{(58)}

Branch generating functions

We label retained edges as type 1 and reversed edges as type 2. Let go(α)(so)g_o^{(\alpha)}(s_o) be the probability that following an edge of type α\alpha in its current direction reaches a finite forward branch containing sos_o vertices. The count includes the vertex reached by that edge and excludes the vertex from which the traversal started. We define gi(α)(si)g_i^{(\alpha)}(s_i) analogously for backward exploration, in which the edge is traversed against its current direction. Because the original stub matching is uniform, these functions do not depend on the original degrees of the vertex from which the edge is followed. They do depend on the edge type, which determines the original stub through which the next vertex is reached.

These two functions are needed to compute Go(so∣k)G_o(s_o\mid\mathbf{k}) and Gi(si∣k)G_i(s_i\mid\mathbf{k}). Consider, for instance, the outgoing cluster size distribution of nodes with degree k\mathbf{k}, Go(so∣k)G_o(s_o\mid\mathbf{k}). This can be written as

G_o(s_o\mid\mathbf{k})= \sum_{k_i'=0}^{k_i}\sum_{k_o'=0}^{k_o} \binom{k_i}{k_i'}p^{k_i'}q^{k_i-k_i'} \binom{k_o}{k_o'}q^{k_o'}p^{k_o-k_o'} \sum_{\{s_n,s_m\}_{n=1}^{k_i',\,m=1}^{k_o'}} \prod_{n=1}^{k_i'}g_o^{(2)}(s_n) \prod_{m=1}^{k_o'}g_o^{(1)}(s_m) \delta_{s_o,1+\sum_{n=1}^{k_i'}s_n+\sum_{m=1}^{k_o'}s_m}. \tag*{(59)}

From (59), we obtain its generating function as

G^o(zo∣k)=zo(q+pg^o(2)(zo))ki(p+qg^o(1)(zo))ko(60)\widehat{G}_o(z_o\mid\mathbf{k}) =z_o\left(q+p\widehat{g}_o^{(2)}(z_o)\right)^{k_i} \left(p+q\widehat{g}_o^{(1)}(z_o)\right)^{k_o} \tag*{(60)}

and after averaging over P0(ki,ko)P_0(k_i,k_o), we obtain

G^o(zo)=zoP^0(xf(zo),yf(zo)),(61)\widehat{G}_o(z_o)=z_o\widehat{P}_0\left(x_f(z_o),y_f(z_o)\right), \tag*{(61)}

where we have defined the shorthand notation

xf(zo)≡q+pg^o(2)(zo)andyf(zo)≡p+qg^o(1)(zo).(62)x_f(z_o)\equiv q+p\widehat{g}_o^{(2)}(z_o) \qquad\text{and}\qquad y_f(z_o)\equiv p+q\widehat{g}_o^{(1)}(z_o). \tag*{(62)}

Following the same argument used to derive Eqs. (A5) and (A6), we can obtain a closed system of equations for g^o(1)(zo)\widehat{g}_o^{(1)}(z_o) and g^o(2)(zo)\widehat{g}_o^{(2)}(z_o). Arrival through a retained edge reaches an original incoming stub, so the original degrees of the vertex reached are distributed according to kiP0(k)/μk_iP_0(\mathbf{k})/\mu. The arrival edge has already been used, leaving ki−1k_i-1 original incoming edges and kok_o original outgoing edges. Thus,

g^o(1)(zo)=zoμ∑ki≥1kiP0(k)(q+pg^o(2)(zo))ki−1(p+qg^o(1)(zo))ko=zoμP^0,x(xf(zo),yf(zo)).\widehat{g}_o^{(1)}(z_o)=\frac{z_o}{\mu}\sum_{k_i\geq1}k_iP_0(\mathbf{k})\left(q+p\widehat{g}_o^{(2)}(z_o)\right)^{k_i-1}\left(p+q\widehat{g}_o^{(1)}(z_o)\right)^{k_o}=\frac{z_o}{\mu}\widehat{P}_{0,x}\left(x_f(z_o),y_f(z_o)\right).

Here, P^0,x\widehat{P}_{0,x} denotes the derivative of P^0\widehat{P}_0 with respect to its first argument whereas the factor zoz_o takes into account the vertex reached. Arrival through a reversed edge instead reaches an original outgoing stub. Its degree distribution is koP0(k)/μk_oP_0(\mathbf{k})/\mu, and the remaining original degrees are kik_i and ko−1k_o-1. Therefore,

g^o(2)(zo)=zoμ∑ko≥1koP0(k)(q+pg^o(2)(zo))ki(p+qg^o(1)(zo))ko−1=zoμP^0,y(xf(zo),yf(zo)).\widehat{g}_o^{(2)}(z_o)=\frac{z_o}{\mu}\sum_{k_o\geq1}k_oP_0(\mathbf{k})\left(q+p\widehat{g}_o^{(2)}(z_o)\right)^{k_i}\left(p+q\widehat{g}_o^{(1)}(z_o)\right)^{k_o-1}=\frac{z_o}{\mu}\widehat{P}_{0,y}\left(x_f(z_o),y_f(z_o)\right).

where P^0,y\widehat{P}_{0,y} is the derivative with respect to the second argument. For backward exploration, an original incoming edge can be traversed against its current direction if it is retained, whereas an original outgoing edge can be traversed in this way if it is reversed. Repeating the same analysis above in this case leads to

g^i(1)(zi)=ziμP^0,y(xb(zi),yb(zi)),g^i(2)(zi)=ziμP^0,x(xb(zi),yb(zi)).(63)\begin{aligned} \widehat{g}_i^{(1)}(z_i)&=\frac{z_i}{\mu}\widehat{P}_{0,y}\left(x_b(z_i),y_b(z_i)\right),\\ \widehat{g}_i^{(2)}(z_i)&=\frac{z_i}{\mu}\widehat{P}_{0,x}\left(x_b(z_i),y_b(z_i)\right). \tag*{(63)} \end{aligned}

where we define

xb(zi)≡p+qg^i(1)(zi)andyb(zi)≡q+pg^i(2)(zi).(64)x_b(z_i)\equiv p+q\widehat{g}_i^{(1)}(z_i)\quad\text{and}\quad y_b(z_i)\equiv q+p\widehat{g}_i^{(2)}(z_i). \tag*{(64)}

Finally,

G^i(zi∣k)=zi(p+qg^i(1)(zi))ki(q+pg^i(2)(zi))ko(65)\widehat{G}_i(z_i\mid\mathbf{k})=z_i\left(p+q\widehat{g}_i^{(1)}(z_i)\right)^{k_i}\left(q+p\widehat{g}_i^{(2)}(z_i)\right)^{k_o} \tag*{(65)}

and after averaging over P0(ki,ko)P_0(k_i,k_o), we obtain

G^i(zi)=ziP^0(xb(zi),yb(zi)).(66)\widehat{G}_i(z_i)=z_i\widehat{P}_0\left(x_b(z_i),y_b(z_i)\right). \tag*{(66)}

Extinction probabilities and the giant in- and out-components

We now evaluate the branch generating functions at unity and define

u=g^o(1)(1),v=g^o(2)(1),uˉ=g^i(1)(1),vˉ=g^i(2)(1).(67)u=\widehat{g}_o^{(1)}(1),\qquad v=\widehat{g}_o^{(2)}(1),\qquad\bar{u}=\widehat{g}_i^{(1)}(1),\qquad\bar{v}=\widehat{g}_i^{(2)}(1). \tag*{(67)}

These quantities are the probabilities that the corresponding forward or backward branches are finite.

Writing xf=xf(1)x_f=x_f(1) and yf=yf(1)y_f=y_f(1), the forward equations become

xf=q+pv,yf=p+qu,x_f=q+pv,\qquad y_f=p+qu,
u=P^0,x(xf,yf)μ,v=P^0,y(xf,yf)μ.(68)u=\frac{\widehat{P}_{0,x}(x_f,y_f)}{\mu},\qquad v=\frac{\widehat{P}_{0,y}(x_f,y_f)}{\mu}. \tag*{(68)}

Similarly, with xb=xb(1)x_b=x_b(1) and yb=yb(1)y_b=y_b(1), the backward equations are

xb=p+quˉ,yb=q+pvˉ,x_b=p+q\bar{u},\qquad y_b=q+p\bar{v},
uˉ=P^0,y(xb,yb)μ,vˉ=P^0,x(xb,yb)μ.(69)\bar{u}=\frac{\widehat{P}_{0,y}(x_b,y_b)}{\mu},\qquad\bar{v}=\frac{\widehat{P}_{0,x}(x_b,y_b)}{\mu}. \tag*{(69)}

The physical solution is the componentwise smallest fixed point in [0,1]2[0,1]^2 for each pair of equations. It can be obtained by iteration starting from zero. Substituting the root generating functions into Eq. (57) gives

SGIN=1−P^0(xf,yf),SGOUT=1−P^0(xb,yb).(70)S_{\mathrm{GIN}}=1-\widehat{P}_0(x_f,y_f),\qquad S_{\mathrm{GOUT}}=1-\widehat{P}_0(x_b,y_b). \tag*{(70)}

Following Ref. [5], the branching threshold can also be recovered by linearizing the fixed-point equations around the trivial solution. The Jacobian of the forward equations at (u,v)=(1,1)(u,v)=(1,1) is

Mf=1μ(qFiopFiqFopFio)=M(p),(71)M_f=\frac{1}{\mu}\begin{pmatrix}qF_{io} & pF_i \\ qF_o & pF_{io}\end{pmatrix}=M(p), \tag*{(71)}

which coincides with Eq. (23). The backward equations give

Mb=1μ(qFiopFoqFipFio).(72)M_b=\frac{1}{\mu}\begin{pmatrix}qF_{io} & pF_o \\ qF_i & pF_{io}\end{pmatrix}. \tag*{(72)}

The two matrices have the same trace and determinant and therefore the same eigenvalues. This recovers the common forward and backward branching threshold derived in the main text.

Joint generating function and the strongly connected component

To compute the GSCC, we need the joint probability that both explorations are finite. Since every edge is purely directed, an incident edge can initiate only one of the two explorations for any realized orientation. The orientation of that edge nevertheless enters both component-size calculations and must be averaged consistently.

To make this explicit, consider a root with original degrees (ki,ko)(k_i,k_o) and use the variables introduced in Eq. (1): nn is the number of original incoming edges that are retained, and mm is the number of original outgoing edges that are reversed. They are independent and satisfy

n∼Binomial⁡(ki,q),m∼Binomial⁡(ko,p).(73)n \sim\operatorname{Binomial}(k_i,q), \qquad m \sim\operatorname{Binomial}(k_o,p). \tag*{(73)}

The root then has ko−mk_o-m retained outgoing edges and ki−nk_i-n reversed outgoing edges, together with nn retained incoming edges and mm reversed incoming edges.

Conditional on these counts, the forward and backward explorations use disjoint incident edges. Independence of their branches in the locally tree-like limit therefore gives

G^(zi,zo∣k,n,m)=zizo[g^o(1)(zo)]ko−m[g^o(2)(zo)]ki−n[g^i(1)(zi)]n[g^i(2)(zi)]m.(74)\widehat{G}(z_i,z_o \mid\mathbf{k},n,m) = z_i z_o \left[\widehat{g}_o^{(1)}(z_o)\right]^{k_o-m} \left[\widehat{g}_o^{(2)}(z_o)\right]^{k_i-n} \left[\widehat{g}_i^{(1)}(z_i)\right]^n \left[\widehat{g}_i^{(2)}(z_i)\right]^m. \tag*{(74)}

The factor zizoz_i z_o counts the root once in each component.

Averaging over nn assigns each original incoming edge the joint generating factor

qg^i(1)(zi)+pg^o(2)(zo).(75)q\widehat{g}_i^{(1)}(z_i)+p\widehat{g}_o^{(2)}(z_o). \tag*{(75)}

If that edge is retained, it contributes to the backward exploration; if it is reversed, it contributes to the forward exploration. Similarly, averaging over mm assigns each original outgoing edge the factor

qg^o(1)(zo)+pg^i(2)(zi).(76)q\widehat{g}_o^{(1)}(z_o)+p\widehat{g}_i^{(2)}(z_i). \tag*{(76)}

Taking the product of these factors over the original incident edges and then averaging over P0(k)P_0(\mathbf{k}) yields

G^(zi,zo)=zizoP^0(qg^i(1)(zi)+pg^o(2)(zo),qg^o(1)(zo)+pg^i(2)(zi)).(77)\widehat{G}(z_i,z_o) = z_i z_o \widehat{P}_0\left( q\widehat{g}_i^{(1)}(z_i)+p\widehat{g}_o^{(2)}(z_o), q\widehat{g}_o^{(1)}(z_o)+p\widehat{g}_i^{(2)}(z_i) \right). \tag*{(77)}

Thus, the factorization into forward and backward contributions holds when the retained and reversed incident-edge counts are specified. It generally does not survive the average over those counts at fixed original degrees. The reason is that the same orientation variable determines whether an original edge contributes to the forward or to the backward exploration. This dependence is fully accounted for by the sums in Eqs. (75) and (76).

At zo=zi=1z_o=z_i=1, Eq. (77) becomes

G^(1,1)=P^0(quˉ+pv,qu+pvˉ).(78)\widehat{G}(1,1)=\widehat{P}_0(q\bar{u}+pv,qu+p\bar{v}). \tag*{(78)}

Finally, substituting this expression and the two marginal generating functions into Eq. (58) gives

SGSCC=1−P^0(xf,yf)−P^0(xb,yb)+P^0(quˉ+pv,qu+pvˉ).(79)S_{\mathrm{GSCC}}=1-\widehat{P}_0(x_f,y_f)-\widehat{P}_0(x_b,y_b) +\widehat{P}_0(q\bar{u}+pv,qu+p\bar{v}). \tag*{(79)}

As a consistency check, at p=0p=0 only retained edges are present. The relevant extinction probabilities then satisfy

u=P^0,x(1,u)μ,uˉ=P^0,y(uˉ,1)μ.(80)u=\frac{\widehat{P}_{0,x}(1,u)}{\mu}, \qquad \bar{u}=\frac{\widehat{P}_{0,y}(\bar{u},1)}{\mu}. \tag*{(80)}

and Eq. (79) reduces to

SGSCC(0)=1−P^0(1,u)−P^0(uˉ,1)+P^0(uˉ,u),(81)S_{\mathrm{GSCC}}(0)=1-\widehat{P}_0(1,u)-\widehat{P}_0(\bar{u},1) +\widehat{P}_0(\bar{u},u), \tag*{(81)}

recovering the result for the original directed configuration model.

References

  1. [1]M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Random graphs with arbitrary degree distributions and their applications,” Phys. Rev. E 64, 026118 (2001). doi: 10.1103/PhysRevE.64.026118.DOI
  2. [2]C. Cooper and A. Frieze, “The size of the largest strongly connected component of a random digraph with a given degree sequence,” Comb. Probab. Comput. 13, 319–337DOI
  3. [3]S. Donderwinkel and Z. Xie, “Universality for the directed configuration model: Metric space convergence of the strongly connected components at criticality,” Electron. J. Probab. 29, 87 (2024). doi: 10.1214/24-EJP1131.DOI
  4. [4]B. Söderberg, “Properties of random graphs with hidden color,” Phys. Rev. E 68, 026107 (2003). doi: 10.1103/ PhysRev E 68 026107pubmed.ncbi.nlm.nih.gov/14525049
  5. [5]M. Boguñá and M. Á. Serrano, “Generalized percolation in random directed networks,” Phys. Rev. E 72, 016106 (2005). doi: 10.1103/PhysRevE.72.016106.DOI
  6. [6]A. Allard, L. Hébert-Dufresne, J.-G. Young, and L. J. Dubé, “General and exact approach to percolation on random graphs,” Phys. Rev. E 92, 062807 (2015). doi: 10.1103/PhysRevE.92.062807.DOI
  7. [7]C. McDiarmid, “General percolation and random graphs,” Adv. Appl. Probab. 13, 40–60 (1981). doi: 10.2307/1426466.DOI
  8. [8]S. Linusson, “A note on correlations in randomly oriented graphs,” arXiv:0905.2881 (2009).arxiv.org/abs/0905.2881
  9. [9]B. Narayanan, “Connections in randomly oriented graphs,” Comb. Probab. Comput. 27, 667–671 (2018). doi: 10.1017/S0963548316000341.
  10. [10]S. E. Ahnert and T. M. A. Fink, “Clustering signatures classify directed networks,” Phys. Rev. E 78, 036112 (2008). doi: 10.1103/PhysRevE.78.036112.DOI
  11. [11]R. Itzhack, L. Tsaban, and Y. Louzoun, “Long loops of information flow in genetic networks highlight an inherent directionality,” Systems Biomedicine 1, 47–54 (2013). doi: 10.4161/sysb.24471.DOI
  12. [12]Y. Rosen and Y. Louzoun, “Directionality of real world networks as predicted by path length in directed and undirected graphs,” Physica A 401, 118–129 (2014). doi: 10.1016/j.physa.2014.01.005.DOI
  13. [13]V. Domínguez-García, S. Pigolotti, and M. A. Muñoz, “Inherent directionality explains the lack of feedback loops in empirical networks,” Sci. Rep. 4, 7497 (2014). doi: 10.1038/srep07497.
  14. [14]V. Verbavatz and M. Barthelemy, “From one-way streets to percolation on random mixed graphs,” Phys. Rev. E 103, 042313 (2021). doi: 10.1103/PhysRevE.103.042313.DOI
  15. [15]N. Rodgers, P. Tiño, and S. Johnson, “Strong connectivity in real directed networks,” Proc. Natl. Acad. Sci. USA 120, e2215752120 (2023). doi: 10.1073/pnas.2215752120.DOI
  16. [16]A. Allard, M. Á. Serrano, and M. Boguñá, “Geometric description of clustering in directed networks,” Nat. Phys. 20, 150–156 (2024). doi: 10.1038/s41567-023-02246-6.DOI
  17. [17]M. Boguñá and M. Á. Serrano, “Statistical Mechanics of Directed Networks,” Entropy 27, 86 (2025). doi: 10.3390/e27010086.DOI
  18. [19]J. Kim and T. Phillips, “On the largest strongly connected component of randomly oriented divisor graphs,” arXiv:2604.05176v2 (2026), preprint.arxiv.org/abs/2604.05176
  19. [21]R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: simple building blocks of complex networks,” Science 298, 824–827 (2002). doi: 10.1126/science.298.5594.824.DOI
  20. [22]Stanford Network Analysis Project, “S. cerevisiae transcriptional regulation network,” https://snap.stanford.edu/data/S-cerevisiae.html.
  21. [23]G. Boeing, “Street Network Models and Measures for Every U.S. City, County, Urbanized Area, Census Tract, and Zillow-Defined Neighborhood,” Urban Sci. 3, 28 (2019). doi: 10.3390/urbansci3010028.DOI
  22. [24]G. Boeing, “Street Network Models and Measures for U.S. Cities,” Harvard Dataverse. doi: 10.7910/DVN/CUWWWYJ.
  23. [25]Netzschleuder network catalogue, OpenStreetMap collection, San Diego city network (06-CA-cities_networks:066000_San_Diego), https://networks.skewed.de/net/openstreetmap.

Paper details

vlnc:W_btvctkyx
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents