{'fraction_non_alphanumeric': 0.04072398190045249, 'fraction_numerical': 0.011877828054298642, 'mean_word_length': 4.325468540829987, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Accuracy of Mean-Field Theory for Dynamics on Real-World Networks

Mean-field analysis is an important tool for understanding dynamics on complex networks. However, surprisingly little attention has been paid to the question of whether mean-field predictions are accurate, and this is particularly true for real-world networks with clustering and modular structure. In this paper, we compare mean-field predictions to numerical simulation results for dynamical processes running on 21 real-world networks and demonstrate that the accuracy of the theory depends not only on the mean degree of the networks but also on the mean first-neighbor degree. We show that mean-field theory can give (unexpectedly) accurate results for certain dynamics on disassortative real-world networks even when the mean degree is as low as 4.


I. INTRODUCTION
Mean-field theories are the most common form of analytical approximation employed when studying dynamics on complex networks [1]. Typically, mean-field theories are derived under several assumptions: (i) Absence of local clustering. When considering possible changes to the state of a node B 1 , it is assumed that the states of the neighbors of node B 1 are independent of each other. However, this assumption that the network is "locally tree-like" does not hold if the neighbors of B 1 are also linked to each otheri.e., if the network is clustered (exhibits transitivity).
(ii) Absence of modularity. It is also usually assumed that all nodes of the same degree k are welldescribed by the mean k-class state-i.e. by the average over all nodes of degree k. However, this might not be true if the network is modular, so that the states of degree-k nodes are differently distributed in different communities.
(iii) Absence of dynamical correlations. Finally, it is assumed that the states of each node B 1 and those of its neighbors can be treated as independent when updating the state of node B 1 .
Importantly, the neglect of dynamical correlations (as distinct from structural correlations such as degreedegree correlations [2,3]) between neighbors in assumption (iii) can be addressed in improved theories that incorporate information on the joint distribution of node states at the ends of a random edge in the network [4,5] (cf. theories that only specify the structures at the ends of a random edge). The improved theories are often called pair-approximations (PA) (examples are [6,7]), and these are inevitably more complicated to derive and study than mean-field (MF) theories, so we mostly restrict our attention in the present paper to the more common MF-theory situation [72].
The distinctions between assumptions (i)-(iii) can be clarified by considering the theoretical approaches beyond the MF level that have been developed in certain cases to deal with violations of (i), (ii), and (iii). The impact of non-zero clustering on percolation problems on a network has been examined in Refs. [8][9][10][11][12]. The analytical methods used in those papers explicitly account for the dependence of neighbors' states on each otheri.e., for the violation of MF assumption (i). The role of community or modular structures [see assumption (ii)] on percolation requires a different extension of analytical methods [13,14]. As noted above, PA theories can account for dynamical correlations more accurately than MF theory, thereby improving on assumption (iii).
The MF assumptions enumerated above are clearly violated for real-world networks, which are often highly clustered and modular [4,15]. It is therefore rather surprising that MF theory often provides a reasonably good approximation to the actual dynamics on many real-world networks. This fact has been noted by several authors [1,5,[16][17][18], but to our knowledge no comprehensive explanation for this phenomenon has ever been developed. In studying this phenomenon, we focus on a specific question of obvious practical interest: Given a real-world network and a dynamical process running on it, is it possible to predict whether or not MF theory will  [19] and (b) the US power grid network [21] as a function of the coupling K. The order parameter r2 is defined in Eq. (2). The MF theory of [22] is given by Eq. (3).
provide a good approximation to the actual dynamics on this network? In this paper, we test multiple well-studied dynamical processes on 21 undirected, unweighted realworld networks. We enumerate and summarize various properties of the networks in Table I. These networks are characterized by a range of values for several standard network diagnostics, which is important for this study. We show that MF theory typically works well provided d, the mean degree of first neighbors of a random node, is sufficiently large. In contrast, we demonstrate that the mean degree z of the network is not necessarily a good indicator of MF accuracy.
The remainder of this paper is organized as follows. In Section II, we introduce the dynamical processes that we consider and compare numerical results with MF theory for sample real-world networks. In Section III, we discuss the implications of our results and propose an explanatory hypothesis. In Section IV, we compare our results with earlier work in this area. We conclude in Section V.

II. EXAMPLES
We begin by showing examples for which MF theory gives accurate results for dynamics on real-world networks, contrasting with examples in which MF theory performs poorly.

A. Kuramoto Phase Oscillator Model
In Fig. 1, we show the results of running the Kuramoto phase oscillator model [23] on the Facebook Oklahoma network [19] and on the US Power Grid network [21]. Each node corresponds to an oscillator with an intrinsic frequency drawn from a unit-variance Gaussian distribu-tion. The phase θ j (t) of the oscillator at node j obeys the differential equation where ω j is the intrinsic frequency of node j, N is the number of nodes, and A is the adjacency matrix of the network. The coupling to network neighbors is measured by the parameter K, and global synchrony of the oscillators is expected to emerge for sufficiently large K [24]. Synchrony is quantified using the order parameter [22] where k j is the degree of node j and i = √ −1. The MF theory of Ref. [22] (see also [25]) yields the following implicit equation for r 2 : where I n is the modified Bessel function of the first kind, p k is the degree distribution of the network, and z = k ≡ kp k is the mean degree. The agreement in Fig. 1 between theory and simulation is very good for the Facebook network but very poor for the Power Grid. (See Fig. 4 for additional examples.) The results of Fig. 1 are perhaps explained in part by noting that the mean degree z of the Facebook network is 102, whereas z ≈ 2.67 for the Power Grid (see Table I). It is arguable that nodes with many neighbors will experience something closer to a "mean field" than nodes with few neighbors. In particular, it is plausible that low-z networks might be more prone to errors in MF due to neglecting the effects of clustering, modularity, and dynamical correlations. This is attractively simple, but as we show below, this naive explanation does not fully capture certain subtleties of this question.

B. SIS Epidemic Model
In Fig. 2, we compare simulations for the susceptibleinfected-susceptible (SIS) epidemic model [26][27][28] with the corresponding predictions of a well-known MF theory [31,32]. In the MF theory, the fraction i k (t) of degree-k nodes that are infected at time t is given by the solution of the equation  [29] and (b) Electronic Circuit (s838) [30] networks as a function of the spreading rate β. The MF theory is from Refs. [31,32]. Observe that uncorrelated and correlated MF theories are indis- where β is the spreading rate, the recovery rate has been set to unity by choice of timescale, and is the probability that any given neighbor of a degree-k node is infected. In Eq. (5), P (k ′ |k) is the probability that an edge originating at a degree-k node has a degreek ′ node at its other end. Because degree-degree correlations are included, this version of the theory is called a correlated MF theory (cMF). A further simplification of the theory is possible if one assumes that the network is uncorrelated and is thus completely described by its degree distribution p k . In this case, which is termed uncorrelated MF (uMF), P (k ′ |k) in Eq. (5) is replaced by k ′ p k ′ /z and Θ k becomes independent of k. In Fig. 2, we show predictions of both correlated and uncorrelated MF theories for the steady-state endemic infected fraction for the AS Internet network [29] and for the Electronic circuit (s838) network [30]. The MF theory is very accurate for the former, but it performs poorly for the latter. The result for the AS Internet network is particularly surprising in light of the fact that the mean degree of this network is only 4. The aforementioned naive argument that MF theory is accurate for high-degree nodes thus cannot account for the good performance of the theory in this low-z case, where 96% of the nodes in the network have degree 10 or less (see Table I).

C. Voter Model
As a third example, we consider the survival probability of disordered-state trajectories in the voter model  [21] and (b) a synthetic clustered network generated as described briefly in the main text and in detail in Ref. [10] with γ(3, 3) = 1. Both networks contain approximately N = 300 nodes. The theory curves are from Refs. [6,33]. [34] and compare it with the (uncorrelated) MF theory of Ref. [33]. (For rigorous results for the voter model, see Refs. [5,35] and references therein.) At time t = 0, each node is randomly assigned to one of two voter states. In each time step (of size dt = 1/N ), a randomlychosen node is updated by copying the state of one of its randomly-chosen neighbors. On finite networks, the dynamics eventually drive a connected component to complete order, in which all the nodes are in the same state. The survival probability P s (t) is defined as the fraction of realizations that remain in the disordered state at time t. The red dashed curves in Fig. 3 gives the survival probability predicted by the MF theory of Ref. [33]: and the black solid curve gives the results of the pair approximation (PA) theory of Ref. [6]: In Fig. 3(a), we show results for the C. elegans neural network [21] (z ≈ 14.46), for which MF theory is very accurate. In Fig. 3(b), we show results for a synthetic clustered network described in Ref. [10]: Every node in the network has degree 3 and is part of a single 3-clique. Using the notation of Ref. [10], this is called a γ(3, 3) = 1 network. It can alternatively be described in the notation of Ref. [8] as having p 1,1 = 1, as every node is part of one triangle and has one single edge other than those belonging to the triangle. Clustering has a strong effect in this (low-z) network; because of this clustering and dynamical correlations, MF theory is very inaccurate. We can make the clustering negligibly small while keeping the degree distribution unchanged (at p k = δ k,3 ) by randomly rewiring the network to give a random 3-regular graph. However, even after this rewiring, the match to MF theory is poor because dynamical correlations are still neglected. The recent PA theory for the voter model [6] (see also [7]) accounts for the dynamical correlations and hence gives a good match to the survival probability on the rewired network but not on the clustered original network.

III. WHY IS MEAN-FIELD THEORY ACCURATE?
Briefly summarizing our observations thus far, we have seen (i) situations in which high-z networks exhibit good matches to MF theory, but also (ii) some examples in which low-z networks also have accurate MF theories. For clarity, we have discussed only a few examples in detail, but these are representative of behavior observed for different dynamical processes on a variety of real-world networks. In Fig. 4, we show additional examples for each of the three dynamical processes (the Kuramoto, SIS, and voter models) for each of the 6 networks used in Figs. 1-3.

A. Mean-Field Accuracy for the SIS Model
Clearly, the success of MF theories for dynamical systems on networks cannot be explained purely in terms of the mean degree z of the underlying network. Figure 2(a) in particular gives an example in which MF theory works well on a low-z network. To understand this seemingly surprising accuracy, we focus on the SIS model and consider how the state of a node is updated as compared to the assumptions of MF theory. Suppose the state of the degree-k node B 1 is being updated. In both the true dynamics and in MF theory, the updating process depends on the state of the neighbors of B 1 . Let's take node B 2 as a representative neighbor of B 1 and suppose that B 2 has degree k ′ . Under MF assumption (iii), the state of node B 2 is considered to be independent of the state of node B 1 . This is why Eq. (5) involves the term i k ′ , which is the probability that degree-k ′ nodes are in the infected state, without any conditioning on the state of their neighbor B 1 [73].
In reality, however, the states of nodes B 1 and B 2 exhibit dynamical correlations. For example, during an epidemic, an infected node is more likely to have infected neighbors than a susceptible node. Such dynamical correlations can be included explicitly in pair-approximation theories [53][54][55], and their neglect can be a major source of error in MF theories. This suggests an important question: Under what circumstances might the MF assumption of dynamical independence (iii) still give accurate results for the update of node B 1 ? One can argue that if the degree k ′ of node B 2 is sufficiently large, then the state of node B 2 is influenced by many of its neighbors other than node B 1 , so the error in neglecting the particular dynamical correlation between B 2 and B 1 is relatively small for the purpose of updating node B 1 . Conversely, if the degree k ′ of node B 2 is small, then node B 1 has a relatively strong influence on the state of node B 2 , and neglecting dynamical correlations between B 2 and B 1 when updating B 1 will yield large errors. Hence, we expect MF theory to give reasonably accurate updates for node B 1 if its neighbors have sufficiently high degrees. Importantly, this argument relies only on the degree k ′ of the nearestneighbor nodes being high and gives no restriction on the degree k of the updating node itself. (We remark that the use of networks with nearest-neighbor nodes of high degree has also been mentioned in studies of the Kuramoto model on networks [24,25].) In short, we argue that MF theory gives relatively small error for nodes with high-degree neighbors. More specifically, MF theory is likely to be inaccurate if many nodes do not have high-degree neighbors. This can happen, for example, if low-degree nodes are connected preferentially to other low-degree nodes (a sort of "poorclub phenomenon", akin to the rich-club phenomenon of high-degree nodes connecting preferentially to other high-degree nodes [42]). This suggests a simple but effective predictor of MF accuracy: If the mean degree of first-neighbors d = k p k k ′ k ′ P (k ′ |k) is high, then MF theory can be expected to be accurate. As we show below, this rule of thumb works well for SIS dynamics on all of the networks that we have considered.
In Fig. 5 we present results from numerical simulations of SIS dynamics and consider the final, steady-state fraction I of infected nodes (for each network we average over an ensemble of more than several hundred realizations, in each of which 5% of the nodes are randomly chosen to be infected at t = 0). Because the quality of the MF approximation is known to depend on the number of infected nodes [56], we further compare errors for different networks by choosing the spreading rate β in each simulation so that the MF steady-state value I theory equals 0.5. Letting be the relative error between the theoretical predictions of correlated MF theory (4)-(5) and the numerical results, we color each network's symbol in Fig. 5 by the value of E S (see Table I for the error values). The results in Fig. 5 show clearly that situations with low d and low z correspond to inaccurate cMF predictions [see Figs. 1(b), 2(b), and 3(b)] and that the high-d situations (some of which also have small z) all have accurate cMF predictions, supporting our claim that the fidelity of MF theory can be evaluated using d.
In Section IV, we describe an alternative measure for predicting MF accuracy that uses inter-vertex distances [52]. One can also construct other, more complicated measures (e.g., by computing the size of the connected  cluster of low-degree nodes); however, the mean firstneighbor degree d is appealing because it is simple to calculate and understand, and it retains considerable explanatory power. We note that similarly accurate results have been found for real-world networks using MF theory for a discrete-time version of the SIS model [56,57].
B. Isolating the effect of dynamical correlations using synthetic networks We have argued above that the observed accuracy of MF theory on some real-world networks is due to their high d values ameliorating the neglect of dynamical correlations [i.e., MF assumption (iii)]. However, real-world networks typically have high values for clustering coefficients and significant modular structures, so MF theory for such networks violates assumptions (i) and (ii) as well as assumption (iii). It might therefore be argued that the high-d effect seen in Fig. 5 could be due to an improvement in the validity of assumptions (i) and/or (ii), which could in principle have a larger impact than the high-d improvement of assumption (iii). We investigate this by now considering SIS dynamics on synthetic random networks (with N = 10 4 nodes) in which the transitivity and community structure are both negligible. Thus, MF assumptions (i) and (ii) are both valid for these networks, and the error in MF theory can be due only to violations of assumption (iii).
The first family of synthetic networks we use is described in Ref. [58]: Each node is either of low degree k 1 [with probability p k1 = k 2 /(k 1 + k 2 )] or of high degree k 2 [with probability p k2 = k 1 /(k 1 + k 2 )]. In order to create a network with a prescribed degree-degree cor- relation coefficient r, we connect the nodes of each type preferentially to nodes of either the same or of opposite type. We show in Fig. 6 how the aggregate error E S (diamonds) depends on the correlation coefficient r for a specific case with (k 1 , k 2 ) = (3,12). Note that the mean degree z of these networks is fixed (z = 4.8), but the mean first-neighbor degree d decreases as r increases. Figure 6 illustrates that the highest error for the MF theory occurs when d is lowest. This is the fully assortative (r = 1) case in which low-degree nodes link only to other low-degree nodes, creating a low-k connected cluster in which MF theory is inaccurate. At the other extreme, the disassortative (r = −1) case has every low-degree node linked only to high-degree nodes, with a consequent reduction in the error of MF theory (and a high value of d). The trends of the errors in each degree class also support our argument: high-degree neighbors correspond to lower MF error. In Fig. 7, we show further details about the degree-3 nodes. To examine the importance of assumption (ii) we consider (for each value of r) an ensemble of M = 25 realizations of the SIS process on identical copies of the synthetic network. At a fixed (large) time, we record the state-either infected or susceptible-of each node i. Taking the average over the M realizations defines f i , the fraction of realizations in which node i is infected at the chosen time. We now consider the distribution of f i values over the set of nodes i that all share the same degree k, noting that assumption (ii) implies that these f i values should be identical for every node i in a given k-class. Consequently, we plot in Fig. 7, for degree-3 nodes, the mean and standard deviation of the f i values for the same networks as used in Fig. 6. Note the mean value equals I numerical (k = 3), the average infected fraction of degree-3 nodes in simulations. This mean value deviates from the cMF theory prediction i 3 (∞), giving the errors shown by the crosses in Fig. 6. We note that the standard deviation of the f i values does not depend strongly on r (and hence also does not depend strongly on d). Moreover, if all of the f i values for each r value were to be replaced by their mean value-so that the standard deviation for f i was zero, in accord with assumption (ii)-then the errors shown in Fig. 6 would be unaltered. In this sense, the violation of assumption (ii) is not the main source of the high-d effect on the accuracy of MF theory.
To test for the existence of dynamical correlationswhich are neglected under MF theory assumption (iii)in the numerical results, we calculate the fraction φ SI of SI edges (i.e., edges linking a susceptible node and an infected node) in the networks in steady state. We then compare this to the fraction of SI edges that would be obtained if no dynamical correlations were present. This is given by treating as independent the probabilities for nodes at each end of an edge to be in states S and I: where ρ k is the fraction of infected degree-k nodes in the network (hence (1−ρ k ′ ) is the fraction of degree-k ′ nodes that are susceptible). Note that we calculate ρ k from the numerical simulations-we do not use the corresponding MF theory values i k (∞)-so that we are directly testing the validity of assumption (iii) on the numerical data. The relative error of the MF assumption on the SI edge fraction can then be calculated in a similar fashion to Eq. (8): If assumption (iii) were true, there would be no dynamical correlation effects and the fraction of SI edges could be computed directly from the fraction of infected nodes using (9), giving E SI = 0. However, Fig. 8 shows that the error E SI increases as the mean first-neighbor distance decreases, which is similar to the trend of error E S in Fig. 6. This evidence supports our claim that it is MF assumption (iii)-the neglect of dynamical correlationsthat plays a dominant role in determining the accuracy of MF theory on high-d networks.
The second family of synthetic networks is composed of networks with negligible degree-degree correlations, and is generated using the configuration model [59]. In these networks, d = k 2 /z, so the mean first-neighbor degree increases with the second moment of the degree distribution if the mean degree z is fixed. For example, one can construct networks with z = 5 with the degree probabilities and p k = 0 for all other k. Such a network has a fraction α of nodes with degree 5, and the remaining nodes have degrees 3 and 20. The mean first-neighbor degree for such networks is d = 11 − 6α, so it decreases linearly with α. By comparing numerical simulations for the SIS model with MF theory (not shown), we find that the error magnitude |E S | increases monotonically with α. It takes the value 0.07 at α = 0 (with d = 11) and the value 0.16 at α = 1 (with d = 5). Similar to the correlated synthetic networks of Fig. 6, the higher values of d thus correspond to lower values of the error. The evidence from both families of synthetic networks suggests that the high-d effect that we have observed can be due only to its impact on dynamical correlations [i.e., assumption (iii)]. In real-world networks, d can presumably affect the validity of all three MF assumptions. Further work is required to understand which assumption(s) have the strongest impact on MF accuracy in such situations.

C. Mean-Field Accuracy for Other Dynamical Processes
The argument that we have given above for the usefulness of d as a measure of MF accuracy is specific to SIS dynamics, where the quantity of interest is the (ensembleaveraged) infected fraction of nodes. We now consider error measures on the (z, d) plane for the other dynamics studied here, the Kuramoto and voter models. For the Kuramoto model, we define an error measure in terms of the r 2 order parameter from Eq. (2) as which we evaluate at the value of K for which r 2 theory = 0.6. Similarly, a measure of relative error for the voter model is given by E V = log 10 (P s theory ) − log 10 (P s numerical ) log 10 (P s theory ) , where P s theory and P s numerical are the survival probabilities given by Eq. (6) and by numerical simulations, respectively. We evaluate these quantities at the time t that corresponds to a survival probability of one percent (in MF theory): P s theory (t) = 10 −2 . This definition reflects the vertical difference between the dashed curve and the symbols in Fig. 3 at a specific value of t. We give the measured values for E V and E K for all real-world networks in Table I, and Figures 9(a) and 9(b) show how these values depend on the mean degree z and mean first-neighbor degree d of the networks. The Kuramoto model exhibits a similar pattern to SIS (compare Fig. 9(a) to Fig. 5): high-d networks have lower errors than low-d networks. However, the high-d effect does not seem to impact the voter model [see Fig. 9(b)] in the same way. We can understand this by contrasting the predicted quantities for SIS and for the voter model. For SIS, the error is low when MF theory accurately predicts the fraction I(t) of infected nodes. In the voter model, the quantity corresponding to I(t) is the fraction of nodes in one of the two voter states, which we denote by I V (t). When initial states are randomly assigned, MF theory predicts that I V (t) is conserved, which implies that I V (t) = 1/2 for all t. Numerical simulations on realworld networks also give I V (t) = 1/2, but only when one averages over an ensemble of realizations. In any single realization on a network of finite size, fluctuations eventually lead to the entire network becoming ordered-i.e., all nodes eventually share the same opinion. (In half of the realizations, this shared opinion is one voter state; in the other half it is the other state.) It is this single-realization ordering process that is measured by the survival probability P s (t). In this respect, the voter model is different from both the SIS and Kuramoto models, in which the trajectory of a typical realization is qualitatively similar to an ensemble-average of all trajectories. In order to better capture quantities of higher-order than I V (t), such as P s (t), it is necessary to approximate the dynamical correlations between nodes using, for example, a pair-approximation method. In Fig. 9(c), we show the magnitude of the PA error for the voter model; we still measure the error using Eq. (13), but we use the PA theory of Eq. (7) instead of the MF theory of Eq. (6). Observe the improvement in accuracy over the MF theory of Fig. 9(b), particularly for high-d networks. Similar to MF for SIS (see Fig. 5) and for Kuramoto [see Fig. 9(a)], only networks with both low z and low d have relative errors that significantly exceed 5%.

IV. COMPARISON WITH AN ALTERNATIVE MEASURE
Using numerous examples of real-world and synthetic networks, we have illustrated that the mean degree of first-neighbors d is a good indicator of the accuracy of MF theories for a variety of dynamical processes on networks. One can also construct more complicated accuracy measures, which may in general depend on the dynamics under scrutiny. In Ref. [52], for example, we examined (among other dynamics) the accuracy of the bond percolation theory of [60] by comparing its predictions with numerical calculations of the sizes of the largest connected component for several real-world networks. We showed that a good measure of the error is given by the quantity where ℓ is the mean inter-vertex distance in the original (clustered) network, ℓ 1 is the corresponding mean distance in a rewired version of the network (using a rewiring process that preserves degree-degree correlations but reduces clustering), and z is the mean degree. Noting that the bond percolation theory of Ref. [60] is of pair-approximation (PA) type, in contrast to the mean field theories on which we focus in this paper, it is nevertheless of interest to examine the relation between q and the mean first-neighbor degree d that we have identified in this paper as an indicator of MF theory accuracy for several dynamical processes.
In the (q, d) parameter plane of Fig. 10, we show the positions of those real-world networks from Fig. 5 which were also examined in Ref. [52]. The expected relationship between q and d is revealed: Networks with high d have low q (and hence, according to Ref. [52], have low error for bond percolation PA theory), while low d values correspond to high q and hence to large errors. Thus, despite its simplicity, d performs well when compared to other more involved measures. As noted above, there is scope for further work on developing more complicated  (14), which was shown in Ref. [52] to be correlated with the error of PA theory for bond percolation. We use the same symbols as in Fig. 5.
diagnostics (such as q) for predicting MF accuracy for various dynamics, but the use of the d value is appealing because it is simple to calculate and aids in understanding the underlying causes of MF inaccuracies.

V. CONCLUSIONS
In summary, we have shown that MF theory works best for networks in which low-degree nodes (if present) are connected to high-degree nodes (i.e., for networks that are either disassortative by degree or have high mean degree z). Remarkably, it is not necessary that the mean degree of the network be large for MF theory to work wellat least for ensemble-averaged quantities [see Figs. 5 and 9(a)]. In addition to the 21 real-world networks that we have studied, we have presented evidence from synthetic networks to support our hypothesis. We stress that our error measures focus on behavior far from critical points; the accuracy of MF for the calculation of phase transition points (such as the value of K for the onset of synchronization in the Kuramoto model [61,62] or the SIS epidemic threshold [5,[63][64][65]) is a topic for future work.
Based on our results for the voter model in Sec. III, we expect that similar conclusions should hold for the applicability of pair-approximation theories (such as those in refs. [7,54]) for dynamics on real-world networks. Although PA theories account for the dynamical correlations that plague MF theories, they remain vulnerable to the effects of network clustering and modularity when d is low. For example, Fig. 3(b) gives an example in which PA theory works well only on the rewired (and hence unclustered) version of a (low-d) network. This suggests that PA theory (like MF theory) is most accu-rate for real-world networks with either high mean degree or high mean first-neighbor degree. TABLE I: Basic diagnostics and error measures for the networks used in this paper. All real-world data have been treated in the form of undirected, unweighted networks. We only consider the largest connected component of each network, for which we enumerate the following properties: total number of nodes N ; mean degree z; mean first-neighbor degree d; fraction of nodes of degree 10 or less; clustering coefficients C and C (defined, respectively, in Eqs. (3.6) and (3.4) of Ref. [51]); and Pearson degree correlation coefficient r. The quantities ES, EK and EV are the relative MF errors for the SIS, Kuramoto, and voter models, E P A V is the relative PA error for the voter model. The last column gives the citation for the network in this paper's bibliography and/or the URL of a data file.