Pith. sign in

REVIEW 4 major objections 6 minor 1 cited by

Urn Modeling of Random Graphs Across Granularity Scales: A Framework for Origin-Destination Human Mobility Networks

T0 review · 4 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read This paper claims that, in the large sparse limit, three ways of generating origin-destination mobility networks—exact enumeration, independent edge probabilities, and continuum graphons—are asymptotically equivalent and share one…

desk verdict A useful synthesis of urn and random-graph methods for OD mobility, with a few new closed-form formulas and a real scaling error in the central equivalence proof that should be fixed before publication. read the letter →

arxiv 2508.18544 v1 pith:K65UCHMQ submitted 2025-08-25 physics.soc-ph cs.SI

Fabio Vanni , David Lambert This is my paper · ORCID
classification physics.soc-phcs.SI MSC 05C8060C0590B2091D10 PACS 89.75.-k05.40.-a89.65.Lm
keywords origin-destinationnetworksballs-into-binsmodelsinhomogeneousrandomgraphswithlatentvariablesoccupancyandloadproblemshumanmobilitymodelingmixedPoissondistributiongraphonlargedeviationsoverflowcongestion
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 tries to establish that human mobility flows can be described as a balls-into-bins allocation—trips are balls, destination locations are bins—and that the resulting origin-destination network has the same large-scale statistics at three levels of description: an exact enumerative ensemble, a probabilistic independent-edge ensemble, and a continuum graphon ensemble. Under the large-sparse regime these three representations converge to a single asymptotic law: the number of visits to a destination with attractiveness $x$ is Poisson with mean $n\nu_x$, so the degree (visit) distribution is the mixture $P_n(k)=\int (n\nu_x)^k e^{-n\nu_x}\rho(x)\,dx/k!$. If correct, the equivalence lets planners generate synthetic OD networks at the cheapest scale and still reproduce exact constrained statistics, and it turns vacancy, coverage, and overflow into closed-form formulas. The paper verifies the asymptotics with Monte Carlo simulations of fine- and coarse-grained ensembles using a gravity-like kernel calibrated on empirical OD data.

What carries the argument

The load-bearing object is the urn allocation of distinguishable trip-balls into destination-bins, expressed at three resolutions. The fine-grained ensemble is the multivariate hypergeometric allocation with capacities $m_{ij}$; the coarse-grained ensemble is the product of binomials conditioned on the total number of links; the continuum ensemble is the empirical graphon with kernel $\kappa(x,y)$ and fixed mass $n/N$. The identity that carries the argument is the asymptotic equality of their configuration probabilities, $P_C(A\mid n)\sim n!\prod_{i,j}\pi_{ij}^{a_{ij}}/a_{ij}!\sim P_m(A)$, together with the large-deviation equivalence $P_C(A\mid n)\leftrightarrow P^{\aleph}(\tilde A\mid\|\tilde A\|_1=n/N)\asymp e^{-N D(\tilde A\|\ell\kappa)}$, which lets integrals replace combinatorics in the occupancy and load formulas.

What would settle it

For a sequence with $N\to\infty$, $n/N$ held fixed and $n/N^2\to 0$, generate many single realizations of the coarse-grained ensemble with the calibrated kernel $\kappa(x,y)=x^{5/6}y^{3/4}$, $\rho(x)\propto x^{-2}$, and $\phi(y)=0.2e^{-0.2y}$, and measure the variance across realizations of the empirical occupancy fraction $N_k/N$ for each $k$. If that variance does not tend to zero as $N$ grows, or if the ensemble average drifts from $P_n(k)=\int (n\nu_x)^k e^{-n\nu_x}\rho(x)\,dx/k!$, the self-averaging step fails and the law is not typical of single networks.

Watch

Extended reading notes

Core claim

The central discovery is an equivalence result: in the sparse limit with many nodes, the conditional coarse-grained ensemble of independent edge probabilities, the fine-grained multivariate hypergeometric ensemble, and a continuum graphon with fixed total mass describe the same random graph. The coarse-grained probability of a configuration with $n$ links is $n!\prod_{i,j} \pi_{ij}^{a_{ij}}/a_{ij}!$ up to vanishing corrections, and the continuum limit replaces sums by integrals with a large-deviation rate functional given by the relative entropy $D(\tilde A\|\ell\kappa)$ between the empirical graphon and the kernel. Consequently the occupancy problem—how many destinations receive exactly $k$ visits—is asymptotically a mixed Poisson law (Theorem 5), with the per-destination rate $n\nu_x$ set by the destination's attractiveness and the normalized kernel. The same equivalence yields expressions for the fraction of empty destinations, the stopping time until a target number of destinations remain unvisited, and expected overflow beyond capacity; in the calibrated gravity case the degree tail is a power law with exponent $\mu=1+(\eta-1)/\alpha\approx 2.2$.

Load-bearing premise

The central claim rests on the self-averaging assumption that a single large network behaves statistically like the average over many networks; if fluctuations around the ensemble average stay sizable in the sparse heterogeneous regime, the mixed-Poisson formulas describe only averages over realizations, not typical synthetic networks.

Editorial extensions

If this is right

  • In the sparse regime the fine-grained capacity-constrained ensemble can be replaced by the coarse-grained conditional multinomial ensemble without changing the large-scale statistics, so synthetic OD networks can be generated by lightweight categorical sampling instead of exact hypergeometric enumeration.
  • The visit (in-degree) distribution of gravity-like mobility networks has a fat tail with exponent $\mu=1+(\eta-1)/\alpha$; with the calibrated exponents $\eta=2$ and $\alpha=5/6$ this predicts $\mu\approx 2.2$, in agreement with the simulations.
  • The expected fraction of never-visited destinations after $n$ trips decays as $\rho_0 a^{1-\eta}/(\alpha \nu_0 a^\alpha)\cdot e^{-\nu_0 a^\alpha n}/n$, so accessibility gaps close exponentially fast once the least attractive destination is regularly reached.
  • The coverage time until exactly $b$ destinations remain empty is $E[T_b]=(\nu_0 a^\alpha)^{-1}W(N\rho_0 a^{-(\eta-1)}/(\alpha b))+O(N)$, reducing the coupon-collector problem to a Lambert-$W$ evaluation.
  • Expected overflow beyond capacity grows linearly in total trips with a negative logarithmic correction; for the calibrated case $E[R]\sim n(1+O(n/\log n))$ for large $n$, giving a closed-form congestion forecast.

Reading between the lines

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

  • I infer that the mixed-Poisson occupancy law is not special to mobility: any sparse inhomogeneous random graph with an integrable kernel and self-averaging latent variables should show the same degree law, so the toolkit transfers to trade flows, migration, or communication networks.
  • I infer a model-selection recipe the paper does not develop: given an observed OD matrix $A$, minimize the relative entropy $D(A/N\|\ell\kappa)$ over kernel parameters, since that rate functional ranks how atypical a flow matrix is under the model and could replace or complement gravity-model calibration.
  • I infer from the overflow threshold $x^\star(n)=(n\nu_0/C_0)^{1/(1-\alpha)}$ that when capacity scales linearly with attractiveness but arrival rate scales sublinearly, congestion appears first at low-attractiveness destinations rather than hubs—a policy-relevant consequence the paper leaves implicit.
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.

Referee Report

4 major / 6 minor

Summary. The paper proposes a unified three-scale framework for directed origin-destination mobility networks, modeled as balls into bins. The three scales are a fine-grained multivariate hypergeometric (enumerative) ensemble, a coarse-grained product-of-binomials (canonical) ensemble, and a continuum graphon ensemble with latent variables. The central claim is that, in a large sparse regime, the three ensembles are asymptotically equivalent, and that the occupancy/degree distribution converges to a universal mixed Poisson law. The paper also derives formulas for vacancy, coverage, and overflow, and reports Monte Carlo simulations with gravity-like kernels, using parameters imported from the first author's earlier empirical study [12].

Significance. If the main equivalence theorem were established, the framework would provide a useful bridge between exact combinatorial allocation models and continuum graphon analysis for synthetic OD-network generation and congestion diagnostics. The paper has several strengths: the model formulation is original and clearly connected to inhomogeneous random graph theory; the simulations in Section 5 cover both coarse- and fine-grained generative algorithms; and the quantitative predictions are tested against the analytical formulas rather than merely illustrated. Importantly, the parameters alpha, beta, eta, and lambda are not fitted to the asymptotic formulas in this paper but are taken from [12], so the simulation agreement is not circular. The main obstacle is that the proof of the central renormalization theorem contains a normalization inconsistency in the graphon mass, and the statement of Theorem 1 contains contradictory sparsity conditions. The final mixed-Poisson law may be recoverable from standard inhomogeneous-random-graph results, but the paper's proof as written does not establish it.

major comments (4)
  1. [Section 2.3, Eq. (6), Theorem 2, and Theorem 5] The mass of the empirical graphon is inconsistent with the fixed-mass constraint in Theorem 2. Equation (6) defines a_ij^(ell) ~ Binomial(ell, kappa(x_i,y_j)/(ell N)), so E[a_ij] = kappa(x_i,y_j)/N and therefore E||A_tilde_N||_1 = (1/N) sum_{i,j} E[a_ij] -> ||kappa||_1, with no factor of ell. Theorem 2, however, imposes ||A_tilde_N||_1 = ell||kappa||_1 = n/N. These two masses agree only in the special case ell = 1, which is incompatible with the sparse regime n = O(N) and ell = n/N used elsewhere. The proof of Theorem 2 compounds the problem by setting ell := n/N while omitting the factor 1/||kappa||_1 when equating D(A/n || pi) and D(A/N || ell kappa). Since Theorem 5 explicitly derives the normalization nu_x = (1/(N||kappa||_1)) integral kappa(x,y) phi(y) dy from Theorem 2, the proof of the central mixed-Poisson statement, Eq. (12), is not valid as written. The authors need to choose one consistent graphon normalization, either rescaling A_tilde_N or changing the definition of the binomial multiplicity, and then re-derive the rate functional and the constraint.
  2. [Theorem 1 statement and Corollary 1.1] The stated assumptions of Theorem 1 are internally inconsistent. The coarse-grained regime requires ell >> 1, p_ij << 1, and ell sum_{i,j} p_ij << 1, but Corollary 1.1 gives ell = E[n] / sum p_ij, so ell sum_{i,j} p_ij = E[n], which is of order n and hence >> 1 under the fine-grained condition n >> 1. The proof in Appendix A.1 actually uses the condition ell sum p_ij^2 << 1, which is plausibly what was intended. The fine-grained condition 'n >> 1, N -> infinity, and n << n' is also not meaningful; it should presumably be n << N^2 or n << NM. As printed, the central equivalence theorem has no consistent set of hypotheses, and the statement must be corrected before the theorem can be cited.
  3. [Proposition 6 and Eq. (19)] The overflow formula in Proposition 6 is off by one. For a nonnegative integer-valued load Y, E[(Y-C)_+] = sum_{k=C+1}^infty P(Y >= k) = sum_{k=C+1}^infty sum_{j=k}^infty P(Y = j). The displayed formula uses an inner sum starting at j = k+1, which computes sum_{k=C+1}^infty P(Y >= k+1) = E[(Y-C-1)_+]. The outer summation upper limit N is also unjustified, since the Poisson variable Y is not bounded by the number of bins N; the sum should run to infinity. Because the overflow formulas in Section 5 are compared quantitatively with simulations, this indexing error affects the claimed numerical agreement and must be corrected.
  4. [Remark 2 and Section 3.2 (self-averaging)] The mixed-Poisson degree distribution is presented as describing the typical outcome of a single synthetic network, but the justification is delegated to an unproved self-averaging assumption. Remark 2 states that the empirical degree distribution converges in probability to the ensemble average and then says the proof is omitted because it 'closely parallels the standard case.' This is load-bearing: the continuum predictions in Eq. (12) and the simulations in Section 5 concern individual realizations, not ensemble averages. The paper should either prove concentration of the empirical occupancy distribution under the stated kernel conditions or explicitly invoke and verify a known theorem for inhomogeneous random graphs, such as the Bollobas-Janson-Riordan convergence theorem, with the required integrability conditions checked for the Pareto/exponential kernels used in the paper.
minor comments (6)
  1. [Section 5, occupancy paragraph] The sentence 'in the particular case of simulations with parameters eta = 2 and beta = 5/6' should refer to alpha = 5/6, since the power-law exponent mu = 1 + (eta - 1)/alpha is derived from alpha; as printed, the beta notation is inconsistent with the preceding definition beta = 3/4.
  2. [Remark 1, Eq. (8)] The summation index in Eq. (8) is written as m, although the sum runs over destination bins; this should be N (or the bin index set), and the 'n << n' condition in the same remark repeats the typo from Theorem 1.
  3. [Footnote 1] The definition of proportionate stratified sampling appears inconsistent: after defining weights w_h = M_h/M, the text states sum_h w_h = n, but the weights should sum to 1; the sample-size allocation should be n_h = w_h n with sum_h n_h = n.
  4. [Section 3.2, Remark 2] The remark says the degree distribution is a 'compound Poisson law,' but the displayed formula Eq. (10) is a mixed Poisson law (Poisson mean randomized by latent type). These are different notions, and the terminology should be corrected.
  5. [Section 4.2, Proposition 7] The step replacing E[(Z(x)-C(x))_+] by max(lambda(x)-C(x),0) for a Poisson variable is not generally valid when lambda(x) is close to C(x); it requires a stated asymptotic regime (lambda large and boundary-layer contribution negligible). The proof should quantify the error, since the formula is then used to produce Eq. (28).
  6. [Reproducibility] The paper refers to 'purpose-built code' and reports Monte Carlo results over S = 50 realizations, but no code or data repository is provided, and the figures do not show error bars or confidence bands, which would help verify the claimed agreement with the analytical predictions.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the model parameters are imported empirical constants, and the mixed-Poisson occupancy law is derived from the stated allocation assumptions rather than from the predicted observables.

full rationale

The derivation chain is self-contained at the level of the paper's stated model. Theorem 1 shows the fine- and coarse-grained ensembles are asymptotically multinomial; Proposition 3 and Theorem 2 connect the graphon large-deviation principle to the discrete ensembles; Proposition 4 and Theorem 5 give the mixed-Poisson occupancy law. Each step is justified by standard asymptotics (Poissonization, Sanov/Gartner-Ellis, inhomogeneous random graph theory) or by explicit algebra, and the target quantities (occupancy, vacancy, coverage, overflow) are not used to define the model parameters. The empirical constants alpha=5/6, beta=3/4, eta=2, lambda=0.2 are imported from the first author's earlier empirical study [12], not fitted here; the predicted exponent mu=1+(eta-1)/alpha and the vacancy/overflow scalings are computed from those constants, so no fitted input is renamed as a prediction. The normalization nu_x is defined as a kernel integral and lambda(x|n)=n*nu_x; the Poisson mixture is a standard consequence of independent per-trip allocations with those probabilities, not a circular re-statement of the definition. A separate concern is that the proof of Theorem 2 sets ell := ||A||_1 and appears to have a mass-normalization inconsistency with the empirical graphon definition in Eq. (6); this is a correctness issue in the argument, not a circularity, because it does not make the conclusion equivalent to its inputs by construction.

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

The central claim rests on the latent-variable specification and parameters imported from the authors' prior empirical work [12], on standard asymptotic tools (Stirling, Poissonization, Sanov, Laplace), and on concentration assumptions (self-averaging and a balanced regime) that are not all stated in the propositions where they are used.

free parameters (4)
  • α (destination attractiveness kernel exponent) = 5/6
    Taken from the authors' earlier empirical study [12]; used in κ(x,y)=x^α y^β and in the predicted degree exponent μ=1+(η-1)/α.
  • β (origin trip-generation kernel exponent) = 3/4
    From [12]; used in the link propensity p_ij=x_i^α y_j^β.
  • η (Pareto exponent for attractiveness) = 2
    From [12]; determines the power-law tail of the degree distribution and the natural cutoff scaling.
  • λ (exponential rate for trip-generation potential) = 0.2
    From [12]; determines the density φ(y)=λ e^{-λy}.
assumptions (6)
  • standard math Stirling's approximation, Poisson limit of binomials, and multinomial convergence are applied to the ensembles.
    Used in the proofs of Theorem 1, Theorem 3, and Remark 1 (Appendices A.1, A.3, A.4).
  • standard math Sanov's theorem and the Gärtner-Ellis theorem establish the large-deviation principle for the empirical graphon.
    Used in Proposition 3 and Theorem 2.
  • domain assumption Latent variables x_i and y_i are i.i.d. from μ_X and μ_Y and mutually independent.
    Introduced in Section 2.3; the entire continuum model and mixed-Poisson law rest on this independence.
  • domain assumption The mobility kernel is multiplicative κ(x,y)=x^α y^β with Pareto and exponential marginal densities as estimated in [12].
    Section 5; the simulations and all specific formulas depend on these functional forms and fitted parameters.
  • domain assumption Self-averaging: a single large realization's macroscopic statistics match ensemble averages.
    Invoked in Remark 2 and in Section 2.3 to replace empirical observables by their expectations; load-bearing for the typical-network claims.
  • domain assumption The balanced-regime condition 0<C<Nν_i<D ensures Laplace-method coverage asymptotics.
    Appendix A.5 uses this condition for E[T_b]=n_b+Θ(N), but Proposition 5 does not state it; the heavy-tailed simulation kernel likely violates it.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Urn Modeling of Random Graphs Across Granularity Scales: A Framework for Origin-Destination Human Mobility Networks." pith.science (2026). https://pith.science/paper/K65UCHMQ

@misc{pith2026250818544,
  author       = {Pith},
  title        = {Pith review of: Urn Modeling of Random Graphs Across Granularity Scales: A Framework for Origin-Destination Human Mobility Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/K65UCHMQ}},
  note         = {Machine review of arXiv:2508.18544}
}
read the original abstract

We model human mobility as a combinatorial allocation process, treating trips as distinguishable balls assigned to location-bins and generating origin-destination (OD) networks. From this analogy, we construct a unified three-scale framework, enumerative, probabilistic, and continuum graphon ensembles, and prove a renormalization theorem showing that, in the large sparse regime, these representations converge to a universal mixed-Poisson law. The framework yields compact formulas for key mobility observables, including destination occupancy, vacancy of unvisited sites, coverage (a stopping-time extension of the coupon collector problem), and overflow beyond finite capacities. Simulations with gravity-like kernels, calibrated on empirical OD data, closely match the asymptotic predictions. By connecting exact combinatorial models with continuum analysis, the results offer a principled toolkit for synthetic network generation, congestion assessment, and the design of sustainable urban mobility policies.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Measuring What the Crawler Sees: Discovery Curves, Core Persistence, and Shell Dynamics in Longitudinal Web Crawls

    physics.soc-ph 2026-07 conditional novelty 6.0 of 10

    A two-observable urn model — pairwise containment plus a new closed-form discovery curve — recovers crawl coverage, persistence, and a core/shell split, but the shell residual shows the model is still incomplete.

Reference graph

Works this paper leans on

56 extracted references · 55 canonical work pages · cited by 1 Pith paper

  1. [12]

    F. Vanni, A visit generation process for human mobility random graphs with location-specific latent-variables: From land use to travel demand, Chaos, Solitons & Fractals 185 (2024) 115175

    work page 2024

  2. [1]

    Barthelemy, The structure and dynamics of cities, Cambridge University Press, 2016

    M. Barthelemy, The structure and dynamics of cities, Cambridge University Press, 2016

    work page 2016

  3. [2]

    L. M. Bettencourt, Introduction to urban science (2021)

    work page 2021

  4. [3]

    Y. Du, T. Aoki, N. Fujiwara, Unveiling realistic mobility patterns with home–origin–destination data aggregation, The European Physical Journal Plus 139 (5) (2024) 403

    work page 2024

  5. [4]

    Barth´ elemy, Spatial networks, Physics reports 499 (1-3) (2011) 1–101

    M. Barth´ elemy, Spatial networks, Physics reports 499 (1-3) (2011) 1–101

    work page 2011

  6. [5]

    Barbosa, M

    H. Barbosa, M. Barthelemy, G. Ghoshal, C. R. James, M. Lenormand, T. Louail, R. Menezes, J. J. Ramasco, F. Simini, M. Tomasini, Human mobility: Models and applications, Physics Reports 734 (2018) 1–74

    2018

  7. [6]

    T. Aoki, S. Fujishima, N. Fujiwara, Urban spatial structures from human flow by hodge–kodaira decomposition, Scientific reports 12 (1) (2022) 11258

    work page 2022

  8. [7]

    Chan, Location theory and decision analysis, Springer, 2001

    Y. Chan, Location theory and decision analysis, Springer, 2001

    work page 2001

Show all 56 references
  1. [8]

    de Dios Ort´ uzar, L

    J. de Dios Ort´ uzar, L. G. Willumsen, Modelling transport, John wiley & sons, 2024

    2024

  2. [9]

    Casiraghi, V

    G. Casiraghi, V. Nanumyan, Configuration models as an urn problem, Scientific Reports 11 (1) (2021) 13416

    2021

  3. [10]

    Armenter, M

    R. Armenter, M. Koren, A balls-and-bins model of trade, American Economic Review 104 (7) (2014) 2127–2151

    2014

  4. [11]

    Nie, Z.-D

    W.-P. Nie, Z.-D. Zhao, S.-M. Cai, T. Zhou, Understanding the urban mobility community by taxi travel trajectory, Communications in Nonlinear Science and Numerical Simulation 101 (2021) 105863

    2021

  5. [13]

    Cimini, T

    G. Cimini, T. Squartini, F. Saracco, D. Garlaschelli, A. Gabrielli, G. Caldarelli, The statistical physics of real-world networks, Nature Reviews Physics 1 (1) (2019) 58–71

    2019

  6. [14]

    Bianconi, Entropy of network ensembles, Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 79 (3) (2009) 036114

    G. Bianconi, Entropy of network ensembles, Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 79 (3) (2009) 036114

    2009

  7. [15]

    Farkas, I

    I. Farkas, I. Der´ enyi, G. Palla, T. Vicsek, Equilibrium statistical mechanicsof network structures, in: Complex networks, Springer, 2004, pp. 163–187

    2004

  8. [16]

    Hartle, F

    H. Hartle, F. Papadopoulos, D. Krioukov, Dynamic hidden-variable network models, Physical Review E 103 (5) (2021) 052307

    2021

  9. [17]

    Bollob´ as, S

    B. Bollob´ as, S. Janson, O. Riordan, The phase transition in inhomogeneous random graphs, Random Structures & Algorithms 31 (1) (2007) 3–122

    2007

  10. [18]

    Mitzenmacher, E

    M. Mitzenmacher, E. Upfal, Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis, Cambridge university press, 2017

    2017

  11. [19]

    Sevast’Yanov, Poisson limit law for a scheme of sums of dependent random variables, Theory of Probability & Its Applications 17 (4) (1973) 695–699

    B. Sevast’Yanov, Poisson limit law for a scheme of sums of dependent random variables, Theory of Probability & Its Applications 17 (4) (1973) 695–699

    1973

  12. [20]

    Schneider, Gravity models and trip distribution theory, Papers in Regional Science 5 (1) (1959) 51–56

    M. Schneider, Gravity models and trip distribution theory, Papers in Regional Science 5 (1) (1959) 51–56

    1959

  13. [21]

    A. Sen, T. E. Smith, Gravity models of spatial interaction behavior, Springer Science & Business Media, 2012

    2012

  14. [22]

    Di Vece, D

    M. Di Vece, D. Garlaschelli, T. Squartini, Gravity models of networks: Integrating maximum-entropy and econometric approaches, Physical Review Research 4 (3) (2022) 033105

    2022

  15. [23]

    Guimer` a, I

    R. Guimer` a, I. Reichardt, A. Aguilar-Mogas, F. A. Massucci, M. Miranda, J. Pallar` es, M. Sales-Pardo, A bayesian machine scientist to aid in the solution of challenging scientific problems, Science advances 6 (5) (2020) eaav6971

    2020

  16. [24]

    Cabanas-Tirapu, L

    O. Cabanas-Tirapu, L. Dan´ us, E. Moro, M. Sales-Pardo, R. Guimer` a, Human mobility is well described by closed-form gravity-like models learned automatically from data, Nature Communications 16 (1) (2025) 1336

    2025

  17. [25]

    Anand, G

    K. Anand, G. Bianconi, Entropy measures for networks: Toward an information theory of complex topologies, Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 80 (4) (2009) 045102

    2009

  18. [26]

    J. Park, M. E. Newman, Statistical mechanics of networks, Physical Review E—Statistical, Nonlinear, and Soft Matter Physics 70 (6) (2004) 066117

    2004

  19. [27]

    A. C. Coolen, A. Annibale, E. S. Roberts, Generating random networks and graphs, Oxford university press, 2017

    2017

  20. [28]

    D. Lee, B. Kahng, Y. Cho, K.-I. Goh, D.-S. Lee, Recent advances of percolation theory in complex networks, Journal of the Korean Physical Society 73 (2) (2018) 152–164

    2018

  21. [29]

    Squartini, D

    T. Squartini, D. Garlaschelli, Maximum-entropy networks: Pattern detection, network reconstruction and graph combi- natorics, Springer, 2017

    2017

  22. [30]

    S. N. Dorogovtsev, J. F. Mendes, The Nature of Complex Networks, Oxford University Press, 2022

    2022

  23. [31]

    Bianconi, The entropy of randomized network ensembles, Europhysics Letters 81 (2) (2007) 28005

    G. Bianconi, The entropy of randomized network ensembles, Europhysics Letters 81 (2) (2007) 28005

    2007

  24. [32]

    Janson, A

    S. Janson, A. Rucinski, T. Luczak, Random graphs, John Wiley & Sons, 2011

    2011

  25. [33]

    Bollob´ as, Random graphs, in: Modern graph theory, Springer, 1998, pp

    B. Bollob´ as, Random graphs, in: Modern graph theory, Springer, 1998, pp. 215–252

    1998

  26. [34]

    T. S. Turova, Survey of scalings for the largest connected component in inhomogeneous random graphs, in: Random Walks, Boundaries and Spectra, Springer, 2011, pp. 259–275

    2011

  27. [35]

    Glasscock, What is

    D. Glasscock, What is... a graphon, Notices of the AMS 62 (1) (2015) 46–48

    2015

  28. [36]

    Dembo, Large deviations techniques and applications, Springer, 2009

    A. Dembo, Large deviations techniques and applications, Springer, 2009

    2009

  29. [37]

    L´ eonard, Large deviations for poisson random measures and processes with independent increments, Stochastic processes and their applications 85 (1) (2000) 93–121

    C. L´ eonard, Large deviations for poisson random measures and processes with independent increments, Stochastic processes and their applications 85 (1) (2000) 93–121

    2000

  30. [38]

    Johnson, S

    N. Johnson, S. Kotz, Urn Models and Their Application: An Approach to Modern Discrete Probability Theory, Approach to Modern Discrete Probability Theory, Wiley, 1977

    1977

  31. [39]

    Feller, et al., An introduction to probability theory and its applications (1971)

    W. Feller, et al., An introduction to probability theory and its applications (1971)

    1971

  32. [40]

    S. Roy, S. M. Bhattacharjee, Is small-world network disordered?, Physics Letters A 352 (1-2) (2006) 13–16

    2006

  33. [41]

    A. D. Barbour, L. Holst, S. Janson, Poisson approximation, Oxford University Press, 1992. 37

    1992

  34. [42]

    Holst, Some asymptotic results for occupancy problems, The Annals of Probability 5 (6) (1977) 1028–1035

    L. Holst, Some asymptotic results for occupancy problems, The Annals of Probability 5 (6) (1977) 1028–1035

    1977

  35. [43]

    B. Kim, K. H. Lee, L. Xue, X. Niu, A review of dynamic network models with latent variables, Statistics surveys 12 (2018) 105

    2018

  36. [44]

    Rastelli, N

    R. Rastelli, N. Friel, A. E. Raftery, Properties of latent variable network models, Network Science 4 (4) (2016) 407–432

    2016

  37. [45]

    Bogun´ a, R

    M. Bogun´ a, R. Pastor-Satorras, A. Vespignani, Cut-offs and finite size effects in scale-free networks, The European Physical Journal B 38 (2004) 205–209

    2004

  38. [46]

    M. A. Chaudhry, S. M. Zubair, Generalized incomplete gamma functions with applications, Journal of Computational and Applied Mathematics 55 (1) (1994) 99–124

    1994

  39. [47]

    Jacob, K

    R. Jacob, K. Harikrishnan, R. Misra, G. Ambika, Measure for degree heterogeneity in complex networks and its application to recurrence network analysis, Royal Society open science 4 (1) (2017) 160757

    2017

  40. [48]

    B. K. Fosdick, D. B. Larremore, J. Nishimura, J. Ugander, Configuring random graph models with fixed degree sequences, Siam Review 60 (2) (2018) 315–355

    2018

  41. [49]

    Squartini, J

    T. Squartini, J. de Mol, F. den Hollander, D. Garlaschelli, Breaking of ensemble equivalence in networks, Physical review letters 115 (26) (2015) 268701

    2015

  42. [50]

    Giuffrida, T

    F. Giuffrida, T. Squartini, P. Gr¨ unwald, D. Garlaschelli, Description length of canonical and microcanonical models, arXiv preprint arXiv:2307.05645 (2023)

    2023 arXiv

  43. [51]

    De Domenico, A

    M. De Domenico, A. Sol´ e-Ribalta, E. Cozzo, M. Kivel¨ a, Y. Moreno, M. A. Porter, S. G´ omez, A. Arenas, Mathematical formulation of multilayer networks, Physical Review X 3 (4) (2013) 041022

    2013

  44. [52]

    Caldarelli, L

    G. Caldarelli, L. Chiesi, G. Chirici, B. Galmarini, S. Mancuso, J. Moi, M. De Domenico, Lessons from complex networks to smart cities, Nature Cities (2025) 1–8

    2025

  45. [53]

    Hanneke, W

    S. Hanneke, W. Fu, E. P. Xing, Discrete temporal models of social networks, Electronic journal of statistics 4 (2010) 585–605

    2010

  46. [54]

    Zhang, C

    X. Zhang, C. Moore, M. E. Newman, Random graph models for dynamic networks, The European Physical Journal B 90 (10) (2017) 1–14

    2017

  47. [55]

    Bayati, J

    M. Bayati, J. H. Kim, A. Saberi, A sequential algorithm for generating random graphs, Algorithmica 58 (4) (2010) 860–910

    2010

  48. [56]

    van Ieperen, I

    F. van Ieperen, I. Kryven, Sequential stub matching for uniform generation of directed graphs with a given degree sequence, arXiv preprint arXiv:2103.15958 (2021). 38

    2021 arXiv

Pith tools

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