Generalised thresholding of hidden variable network models with scale-free property

Gergely Palla; P\'eter Pollner; S\'amuel G. Balogh

Generalised thresholding of hidden variable network models with scale-free property

T0 review · 0 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For a broad family of thresholded hidden-variable networks, the degree distribution always decays as $k^{-2}$; softening the threshold tunes the exponent.

desk verdict A solid, useful paper: rigorous γ=2 universality for broad thresholded classes, and a new soft-threshold construction with tunable exponents—supported asymptotically, with minor oversights. read the letter →

arxiv 1908.03757 v1 pith:X4OQYSQY submitted 2019-08-10 physics.soc-ph physics.data-an

Sámuel G. Balogh , Péter Pollner , Gergely Palla This is my paper · ORCID

classification physics.soc-phphysics.data-an PACS 89.75.Hc

keywords hiddenvariablemodelscale-freenetworksdegreedistributioninversesquarelawthresholdsoftthresholdingFermi-Diraclinkingfunctiontunablescalingexponent

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies hidden-variable network models, in which each node carries an intrinsic fitness drawn from a distribution and two nodes connect with a probability set by a linking function. It shows that if the linking function has a hard lower cutoff—zero below a threshold and an arbitrary function of the combined fitness above it—then, for three large families of fitness distributions (exponential-like, power-like, and mixed), the degree distribution always obeys $p(k)\propto k^{-2}$ in the thermodynamic limit, regardless of the detailed form of the linking function above threshold. The only requirements are that a transformed integral such as $L_\Delta(\tilde f)=\int_\Delta^\infty \tilde f(z)e^{-z}dz$ converges and that the threshold parameter is chosen so this integral equals $1/N$, the condition for a size-independent degree distribution. The paper then relaxes the hard cutoff to a smooth sigmoid linking probability, and argues, with simulations, that the scaling exponent can be tuned continuously, with $\gamma\approx 1+1/\beta$ for $0<\beta<1$ and $\gamma\to 2$ as $\beta\to\infty$. If correct, this gives a broad explanation of why many threshold-type fitness models produce inverse-square degree distributions, and a practical way to generate sparse scale-free networks with realistic exponents.

What carries the argument

The central machinery is the change of variables $z=H(x)+H(y)$ (or $z=G(x)G(y)$, or $z=(1+M(x))(1+M(y))$) that makes the expected-degree integral factorise. In the exponential-like class this gives $k(x)=N L_\Delta(\tilde f)e^{H(x)}$ with $L_\Delta(\tilde f)=\int_\Delta^\infty \tilde f(z)e^{-z}dz$; substituting into the random-variable rule $p(k)=\rho(x)/k'(x)$ then makes $p(k)\propto k^{-2}$ explicit. The same identity is carried by the constants $K_\alpha(\tilde f)$ and $J_\alpha(\tilde f)$ in the other two classes. For the tunable extension, the key object is the reversed Fermi-Dirac function $f_{\beta,\Delta}=1/(1+e^{-\beta(H(x)+H(y)-\Delta)})$, whose integral is approximated under $H(x)\ll\Delta$ by $\int e^{(\beta-1)z}dz$, yielding $k(x)\propto e^{\beta H(x)}$ and hence $p_\beta(k)\sim k^{-(1+1/\beta)}$.

What would settle it

Simulate the exponential-like model with $\rho(x)=3x^2e^{-x^3}$, the soft link $f_{\beta,\Delta}=1/(1+e^{-\beta(H(x)+H(y)-\Delta)})$, and $N=10^5$ for $\beta=0.3$ with $\Delta=(1/\beta)\ln N$. Measure the degree exponent over the top three decades of $k$ and compare it with $1+1/\beta\approx 4.33$; if the effective exponent varies with the fitting window or the tail deviates from a pure power law, the approximation in Eq. (34) fails. For the hard-threshold claim, pick an $f$ with divergent $L_\Delta(\tilde f)$, for instance $\tilde f(z)=e^{z/2}$ above the cutoff, and check that the degree distribution is no longer $k^{-2}$.

Watch

Extended reading notes

Core claim

The central claim is that the inverse-square decay is a robust, universal outcome of thresholding in the hidden-variable model. For fitness densities of the form $\rho(x)=H'(x)e^{-H(x)}$ with link probability zero when $H(x)+H(y)\le\Delta$ and equal to a general $\tilde f(H(x)+H(y))$ above it, the expected degree factorises as $k(x)=N L_\Delta(\tilde f)e^{H(x)}$, where $L_\Delta(\tilde f)=\int_\Delta^\infty \tilde f(z)e^{-z}dz$. Substituting into the degree-transformation formula gives $p(k)\propto k^{-2}$ together with the size-independence condition $L_\Delta(\tilde f)=1/N$. The analogous calculation for the power-like and mixed classes, with multiplicative or mixed combined variables and integrals $K_\alpha(\tilde f)$ and $J_\alpha(\tilde f)$, yields the same exponent with the same structure. The paper also claims that replacing the hard cutoff by the sigmoid $f_{\beta,\Delta}=1/(1+e^{-\beta(H(x)+H(y)-\Delta)})$ produces, for $0<\beta<1$, an approximate power law with exponent $\gamma\approx 1+1/\beta$, approaching $\gamma=2$ for large $\beta$.

Load-bearing premise

The universal $k^{-2}$ result assumes the transformed integral $L_\Delta(\tilde f)$ is finite and the size-independence condition $L_\Delta(\tilde f)=1/N$ can be met; the tunable-exponent result further assumes that the nodes dominating the power-law tail have hidden variables satisfying $H(x)\ll\Delta$, which the paper notes is only a good approximation for $\beta\in(0,1)$ and degrades as $\beta\to 0$.

Editorial extensions

If this is right

In the thermodynamic limit, every hard-thresholded model in the three generalised classes produces a degree distribution proportional to $k^{-2}$, independent of the functional form of the linking function above the threshold.
The role of the linking function's above-threshold shape reduces to setting the constants $L_\Delta(\tilde f)$, $K_\alpha(\tilde f)$, or $J_\alpha(\tilde f)$; the size-independence condition is that the relevant constant equals $1/N$.
Softening the cutoff with a reversed Fermi-Dirac function $f_{\beta,\Delta}$ yields, for $0<\beta<1$, a sparse scale-free network with approximate exponent $\gamma\approx 1+1/\beta$, and $\gamma\to 2$ as $\beta\to\infty$.
For $\beta>1$, choosing $\Delta\simeq \ln N$ keeps the degree distribution size-independent and close to $k^{-2}$; for $\beta<1$, the matching choice is $\Delta\simeq (1/\beta)\ln N$.
The transformation rules between the exponential-like, power-like, and mixed classes mean a construction or result in any one class carries over to the others.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

An implication the authors leave implicit: the universality of exponent 2 means empirical networks with degree exponent near 2 do not require power-law fitness distributions; any sufficiently regular fitness distribution paired with a thresholded kernel will produce that exponent.
The soft-threshold exponent $\gamma\approx 1+1/\beta$ is derived from a tail approximation, so I would expect the measured exponent to drift with the fitting window at small $\beta$ and finite $N$; a systematic simulation over window sizes would reveal the size of the correction.
Because the change-of-variable argument works for any monotone $H$, the same thresholding construction should transfer to geographic and hyperbolic hidden-variable models, where the variables enter through distances or angular coordinates.
A testable practical recipe follows: for any proposed linking probability with a lower cutoff, compute $L_\Delta(\tilde f)$; if it converges, the $k^{-2}$ law is predicted and the cutoff parameter needed for size independence is fixed by $L=1/N$.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

First thing you should know: this is a solid, useful paper. The hard-threshold part is rigorous and extends the known inverse-square law to a much broader class of linking functions and fitness distributions. The soft-threshold part is genuinely new and gives a simple way to generate scale-free networks with tunable degree exponents, but its analytic support is asymptotic, not exact, and a couple of statements oversell it slightly.

The hard-threshold derivations are clean and correct. The change-of-variable steps in Eqs. (14)–(19) and (21)–(26), plus the mixed class, are all valid under the stated assumptions. The size-independence conditions (L_Δ(f̃)=1/N, etc.) are practically useful, and the mapping between the exponential-like, power-like, and mixed classes via transformations of H, G, M is elegant and explains the apparent universality of earlier results. This part is publishable as is.

The soft-threshold construction is the real contribution. Replacing the step with a Fermi-Dirac function and deriving γ ≈ 1+1/β for β∈(0,1) (Eq. 35) is new, and the simulations in Fig. 3 support it. The worry that Eq. (34) is uncontrolled does not, on closer look, land: with Δ=(1/β)ln N, the quantity Δ−H(x) diverges for all nodes that contribute to the tail, so the asymptotic expansion is uniformly valid. The paper's phrase 'H(x)≪Δ' is sloppy; the real condition is Δ−H(x)≫1. That is a presentation issue, not a mathematical flaw. An explicit error bound would still be nice, but I would not block acceptance on it.

Minor soft spots: Fig. 3 lacks error bars, and the agreement is visual. The abstract's 'arbitrary scaling exponent' overstates the proven range—the formula gives a continuum of exponents, but with sub-power corrections and a breakdown as β→0, so 'tunable' rather than 'arbitrary' is the accurate word. The paper cites the relevant prior work (Caldarelli, Masuda, Fujihara) properly, and the self-citations are not a problem. The derivations are self-contained and not fitted to data.

Who should read this: anyone working with hidden-variable or fitness-based network models, especially if they need a simple generator for scale-free networks with a specified γ. It deserves a serious referee; I would send it to review. After minor revisions—clarify the asymptotic condition, add error bars or state the visual nature of the fit, soften 'arbitrary'—it should be accepted.

Referee Report

0 major / 5 minor

Summary. The paper studies hidden-variable network models with thresholded linking functions. It defines three classes of models (exponential-like, power-like, and mixed) in which the hidden-variable density is expressed through a monotone transform H, G, or M, and the linking probability is zero below a threshold Delta and otherwise equal to an arbitrary function f-tilde of the additive, multiplicative, or mixed combination of the transformed variables. For each class the authors show analytically that the degree distribution satisfies p(k) proportional to k^{-2} in the thermodynamic limit, independent of the post-threshold form of f-tilde, and they give explicit conditions (L_Delta = 1/N, K_alpha = 1/N, J_alpha = 1/N) for the degree distribution to be size independent. The second half of the paper replaces the hard threshold with a 'reversed' Fermi-Dirac function with stiffness parameter beta, derives an approximate exponent gamma approximately 1 + 1/beta for beta in (0,1) and gamma approximately 2 for beta > 1, and supports the predictions with simulations for a Weibull example. The paper also discusses a transformation rule that maps models in the three classes into one another.

Significance. The hard-threshold part of the paper is a clean and useful unification: it reduces the previously observed k^{-2} universality of threshold hidden-variable models (Refs. [10,21,22]) to a single change-of-variables argument, and it works for any post-threshold kernel f-tilde rather than only for the Heaviside step function. The analytic steps in Eqs. (14)-(27) are correct under the stated assumptions, and the explicit size-independence conditions are practical and falsifiable. The soft-threshold mechanism is intuitive and the predicted tunable exponent is potentially useful for applications. The main caveat is that the soft-threshold exponent is an asymptotic approximation rather than a rigorously bounded result, and the supporting simulations are single-size and without error bars; however, the paper is explicit about the approximate character of this part, and the asymptotic validity of Eq. (34) is plausible in the thermodynamic limit. These caveats are local and do not affect the hard-threshold conclusions.

minor comments (5)

[Eq. (28), mixed class] The mixed-class size-independence condition appears inconsistent with the stated definitions. With s = 1 + M(x) and t = 1 + M(y), the density becomes dt/t^alpha and the kernel is f-tilde(st), so the integral should be integral_Delta^infinity f-tilde(z) z^{-alpha} dz, not integral_Delta^infinity f-tilde(z)/(1+z)^alpha dz. If the intended integration variable is z = st - 1, then f-tilde is evaluated at z + 1 and the lower limit should be Delta - 1. Please correct Eq. (28) and clarify the definition of z.
[Eq. (34), soft thresholding] Eq. (34) is derived by replacing 1/(1+e^{-beta z}) with e^{beta z} for z = H(x) - Delta much less than 0. The working condition is therefore not merely H(x) << Delta but Delta - H(x) >> 1. With the proposed choice Delta = (1/beta) ln N this is satisfied for all contributing nodes in the thermodynamic limit, so the asymptotic exponent in Eq. (35) is sound; nevertheless the stated condition should be reworded to avoid confusing readers.
[Eqs. (37)-(38), beta > 1 branch] The replacement of the lower integration limit by 0 for beta > 1 is an N-to-infinity statement for fixed beta, not a uniform-in-beta statement. For finite N and beta just above 1, the omitted negative-z contribution is of order N^{-(beta-1)}/(beta-1), which can be substantial (for example, N = 20000 and beta = 1.1 give roughly a 30 percent correction to the integral). Please state explicitly that Eq. (38) is an asymptotic result in the thermodynamic limit with beta fixed, and ideally provide a finite-size scaling check.
[Fig. 3 and numerical support] The simulation points in Fig. 3 have no error bars and use a single network size N = 20000. Since the analytic curve is approximate, showing the same gamma versus 1/beta curve for two or three sizes would make the claimed tunable-exponent behavior substantially more convincing.
[Notation and typos] In Eq. (5), 'f-tilde(x,y)' should be a function of H(x) + H(y). Eq. (11) contains garbled notation around the integral and the Jacobian and should be rewritten. The transformation rules in Eq. (12) use a tilde on x without definition; please clarify. In Table 1, the Weibull distribution appears in both the exponential-like and power-like rows with different arguments; a sentence explaining the shared notation would help.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the γ=2 and soft-threshold exponents are derived analytically from the stated model classes, not fitted or imported via self-citation.

full rationale

The paper's central derivation is self-contained analytic calculation. For the exponential-like class, Eq. (15) shows k(x)exp[-H(x)] = N∫_Δ^∞ f̃(z)e^{-z}dz = N L_Δ(f̃), and Eq. (19) then gives p(k) ∝ k^{-2} directly. The model classes in Eqs. (4)-(9) are constructed so that the change of variables works, but constructing a class and deriving its consequence is not circular: the inverse-square result is a theorem about the class, not an input to the class definition. The soft-threshold exponent γ ≈ 1 + 1/β follows from the asymptotic approximation in Eq. (34), which is an analytic estimate of the integral in Eq. (33) for H(x) ≪ Δ and β ∈ (0,1); the simulations in Figs. 2-3 are used only for illustration and consistency checks, not to fit any parameter in the formula. The paper cites prior work (e.g., Refs. [10,21,22]) for the original observation of the inverse-square decay, but the present results are re-derived from the model equations rather than resting on those citations. No uniqueness theorem is invoked, and no self-citation carries a load-bearing argument. The closest concern is the accuracy of the approximation in Eq. (34), but that is a technical asymptotic-validity question, not a circularity: the approximation is stated, used to obtain an analytic formula, and then compared with simulation. Overall, the derivation chain is independent and non-circular.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central derivations rest on the standard mean-field hidden-variable formalism and on monotone transformations of variables. No new physical or mathematical entities are introduced. The parameters Δ and β are model inputs chosen by the researcher to control sparsity and exponent, not fitted to data to force the claimed results.

free parameters (2)

Δ (threshold parameter) = Δ ≈ (1/β) ln N for β<1; Δ ≈ ln N for β>1 in the soft-threshold model; in the hard-threshold model, Δ determined by…
Chosen to keep the average degree finite and the degree distribution size-independent. It is a modeling choice, not fitted to reproduce the claimed degree exponent, but it controls the sparsity of the network.
β (softness or inverse temperature parameter) = Varied between 0 and 5 in simulations
Controls the sharpness of the threshold and, in the approximate derivation, sets the degree exponent γ ≈ 1 + 1/β for 0<β<1. It is an input parameter that the user tunes to achieve a desired exponent.

assumptions (4)

domain assumption The expected degree of a node with fitness x is k(x) = N ∫ f(x,y) ρ(y) dy (the continuous or mean-field approximation), and k(x) is monotonically increasing and invertible in x.
Used throughout, starting at Eq. (1). This is standard in hidden variable network models but assumes that actual degrees are well approximated by their means in the thermodynamic limit.
domain assumption The functions H, G, M are differentiable and monotonically increasing, and the fitness distributions are normalized densities of the forms (4), (6), (8).
Stated in the model class definitions. These properties are necessary for the change-of-variables steps in the derivations.
standard math The integrals L_Δ(f̃), K_α(f̃), J_α(f̃) defined in Eqs. (16), (24), (28) exist and are finite.
This convergence assumption is required for the degree to be finite and for the p(k) ∝ k^{-2} result to hold; it is stated in the text before Eq. (17) and implicitly in the other cases.
ad hoc to paper For the soft-threshold approximation, the condition H(x) ≪ Δ holds for typical nodes, allowing Eq. (33) to be approximated by Eq. (34) with the exponential integral.
Invoked explicitly in the text after Eq. (33). This approximation fails for hubs with large H(x), so the predicted exponent γ ≈ 1 + 1/β is approximate and may not describe the extreme tail of the degree distribution.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Generalised thresholding of hidden variable network models with scale-free property." pith.science (2026). https://pith.science/paper/X4OQYSQY

@misc{pith2026190803757,
  author       = {Pith},
  title        = {Pith review of: Generalised thresholding of hidden variable network models with scale-free property},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/X4OQYSQY}},
  note         = {Machine review of arXiv:1908.03757}
}

abstract

The hidden variable formalism (based on the assumption of some intrinsic node parameters) turned out to be a remarkably efficient and powerful approach in describing and analyzing the topology of complex networks. Owing to one of its most advantageous property - namely proven to be able to reproduce a wide range of different degree distribution forms - it has become a standard tool for generating networks having the scale-free property. One of the most intensively studied version of this model is based on a thresholding mechanism of the exponentially distributed hidden variables associated to the nodes (intrinsic vertex weights), which give rise to the emergence of a scale-free network where the degree distribution $p(k)\sim k^{-\gamma}$ is decaying with an exponent of $\gamma =2$. Here we propose a generalization and modification of this model by extending the set of connection probabilities and hidden variable distributions that lead to the aforementioned degree distribution, and analyze the conditions leading to the above behavior analytically. In addition, we propose a relaxation of the hard threshold in the connection probabilities, which opens up the possibility for obtaining sparse scale free networks with arbitrary scaling exponent.

Figures

Figures reproduced from arXiv: 1908.03757 by the authors.

**Figure 2.** The complementary cumulative distribution of the node degrees F(k) for four different networks, generated with the same ρ(x) and f(x, y), but with different β parameters. The fitness distribution was chosen to be ρ(x) = 3x 2 exp(−x 3 ) and corresponding linking function f(x, y) is given in (31). In panel a) we used β = 0.5, and the decay characteristics of the resulting F(k) seem to be close to that of SF networks w… view at source ↗

**Figure 3.** Scaling exponent γ of the degree distribution as a function of the effective temperature 1/β in the model with soft thresholding. The data points correspond to simulation results on networks of size N = 20000, where the fitness distribution was chosen to be ρ(x) = 3x 2 exp(−x 3 ) and the linking function f(x, y) was given by (31). The dashed line shows the (approximate) analytic results given by (35) and (38). 9 [P… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

46 extracted references · 46 canonical work pages

[1]

& Barabási, A.-L

Albert, R. & Barabási, A.-L. Statistical mechanics of complex networks. JournalTitleReviews of Modern Physics 74, 47–97 (2002)

work page 2002
[2]

Mendes, J. F. F. & Dorogovtsev, S. N.Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford Univ. Press, Oxford, 2003)

work page 2003
[3]

& Albert, R

Barabási, A.-L. & Albert, R. Emergence of scaling in random networks. JournalTitleScience 286, 509–512 (1999)

work page 1999
[4]

Newman, M. E. J. Scientiﬁc collaboration networks. i. network construction and fundamental results. JournalTi- tlePhys. Rev. E 64, 016131 (2001)

work page 2001
[5]

He, B. J. Scale-free brain activity: past, present, and future. JournalTitleTrends in Cognitive Sciences18, 480 – 487 (2014)

work page 2014
[6]

Servedio, V . D. P., Caldarelli, G. & Buttà, P. Vertex intrinsic ﬁtness: How to produce arbitrary scale-free networks. JournalTitlePhys. Rev. E70, 056126 (2004)

work page 2004
[7]

Scale-free networks in cell biology

Albert, R. Scale-free networks in cell biology. JournalTitleJ. Cell Sci. 118, 4947–4957 (2005)

work page 2005
[8]

& Barabási, A.-L

Bianconi, G. & Barabási, A.-L. Competition and multiscaling in evolving networks. JournalTitleEurophys. Lett. 54, 436 (2001)

work page 2001

Show all 46 references

[9]

Dorogovtsev, S., Mendes, J. F. & N Samukhin, A. Structure of growing networks with preferential linking. JournalTitlePhys. Rev. Lett.85, 4633–6 (2000)

2000
[10]

& Muñoz, M

Caldarelli, G., Capocci, A., De Los Rios, P. & Muñoz, M. A. Scale-free networks from varying vertex intrinsic ﬁtness. JournalTitlePhys. Rev. Lett.89, 258702 (2002). 10 A PREPRINT - AUGUST 13, 2019

2002
[11]

Timár, G., Dorogovtsev, S. N. & Mendes, J. F. F. Scale-free networks with exponent one. JournalTitlePhys. Rev. E 94, 022302 (2016)

2016
[12]

& Marsili, M

Seyed-allaei, H., Bianconi, G. & Marsili, M. Scale-free networks with an exponent less than two.JournalTitlePhys. Rev. E 73, 046113 (2006)

2006
[13]

Watts, D. J. & Strogatz, S. H. Collective dynamics of ’small-world’ networks. JournalTitleNature 393, 440–442 (1998)

1998
[14]

& Rodgers, G

Bedogne’, C. & Rodgers, G. J. Complex growing networks with intrinsic vertex ﬁtness. JournalTitlePhys. Rev. E 74, 046115 (2006)

2006
[15]

& Arenas, A

Guimerà, R., Díaz-Guilera, A., Vega-Redondo, F., Cabrales, A. & Arenas, A. Optimal network topologies for local search with congestion. JournalTitlePhys. Rev. Lett.89, 248701 (2002)

2002
[16]

& Vicsek, T

Palla, G., Derényi, I., Farkas, I. & Vicsek, T. Statistical mechanics of topological phase transitions in networks. JournalTitlePhys. Rev. E69, 046117 (2004)

2004
[17]

K., Bowie, J

Kim, J., Kim, I., Han, S. K., Bowie, J. U. & Kim, S. Network rewiring is an important mechanism of gene essentiality change. JournalTitleScientiﬁc Reports 2, 900 (2012)

2012
[18]

& Pastor-Satorras, R

Boguñá, M. & Pastor-Satorras, R. Class of correlated random networks with hidden variables. JournalTitlePhys. Rev. E 68, 036112 (2003)

2003
[19]

& Konno, N

Masuda, N. & Konno, N. Vip-club phenomenon: Emergence of elites and masterminds in social networks. JournalTitleSocial Networks 28, 297 – 309 (2006)

2006
[20]

van der Hofstad, R., Janssen, A. J. E. M., van Leeuwaarden, J. S. H. & Stegehuis, C. Local clustering in scale-free networks with hidden variables. JournalTitlePhys. Rev. E95, 022307 (2017)

2017
[21]

& Konno, N

Masuda, N., Miwa, H. & Konno, N. Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights. JournalTitlePhys. Rev. E70, 036124 (2004)

2004
[22]

& Miwa, H

Fujihara, A., Uchida, M. & Miwa, H. Universal power laws in the threshold network model: A theoretical analysis based on extreme value theory. JournalTitlePhysica A: Statistical Mechanics and its Applications389, 1124 – 1130 (2010)

2010
[23]

& De Los Rios, P

Petermann, T. & De Los Rios, P. Exploration of scale-free networks. JournalTitleThe European Physical Journal B 38, 201–204 (2004)

2004
[24]

& Arenas, A

Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A. & Arenas, A. Models of social networks based on social distance attachment. JournalTitlePhys. Rev. E70, 056122 (2004)

2004
[25]

& Pastor-Satorras, R

Starnini, M. & Pastor-Satorras, R. Topological properties of a time-integrated activity-driven network. JournalTi- tlePhys. Rev. E 87, 062807 (2013)

2013
[26]

& Caldarelli, G

Garlaschelli, D., Capocci, A. & Caldarelli, G. Self-organized network evolution coupled to extremal dynamics. JournalTitleNature Physics 3 (2006)

2006
[27]

W., Laskey, K

Holland, P. W., Laskey, K. B. & Leinhardt, S. Stochastic blockmodels: First steps. JournalTitleSocial Networks 5, 109 – 137 (1983)

1983
[28]

E., Meyer, M

Fienberg, S. E., Meyer, M. M. & Wasserman, S. S. Statistical analysis of multiple sociometric relations. JournalTitleJournal of the American Statistical Association 80, 51–67 (1985)

1985
[29]

& Zdeborová, L

Decelle, A., Krzakala, F., Moore, C. & Zdeborová, L. Inference and phase transitions in the detection of modules in sparse networks. JournalTitlePhys. Rev. Lett.107, 065701 (2011)

2011
[30]

Aicher, C., Jacobs, A. Z. & Clauset, A. Learning latent block structure in weighted networks. JournalTitleJournal of Complex Networks 3, 221–248 (2015)

2015
[31]

Peixoto, T. P. Nonparametric weighted stochastic block models. JournalTitlePhys. Rev. E97, 012306 (2018)

2018
[32]

& Vicsek, T

Palla, G., Lovász, L. & Vicsek, T. Multifractal network generator. JournalTitleProceedings of the National Academy of Sciences USA (2010)

2010
[33]

& Fortunato, S

Eom, Y .-H. & Fortunato, S. Characterizing and modeling citation dynamics. JournalTitlePLOS ONE 6, 1–7 (2011)

2011
[34]

Medo, M. c. v., Cimini, G. & Gualdi, S. Temporal effects in the growth of networks. JournalTitlePhys. Rev. Lett. 107, 238701 (2011)

2011
[35]

A., Krioukov, D

Serrano, M. A., Krioukov, D. & Boguñá, M. Self-similarity of complex networks and hidden metric spaces. JournalTitlePhys. Rev. Lett.100, 078701 (2008). 11 A PREPRINT - AUGUST 13, 2019

2008
[36]

& Boguñá, M

Krioukov, D., Papadopoulos, F., Vahdat, A. & Boguñá, M. Curvature and temperature of complex networks. JournalTitlePhys. Rev. E80, 035101 (2009)

2009
[37]

& Claffy, K

Boguñá, M., Krioukov, D. & Claffy, K. C. Navigability of complex networks. JournalTitleNature Physics 5, 74–80 (2009)

2009
[38]

& Boguñá, M

Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A. & Boguñá, M. Hyperbolic geometry of complex networks. JournalTitlePhys. Rev. E82, 036106 (2010)

2010
[39]

& Krioukov, D

Boguñá, M., Papadopoulos, F. & Krioukov, D. Sustaining the internet with hyperbolic mapping. JournalTitleNa- ture Communications 1, 62 (2010)

2010
[40]

& Konno, N

Masuda, N., Miwa, H. & Konno, N. Geographical threshold graphs with small-world and scale-free properties. JournalTitlePhysical Review E 71, 036108 (2005)

2005
[41]

& Sarkar, A

Konno, N., Masuda, N., Roy, R. & Sarkar, A. Rigorous results on the threshold network model. JournalTitleJour- nal of Physics A: Mathematical and General 38, 6277 (2005)

2005
[42]

Fujihara, A. et al. Limit theorems for the average distance and the degree distribution of the threshold network model. JournalTitleInterdisciplinary Information Sciences 15, 361–366 (2009)

2009
[43]

& Masuda, N

Ide, Y ., Konno, N. & Masuda, N. Statistical properties of a generalized threshold network model. JournalTi- tleMethodology and Computing in Applied Probability 12, 361–377 (2010)

2010
[44]

& Servedio, V

Caldarelli, G., Caretta Cartozo, C., De Los Rios, P. & Servedio, V . D. P. Widespread occurrence of the inverse square distribution in social sciences and taxonomy. JournalTitlePhys. Rev. E69, 035101 (2004)

2004
[45]

E., Fink, T

Garlaschelli, D., Ahnert, S. E., Fink, T. M. A. & Caldarelli, G. Low-temperature behaviour of social and economic networks. JournalTitleEntropy15, 3148–3169 (2013)

2013
[46]

& Newman, M

Park, J. & Newman, M. E. J. Origin of degree correlations in the internet and other networks. JournalTitlePhys. Rev. E 68, 026112 (2003). Acknowledgements This project has received funding from the European Union’s Horizon 2020 Research and Innovation Programme under Grant Agr...

2003

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

& Barabási, A.-L

Albert, R. & Barabási, A.-L. Statistical mechanics of complex networks. JournalTitleReviews of Modern Physics 74, 47–97 (2002)

work page 2002

[2] [2]

Mendes, J. F. F. & Dorogovtsev, S. N.Evolution of Networks: From Biological Nets to the Internet and WWW (Oxford Univ. Press, Oxford, 2003)

work page 2003

[3] [3]

& Albert, R

Barabási, A.-L. & Albert, R. Emergence of scaling in random networks. JournalTitleScience 286, 509–512 (1999)

work page 1999

[4] [4]

Newman, M. E. J. Scientiﬁc collaboration networks. i. network construction and fundamental results. JournalTi- tlePhys. Rev. E 64, 016131 (2001)

work page 2001

[5] [5]

He, B. J. Scale-free brain activity: past, present, and future. JournalTitleTrends in Cognitive Sciences18, 480 – 487 (2014)

work page 2014

[6] [6]

Servedio, V . D. P., Caldarelli, G. & Buttà, P. Vertex intrinsic ﬁtness: How to produce arbitrary scale-free networks. JournalTitlePhys. Rev. E70, 056126 (2004)

work page 2004

[7] [7]

Scale-free networks in cell biology

Albert, R. Scale-free networks in cell biology. JournalTitleJ. Cell Sci. 118, 4947–4957 (2005)

work page 2005

[8] [8]

& Barabási, A.-L

Bianconi, G. & Barabási, A.-L. Competition and multiscaling in evolving networks. JournalTitleEurophys. Lett. 54, 436 (2001)

work page 2001