pith. sign in

arxiv: 2510.23041 · v2 · submitted 2025-10-27 · ⚛️ physics.soc-ph · physics.data-an

Universal Network Generation Model via Exponential Probabilistic Growth and Vari-linear Preferential Attachment

Jinhu Ren , Linyuan L\"u This is my paper

Pith reviewed 2026-05-18 03:51 UTC · model grok-4.3

classification ⚛️ physics.soc-ph physics.data-an
keywords network generation modelpreferential attachmentexponential growthdegree distributionreal-world networksvari-linear attachmentuniversal model
0
0 comments X p. Extension

The pith

Exponential probabilistic growth combined with vari-linear preferential attachment generates networks that match real-world data several times better than traditional models.

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

The paper proposes a vari-linear network generation model built on exponential probabilistic growth and vari-linear preferential attachment. This combination addresses the inability of standard growth rules to capture the low-degree part of observed degree distributions and the limited universality of strictly linear attachment. The authors report that the resulting networks reproduce properties of diverse empirical datasets more faithfully, with performance several times higher than earlier methods. A sympathetic reader would care because the model supplies a single generative process that also unifies previously separate explanations for classical network features.

Core claim

The vari-linear network generation model, which incorporates exponential probabilistic growth and vari-linear preferential attachment, describes real-world networks more comprehensively and faithfully than previous approaches, delivers performance on diverse empirical datasets that is several times better than traditional methods, and achieves a unified interpretation of previously isolated classical network characteristics.

What carries the argument

Vari-linear preferential attachment, in which the probability of connecting to a node is a linear function of its degree whose slope can vary across degree ranges, paired with exponential probabilistic growth that controls the addition of new nodes and edges.

If this is right

  • The model supplies higher-quality universal networks for simulation in network-based research.
  • It unifies the interpretation of previously isolated classical network characteristics under one generative framework.
  • Ablation experiments and statistical analysis confirm the contribution of each mechanism.
  • The approach advances the development of a general 'world model' for networks.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same mechanisms could be used to forecast how new types of networks, such as those arising on emerging platforms, will evolve without requiring separate parameter tuning for each domain.
  • Varying the linearity parameter across degree ranges may explain why some networks appear scale-free only above a certain degree threshold.
  • Direct comparison of generated networks against temporal snapshots of real systems would test whether the model captures evolution as well as static structure.

Load-bearing premise

Exponential probabilistic growth and vari-linear preferential attachment are the primary mechanisms sufficient to explain and generate the degree distributions and other properties seen across diverse real-world networks without domain-specific adjustments.

What would settle it

Apply the model to a fresh collection of real networks not used in the original experiments, compute the fit to degree distributions and other metrics, and compare the error reduction against standard models such as Barabási–Albert; failure to show several-fold improvement would falsify the central performance claim.

read the original abstract

Generated networks are widely used in network-based research as a convenient simulation environment. Generating universal networks that more accurately reflect real-world patterns is a cornerstone task. This study proposes a vari-linear network generation model that incorporates two core mechanisms: exponential probabilistic growth and vari-linear preferential attachment. It concurrently overcomes the limitations of traditional growth in characterizing the low-degree region of the degree distribution and the issues regarding the universality of linear preferential attachment. Results indicate that our model describes real-world networks more comprehensively and faithfully, and is highly interpretable. Its performance on diverse empirical datasets is several times better than traditional methods. Related mechanisms and conclusions are substantiated through ablation experiments and statistical analysis. Notably, it achieves a unified interpretation of previously isolated classical network characteristics. This work not only provides a higher-quality universal network generation method, but also bridges the boundaries between traditional concepts, thereby promoting substantive progress in the "world model" of networks.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes a vari-linear network generation model incorporating exponential probabilistic growth and vari-linear preferential attachment. It claims this overcomes limitations of traditional models in the low-degree region of degree distributions and the non-universality of linear preferential attachment, yielding networks that describe real-world data more faithfully, with performance several times better than baselines on diverse empirical datasets, high interpretability, and a unified view of previously separate classical network properties, backed by ablation studies and statistical tests.

Significance. If the central claims hold with fixed rather than per-dataset parameters, the work would supply a more accurate universal generator for network simulations and a mechanistic bridge between growth models and attachment rules, strengthening the 'world model' of networks.

major comments (2)
  1. [§3 and §4] §3 (Model Definition) and §4 (Parameter Selection): the manuscript must explicitly state whether the vari-linear exponent/coefficient and the exponential growth-rate parameter are held fixed across all networks or fitted separately to each empirical dataset. If the latter, the universality and 'sufficiency without domain-specific adjustments' claims are undermined, as the reported performance gains would reduce to post-hoc fitting of a two-parameter family rather than an independent mechanistic explanation.
  2. [Table 2] Table 2 or equivalent performance table: the 'several times better' quantitative claim requires reporting of exact metrics (e.g., KS distance, log-likelihood), the precise datasets, and whether baselines were also given the same two-parameter freedom. Without this, the superiority cannot be distinguished from increased flexibility.
minor comments (2)
  1. [Abstract] Abstract: the summary asserts superior performance and unified interpretation but supplies no equations, datasets, or numerical results, forcing readers to reach the full text for any assessment.
  2. [Notation] Notation: define the exact functional form of the vari-linear attachment probability (e.g., is it p(k) ∝ k^α or a shifted linear transform) at first use and keep it consistent with the growth-rate parameter.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The comments identify important points of clarification regarding parameter usage and quantitative reporting. We address each major comment below and commit to revisions that will make the manuscript more precise without altering its core claims.

read point-by-point responses

  1. Referee: [§3 and §4] §3 (Model Definition) and §4 (Parameter Selection): the manuscript must explicitly state whether the vari-linear exponent/coefficient and the exponential growth-rate parameter are held fixed across all networks or fitted separately to each empirical dataset. If the latter, the universality and 'sufficiency without domain-specific adjustments' claims are undermined, as the reported performance gains would reduce to post-hoc fitting of a two-parameter family rather than an independent mechanistic explanation.

    Authors: We appreciate the referee’s request for explicit clarification. In the current manuscript the vari-linear coefficient and exponential growth-rate parameter are fitted separately to each empirical dataset, which is the standard practice when demonstrating that a single mechanistic family can reproduce the statistics of networks drawn from different domains. The universality claim refers to the consistent use of the same functional forms (exponential probabilistic growth combined with vari-linear preferential attachment) rather than to fixed numerical values. Because the same two-parameter structure is applied uniformly, the model still supplies a unified mechanistic account that bridges previously separate growth and attachment rules. We will revise §§3 and 4 to state this distinction explicitly and will temper the phrasing of “sufficiency without domain-specific adjustments” to avoid any implication of fixed parameters. These changes preserve the interpretability and unification results while satisfying the referee’s concern. revision: yes

  2. Referee: [Table 2] Table 2 or equivalent performance table: the 'several times better' quantitative claim requires reporting of exact metrics (e.g., KS distance, log-likelihood), the precise datasets, and whether baselines were also given the same two-parameter freedom. Without this, the superiority cannot be distinguished from increased flexibility.

    Authors: We agree that the quantitative comparison must be fully transparent. In the revised manuscript we will replace or augment Table 2 with a table that reports the exact Kolmogorov–Smirnov distances and log-likelihood values for every dataset, together with the list of networks used. We will also add a column or supplementary experiment in which the baseline models (Barabási–Albert, preferential attachment with linear attachment, etc.) are given two free parameters optimized on the same data, allowing a direct assessment of whether the performance gain exceeds what extra flexibility alone can provide. These additions will make the superiority claim verifiable and will address the referee’s legitimate concern about distinguishing model structure from parameter count. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The abstract and available context describe a model built from two explicit mechanisms (exponential probabilistic growth and vari-linear preferential attachment) whose outputs are compared to empirical networks via ablation and statistical analysis. No equations are shown that reduce a claimed prediction or result directly to a fitted parameter by construction, nor is there load-bearing self-citation of a uniqueness theorem or ansatz smuggled from prior work. The performance claims rest on external dataset comparisons rather than internal redefinition, making the derivation self-contained against the provided text.

Axiom & Free-Parameter Ledger

2 free parameters · 1 axioms · 0 invented entities

The model rests on standard network science assumptions about growth and attachment processes plus new functional forms whose parameters must be chosen or fitted.

free parameters (2)
  • vari-linear exponent or coefficient
    Controls the non-linear preference in attachment; must be set or fitted to match observed degree distributions.
  • exponential growth rate parameter
    Governs the time-dependent probability of node or edge addition; fitted to data.
axioms (1)
  • domain assumption Real-world networks are generated by growth processes combined with preferential attachment rules.
    Core premise of the entire class of models the paper extends.

pith-pipeline@v0.9.0 · 5686 in / 1340 out tokens · 35485 ms · 2026-05-18T03:51:52.450020+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

65 extracted references · 65 canonical work pages · 1 internal anchor

  1. [1]

    Oxford University Press, Oxford, UK (2018)

    Newman, M.: Networks. Oxford University Press, Oxford, UK (2018)

    work page 2018

  2. [2]

    Inter- national journal of bifurcation chaos, Solitons & Fractals 12(05), 885–916 (2002)

    Wang, X.F.: Complex networks: topology, dynamics and synchronization. Inter- national journal of bifurcation chaos, Solitons & Fractals 12(05), 885–916 (2002)

    work page 2002

  3. [3]

    Nature physics 15(4), 313–320 (2019)

    Lambiotte, R., Rosvall, M., Scholtes, I.: From networks to optimal higher-order models of complex systems. Nature physics 15(4), 313–320 (2019)

    work page 2019

  4. [4]

    Reviews of Modern Physics87(3), 925–979 (2015)

    Pastor-Satorras, R., Castellano, C., Van Mieghem, P., Vespignani, A.: Epidemic processes in complex networks. Reviews of Modern Physics87(3), 925–979 (2015)

    work page 2015

  5. [5]

    ACM computing surveys 52(6), 1–36 (2019)

    Drobyshevskiy, M., Turdakov, D.: Random graph modeling: A survey of the concepts. ACM computing surveys 52(6), 1–36 (2019)

    work page 2019

  6. [6]

    arXiv preprint arXiv:2409.20493 (2024) 15

    Thibault, F., H´ ebert-Dufresne, L., Allard, A.: On the uniform sampling of the configuration model with centrality constraints. arXiv preprint arXiv:2409.20493 (2024) 15

    work page arXiv 2024

  7. [7]

    Erds, P., Rnyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(1), 17–60 (1960)

    work page 1960

  8. [8]

    Nature 393(6684), 440–442 (1998)

    Watts, D.J., Strogatz, S.H.: Collective dynamics of small-worldnetworks. Nature 393(6684), 440–442 (1998)

    work page 1998

  9. [9]

    Physical review E 60(2), 1412 (1999)

    Carlson, J.M., Doyle, J.: Highly optimized tolerance: A mechanism for power laws in designed systems. Physical review E 60(2), 1412 (1999)

    work page 1999

  10. [10]

    ACM SIGCOMM computer communication review29(4), 251– 262 (1999)

    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. ACM SIGCOMM computer communication review29(4), 251– 262 (1999)

    work page 1999

  11. [11]

    Journal of the American society for Information science 27(5), 292–306 (1976)

    Price, D.d.S.: A general theory of bibliometric and other cumulative advantage processes. Journal of the American society for Information science 27(5), 292–306 (1976)

    work page 1976

  12. [12]

    Science 149(3683), 510–515 (1965)

    Price, D.J.D.S.: Networks of scientific papers: The pattern of bibliographic ref- erences indicates the nature of the scientific research front. Science 149(3683), 510–515 (1965)

    work page 1965

  13. [13]

    Science 286(5439), 509–512 (1999)

    Barabsi, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)

    work page 1999

  14. [14]

    Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 371(1987), 20120375 (2013)

    Barab´ asi, A.-L.: Network science. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 371(1987), 20120375 (2013)

    work page 1987

  15. [15]

    Journal of Complex Networks 9(1), 008 (2021)

    Piva, G.G., Ribeiro, F.L., Mata, A.S.: Networks with growth and preferential attachment: modelling and applications. Journal of Complex Networks 9(1), 008 (2021)

    work page 2021

  16. [16]

    Advances in physics 51(4), 1079–1187 (2002)

    Dorogovtsev, S.N., Mendes, J.F.: Evolution of networks. Advances in physics 51(4), 1079–1187 (2002)

    work page 2002

  17. [17]

    Callaway, D.S., Hopcroft, J.E., Kleinberg, J.M., Newman, M.E., Strogatz, S.H.: Are randomly grown graphs really random? Physical Review E 64(4), 041902 (2001)

    work page 2001

  18. [18]

    Physical Review E 63(6), 066123 (2001)

    Krapivsky, P.L., Redner, S.: Organization of growing random networks. Physical Review E 63(6), 066123 (2001)

    work page 2001

  19. [19]

    Mathematical Biosciences 6, 313–329 (1970)

    Na, H.S., Rapoport, A.: Distribution of nodes of a tree by degree. Mathematical Biosciences 6, 313–329 (1970)

    work page 1970

  20. [20]

    Physics today 58(6), 49–54 (2005)

    Redner, S.: Citation statistics from 110 years of physical review. Physics today 58(6), 49–54 (2005)

    work page 2005

  21. [21]

    SIAM review 16 45(2), 167–256 (2003)

    Newman, M.E.: The structure and function of complex networks. SIAM review 16 45(2), 167–256 (2003)

    work page 2003

  22. [22]

    Europhysics letters 54(4), 436 (2001)

    Bianconi, G., Barabsi, A.-L.: Competition and multiscaling in evolving networks. Europhysics letters 54(4), 436 (2001)

    work page 2001

  23. [23]

    The European Physical Journal B 86, 1–6 (2013)

    Almeida, M.L., Mendes, G.A., Madras Viswanathan, G., Silva, L.R.: Scale-free homophilic network. The European Physical Journal B 86, 1–6 (2013)

    work page 2013

  24. [24]

    Nature 489(7417), 537–540 (2012)

    Papadopoulos, F., Kitsak, M., Serrano, M.., Bogun, M., Krioukov, D.: Popularity versus similarity in growing networks. Nature 489(7417), 537–540 (2012)

    work page 2012

  25. [25]

    Journal of Statistical Mechanics: Theory Exper- iment 2020(4), 043404 (2020)

    Cinardi, N., Rapisarda, A., Tsallis, C.: A generalised model for asymptotically- scale-free geographical networks. Journal of Statistical Mechanics: Theory Exper- iment 2020(4), 043404 (2020)

    work page 2020

  26. [26]

    Journal of Statistical Mechanics: Theory Experiment 2017(9), 093402 (2017)

    Nunes, T.C., Brito, S., Silva, L.R., Tsallis, C.: Role of dimensionality in pref- erential attachment growth in the bianconibarabsi model. Journal of Statistical Mechanics: Theory Experiment 2017(9), 093402 (2017)

    work page 2017

  27. [27]

    Europhysics Letters 70(1), 70 (2005)

    Soares, D.J., Tsallis, C., Mariz, A.M., Silva, L.R.: Preferential attachment growth model and nonextensive statistical mechanics. Europhysics Letters 70(1), 70 (2005)

    work page 2005

  28. [28]

    Nature communications 10(1), 1016 (2019)

    Holme, P.: Rare and everywhere: Perspectives on scale-free networks. Nature communications 10(1), 1016 (2019)

    work page 2019

  29. [29]

    Quanta Magazine 15 (2018)

    Klarreich, E.: Scant evidence of power laws found in real-world networks. Quanta Magazine 15 (2018)

    work page 2018

  30. [30]

    SIAM review 51(4), 661–703 (2009)

    Clauset, A., Shalizi, C.R., Newman, M.E.: Power-law distributions in empirical data. SIAM review 51(4), 661–703 (2009)

    work page 2009

  31. [31]

    Nature communications 10(1), 1017 (2019)

    Broido, A.D., Clauset, A.: Scale-free networks are rare. Nature communications 10(1), 1017 (2019)

    work page 2019

  32. [32]

    Scientific reports 8(1), 2811 (2018)

    Sheridan, P., Onodera, T.: A preferential attachment paradox: How preferential attachment combines with growth to produce networks with log-normal in-degree distributions. Scientific reports 8(1), 2811 (2018)

    work page 2018

  33. [33]

    Physical review letters 85(21), 4629 (2000)

    Krapivsky, P.L., Redner, S., Leyvraz, F.: Connectivity of growing random networks. Physical review letters 85(21), 4629 (2000)

    work page 2000

  34. [34]

    Europhysics letters 61(4), 567 (2003)

    Jeong, H., Nda, Z., Barabsi, A.-L.: Measuring preferential attachment in evolving networks. Europhysics letters 61(4), 567 (2003)

    work page 2003

  35. [35]

    In: Proceedings of the 5th Annual ACM Web Science Conference, pp

    Kunegis, J., Blattner, M., Moser, C.: Preferential attachment in online networks: Measurement and explanations. In: Proceedings of the 5th Annual ACM Web Science Conference, pp. 205–214 (2013) 17

    work page 2013

  36. [36]

    Personal and ubiquitous computing 10, 255–268 (2006)

    Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Personal and ubiquitous computing 10, 255–268 (2006)

    work page 2006

  37. [37]

    In: Proceedings of the 3rd International Workshop on Link Discovery, pp

    Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 36–43 (2005)

    work page 2004

  38. [38]

    In: Proceedings of the AAAI Conference on Artificial Intelligence, vol

    Rossi, R., Ahmed, N.: The network data repository with interactive graph ana- lytics and visualization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 29 (2015)

    work page 2015

  39. [39]

    In: Proceedings of the 25th International Conference on World Wide Web, pp

    Yin, M., Gray, M.L., Suri, S., Vaughan, J.W.: The communication network within the crowd. In: Proceedings of the 25th International Conference on World Wide Web, pp. 1293–1303 (2016)

    work page 2016

  40. [40]

    In: Proceedings of the 22nd International Conference on World Wide Web, pp

    Kunegis, J.: Konect: the koblenz network collection. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 1343–1350 (2013)

    work page 2013

  41. [41]

    In: 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, pp

    Massa, P., Salvetti, M., Tomasoni, D.: Bowling alone and trust decline in social network sites. In: 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing, pp. 658–663 (2009)

    work page 2009

  42. [42]

    In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp

    Rozemberczki, B., Sarkar, R.: Characteristic functions on graphs: Birds of a feather, from statistical descriptors to parametric models. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 1325–1334 (2020)

    work page 2020

  43. [43]

    In: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp

    Rozemberczki, B., Davies, R., Sarkar, R., Sutton, C.: Gemsec: Graph embed- ding with self clustering. In: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 65–72 (2019)

    work page 2019

  44. [44]

    In: Proceedings of the 17th ACM SIGKDD Inter- national Conference on Knowledge Discovery and Data Mining, pp

    Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: Proceedings of the 17th ACM SIGKDD Inter- national Conference on Knowledge Discovery and Data Mining, pp. 1082–1090 (2011)

    work page 2011

  45. [45]

    Advances in neural information processing systems 25 (2012)

    Leskovec, J., Mcauley, J.: Learning to discover social circles in ego networks. Advances in neural information processing systems 25 (2012)

    work page 2012

  46. [46]

    Physical Review EStatistical, Nonlinear, Soft Matter Physics 74(3), 036104 (2006)

    Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Physical Review EStatistical, Nonlinear, Soft Matter Physics 74(3), 036104 (2006)

    work page 2006

  47. [47]

    In: Proceedings of the 22nd International Conference on World Wide Web, pp

    ˇSubelj, L., Bajec, M.: Model of complex networks based on citation dynamics. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 527–530 (2013) 18

    work page 2013

  48. [48]

    ACM Trans

    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2 (2007)

    work page 2007

  49. [49]

    Proceedings of the national academy of sciences 98(2), 404–409 (2001)

    Newman, M.E.: The structure of scientific collaboration networks. Proceedings of the national academy of sciences 98(2), 404–409 (2001)

    work page 2001

  50. [50]

    In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp

    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 177–187 (2005)

    work page 2005

  51. [51]

    In: International Conference on Business Information Systems, pp

    Michalski, R., Palus, S., Kazienko, P.: Matching organizational structure and social network extracted from email communication. In: International Conference on Business Information Systems, pp. 197–206 (2011)

    work page 2011

  52. [52]

    Guimera, R., Danon, L., Diaz-Guilera, A., Giralt, F., Arenas, A.J.P.r.E.: Self- similar community structure in a network of human interactions 68(6), 065103 (2003)

    work page 2003

  53. [53]

    Jeong, H., Mason, S.P., Barabsi, A.-L., Oltvai, Z.N.J.N.: Lethality and centrality in protein networks 411(6833), 41–42 (2001)

    work page 2001

  54. [54]

    Molecular systems biology 3(1), 89 (2007)

    Ewing, R.M., Chu, P., Elisma, F., Li, H., Taylor, P., Climie, S., McBroomCera- jewski, L., Robinson, M.D., O’Connor, L., Li, M.: Largescale mapping of human proteinprotein interactions by mass spectrometry. Molecular systems biology 3(1), 89 (2007)

    work page 2007

  55. [55]

    Nature 437(7062), 1173–1178 (2005)

    Rual, J.-F., Venkatesan, K., Hao, T., Hirozane-Kishikawa, T., Dricot, A., Li, N., Berriz, G.F., Gibbons, F.D., Dreze, M., Ayivi-Guedehoussou, N.: Towards a proteome-scale map of the human proteinprotein interaction network. Nature 437(7062), 1173–1178 (2005)

    work page 2005

  56. [56]

    Nucleic acids research 42(W1), 76–82 (2014)

    Cho, A., Shin, J., Hwang, S., Kim, C., Shim, H., Kim, H., Kim, H., Lee, I.: Wormnet v3: a network-assisted hypothesis-generating server for caenorhabditis elegans. Nucleic acids research 42(W1), 76–82 (2014)

    work page 2014

  57. [57]

    Proceedings of the National Academy of Sciences 105(35), 12763–12768 (2008)

    Singh, R., Xu, J., Berger, B.: Global alignment of multiple protein interaction networks with application to functional orthology detection. Proceedings of the National Academy of Sciences 105(35), 12763–12768 (2008)

    work page 2008

  58. [58]

    Knuth, D.E.: The Stanford GraphBase: a Platform for Combinatorial Computing vol. 1. ACM Press, New York, NY, USA (1993)

    work page 1993

  59. [59]

    Advances in complex systems 6(04), 565–573 (2003)

    Gleiser, P.M., Danon, L.: Community structure in jazz. Advances in complex systems 6(04), 565–573 (2003)

    work page 2003

  60. [60]

    Marvel Universe looks almost like a real social network

    Alberich, R., Miro-Julia, J., Rossell, F.: Marvel universe looks almost like a real 19 social network. arXiv preprint cond-mat/0202174 (2002)

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  61. [61]

    Proceedings of the IEEE 104(1), 148–175 (2015)

    Shahriari, B., Swersky, K., Wang, Z., Adams, R.P., De Freitas, N.: Taking the human out of the loop: A review of bayesian optimization. Proceedings of the IEEE 104(1), 148–175 (2015)

    work page 2015

  62. [62]

    In: Sixth International Conference on Computer Vision (IEEE Cat

    Rubner, Y., Tomasi, C., Guibas, L.J.: A metric for distributions with applica- tions to image databases. In: Sixth International Conference on Computer Vision (IEEE Cat. No. 98CH36271), pp. 59–66 (1998)

    work page 1998

  63. [63]

    An, K.J.G.D.I.D.A.: Sulla determinazione empirica di una legge didistribuzione 4, 89–91 (1933)

    work page 1933

  64. [64]

    Smirnov, N.V.: On the estimation of the discrepancy between empirical curves of distribution for two independent samples. Bull. Math. Univ. Moscou 2(2), 3–14 (1939)

    work page 1939

  65. [65]

    IEEE Transactions on Information theory 37(1), 145–151 (1991) 20 Appendix A Fitting Performance of Models Fig

    Lin, J.: Divergence measures based on the shannon entropy. IEEE Transactions on Information theory 37(1), 145–151 (1991) 20 Appendix A Fitting Performance of Models Fig. A1 : Comparison of degree distribution probabilities between the optimal result network of vari-linear network model and the real network (with EMD metric as the optimization objective). ...

    work page 1991