Pith. sign in

REVIEW 3 major objections 5 minor 144 references

Stochastic processes on preferential attachment models

T0 review · 3 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read Preferential attachment networks converge locally to one random Pólya tree

desk verdict Solid local convergence proof for model (A), but the extension to (B) and (D) is asserted, not shown, and Part II is invisible in this draft. read the letter →

arxiv 2411.14111 v1 pith:TS2OLHI7 submitted 2024-11-21 math.PR

Rounak Ray This is my paper · ORCID
classification math.PR MSC 05C8060J8060K3582B20
keywords preferentialattachmentlocalconvergencerandomPólyapointtreeurnpercolationthresholdspectralradiusIsingmodelpower-lawdegreedistribution
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

This thesis tries to establish that the local geometry of preferential attachment networks is universal: for a broad class of affine models with i.i.d. random out-degrees and attractiveness parameter $\delta > -\inf \mathrm{supp}(M)$, the neighborhood of a uniformly chosen vertex converges in probability to one infinite random tree, the random Pólya point tree. It claims this for three standard model variants, (A), (B), and (D), extending earlier fixed-out-degree results to random out-degrees and negative $\delta$. The same local limit is then used to compute global phase-transition quantities: the critical percolation threshold, the subcritical component size, and the quenched Ising critical temperature and thermodynamic limits. A sympathetic reader would care because this turns a hard dynamic graph problem into a branching-process calculation.

What carries the argument

The load-bearing object is the random Pólya point tree, a multitype branching process whose type space is a continuous age in $[0,1]$ together with a Gamma-distributed strength and an $O/Y$ label recording whether a node is older or younger than its parent. The proof has two main mechanisms: a Pólya urn representation that makes the edge-connection events in models (A), (B), and (D) conditionally independent given Beta-distributed urn weights, and an explicit density computation, closed by a second-moment method, showing that the joint age density of an $r$-neighborhood in the graph converges to the density of the $\mathrm{RPPT}$. For percolation, the threshold is identified with the inverse of the spectral radius of the mean offspring operator, the branching-process growth rate in a continuous type space.

What would settle it

Take a small marked tree $t$ and compute, from the connection rule in (1.1.6), the exact joint age density of a uniformly chosen vertex's $r$-neighborhood in Model (D); if this density does not match the RPPT density of Proposition 4.4.2 up to a $o(1)$ error as $n\to\infty$, then Theorem 4.2.1 fails for Models (B) and (D). The same check can be done by evaluating the self-loop and edge-mark corrections in the second-moment sum directly.

Watch

Extended reading notes

Core claim

The central claim is Theorem 4.2.1: if $M$ is an $\mathbb{N}$-valued out-degree distribution with finite $p$-th moment for some $p>1$ and $\delta > -\inf \mathrm{supp}(M)$, then the preferential attachment models (A), (B), and (D) converge vertex-marked locally in probability to the random Pólya point tree $\mathrm{RPPT}(M,\delta)$. The vertex mark of vertex $k$ in an $n$-vertex graph is $k/n$, so the mark converges to the age of the corresponding node in the limiting tree. The thesis further claims that the critical percolation threshold of the Pólya point tree is the inverse of the spectral radius of its mean offspring operator, and that the same threshold holds for the finite preferential attachment models because they are large-set expanders with bounded average degree. For the quenched Ising model, it claims explicit limits for pressure per particle, magnetization, and internal energy, together with an explicit inverse critical temperature.

Load-bearing premise

The detailed proof is written only for Model (A); for Models (B) and (D) the argument assumes, without a fully written verification, that their edge-connection probabilities and self-loop corrections differ from Model (A)'s only by errors that vanish at the same rate, so the same density and second-moment computations apply.

Editorial extensions

If this is right

  • The asymptotic degree of a uniformly chosen vertex follows a power law with exponent $\min\{\tau_M, 3+\delta/\mathbb{E}[M]\}$, so the tail is controlled by whichever of the out-degree distribution and the preferential-attachment mechanism is heavier.
  • Older and younger neighbors of a uniform vertex have degree tails with exponents $\min\{\tau_e-1, \tau_M-1\}$ and $\min\{\tau_e+1, \tau_M-1\}$, respectively, a size-biasing effect visible directly from the local limit.
  • The critical percolation threshold of the Pólya point tree is the inverse of the spectral radius of the mean offspring operator, and this same threshold transfers to the preferential attachment graphs through their large-set expander property.
  • In the subcritical percolation regime, the largest connected component is significantly larger than the maximum degree, so subcritical clusters are not bounded by the local degree scale.
  • The quenched Ising model on these graphs has explicit thermodynamic limits and an explicit inverse critical temperature, making the phase-transition parameters computable from the local limit.

Reading between the lines

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

  • Editorial inference: the same Pólya-urn route would likely deliver the random Pólya point tree limit for the independent and simple models (E) and (F), which the thesis leaves open.
  • Editorial inference: the threshold formula suggests a testable recipe for other growing network models: compute the local branching limit, take the inverse spectral radius of its mean offspring operator, and check the large-set expander condition.
  • Editorial inference: the exponent formula $\min\{\tau_M, 3+\delta/\mathbb{E}[M]\}$ predicts that heavy out-degree tails suppress the usual rich-get-richer exponent; a simulation measuring the degree tail of a uniform vertex as $M$ and $\delta$ vary would directly test this.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The thesis studies affine preferential attachment models with i.i.d. random out-degrees M, finite p-th moment for some p>1, and fitness parameter δ > -inf supp(M). Part I defines the random Pólya point tree RPPT(M,δ), proves Pólya urn representations for Models (A), (B) and (D), proves vertex-marked local convergence of these models to the RPPT by a second-moment density calculation, and derives the asymptotic degree distribution and the degree distributions of older and younger neighbours. Part II, according to the introduction and abstract, uses this local limit to compute the critical percolation threshold of the Pólya point tree, transfers it to preferential attachment models via their large-set expander property, and studies the quenched Ising model and its inverse critical temperature. The text supplied for review contains Chapters 1–4 in detail and the table of contents, but Chapters 5–8 are not present in the provided portion.

Significance. If the claims are correct, the paper gives a substantial generalization of the local limit results of Berger et al., covering random out-degrees and negative δ, and identifies a universal limiting object. The explicit Pólya urn representations proved by direct graph-probability matching are a notable technical strength, as is the local density limit theorem, which is strictly stronger than plain local convergence. The size-biasing effects in the limiting tree and in the degree distributions of neighbours are cleanly identified. The percolation and Ising results, if fully verified, would be valuable examples of global phase-transition parameters being determined by local structure. The manuscript is less convincing where it relies on asserted rather than displayed calculations, particularly for Models (B) and (D).

major comments (3)
  1. [§4.4, Remark 4.4.9 and Theorem 4.2.1] The proof of vertex-marked local convergence is carried out in full only for Model (A). For Models (B) and (D), the manuscript states in Remark 4.4.9 that the proofs follow from the same calculations, but the displayed argument does not contain those calculations. This is load-bearing: the conditional edge probabilities for CPU(NSL) and PU(NSL) in (4.3.6) and (4.3.7) differ from (4.3.5), the no-further-edge product in (4.4.29) has to be recomputed with these probabilities, and the edge-mark summation leading to (4.4.38)–(4.4.39) must reproduce the correct factorial and Gamma size-bias factors. For Model (D), the combinatorics differ because each vertex has m_u distinguishable out-edges rather than one edge per collapsed block. The manuscript should either provide the detailed first- and second-moment density proofs for Models (B) and (D), or state and prove an explicit transfer lemma showing that all error terms o_P(1) and all combinatorial factors are identical to the Model (A) case.
  2. [Chapters 5–8] The claims about percolation and the Ising model are central parts of the thesis, but the provided text contains no statements or proofs from Chapters 5–8. In particular, the claim that the critical percolation threshold equals the inverse of the spectral radius of the mean offspring operator, and the claim that this threshold transfers to preferential attachment models via the large-set expander property, cannot be checked from the submitted material. The same holds for the quenched Ising pressure and the inverse critical temperature. If these chapters are part of the manuscript, they need to be included in the review version; otherwise the thesis is incomplete with respect to its stated central claims.
  3. [§4.5, Lemma 4.5.1 and Theorem 4.5.2] The power-law derivations in Section 4.5 depend on analytic tail computations for mixed Poisson distributions with Gamma mixing. The text gives the main formulas, but some steps are compressed: for example, the assertion that the sum in (4.5.39) varies regularly with the stated exponent uses Karamata's theorem without showing that the slowly varying functions satisfy the required uniformity conditions. This is a minor gap relative to the main theorem, but since these degree-distribution results are presented as consequences of Theorem 4.2.1, the proofs should be completed with the standard regularity estimates for slowly varying functions.
minor comments (5)
  1. [§2.5] In the change of variables between the two representations of the Pólya point tree, the line "Define δ = 2u/m" appears to be a typo or an unexplained redefinition; the parameter δ is already fixed and should not be redefined in this way.
  2. [§3.5] The paragraph before Theorem 3.5.2 says that Model (D) is equivalent to PU(SL), while the theorem statement and its proof concern PU(NSL). Please correct this inconsistency.
  3. [Throughout Part I] The name "Pólya" is repeatedly typeset as "P'olya" in the chapter preambles and running text; the accent and spelling should be made consistent.
  4. [§1.1.1] The sentence "These graphs has a very rich, but still growing literature" contains a subject-verb agreement error and should be rewritten.
  5. [§4.5, Theorem 4.5.2(b)] The notation Θ(L(Y)(k)) is not defined; if it is meant to denote a slowly varying function, it should be named consistently as L(Y)(k) without the unexplained Θ symbol.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the local limit is derived from independent Pólya-urn and density computations; the extension to models (B)/(D) rests on an omitted verification, not a circular reduction.

full rationale

The derivation chain is self-contained. The random Pólya point tree (RPPT) is defined independently in Section 2.3, and Chapter 3 proves the Pólya-urn equivalences (Theorems 3.4.1, 3.5.1, 3.5.2) by direct term-by-term comparison of graph probabilities rather than assuming the limit. Chapter 4 proves first- and second-moment density convergence for Model (A) via explicit expressions (4.4.22), (4.4.38)–(4.4.39), and the limiting density f_{r,t} is computed from the RPPT construction (Proposition 4.4.2), not fitted from the model. The only load-bearing shortcut is the extension to Models (B) and (D): Remark 4.4.9 asserts that "the proofs for Theorems 4.4.1 and 4.4.8 for models (B) and (D) follow from the same calculations," relying on Remark 4.3.6 that the edge-connection probabilities of CPU(SL), CPU(NSL), and PU(NSL) behave similarly. This is an omitted verification, not a circular one: no displayed equation in that extension is assumed equal to the target by construction, and the density factorization (4.4.46) uses conditional independence from the urn representation rather than the desired convergence. The percolation threshold in Chapter 5 is characterized as the inverse of the spectral radius of the mean offspring operator of the locally defined branching tree, and Chapter 6 transfers it to the preferential attachment models via the large-set expander property; no parameter is fitted from the quantity being predicted. The only self-citation ([85], the paper on which Chapters 2–4 are based) is disclosed and is not used as evidence in place of the proofs given in the thesis. Overall, no significant circularity is present.

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

The model parameters M and δ are inputs, not fitted to data; the percolation threshold and Ising quantities are derived from the model definition rather than learned from observations. The proofs rely on standard probability theorems and on the specific model dynamics. The only new object, RPPT, is internally defined and has no independent empirical handle.

assumptions (4)
  • standard math Standard probability tools: dominated convergence, Kolmogorov's maximal inequality, Chernoff's inequality, the correlation inequality, Karamata's theorem and the weighted strong law of large numbers.
    Invoked throughout Chapters 3-4 without proof, e.g., in Propositions 4.3.3 and 4.3.4.
  • domain assumption The edge-connection probabilities for models (A), (B), (D) as defined in equations (1.1.3), (1.1.5) and (1.1.6) constitute the target models.
    The local convergence theorem concerns these specific affine preferential attachment models with i.i.d. random out-degrees.
  • domain assumption The out-degree M has finite p-th moment for some p>1 and δ > -inf supp(M).
    Used in Lemma 4.3.1, Proposition 4.3.3 and Proposition 4.3.4 for concentration and Beta-Gamma coupling; the paper notes identifying the precise necessary condition is open.
  • domain assumption The initial graph has size 2 with degrees a1, a2.
    The thesis states that a larger initial graph increases computational complexity and is avoided (Section 4.2, Observation 4).
invented entities (1)
  • Random Pólya point tree (RPPT(M, δ))
    purpose: Limiting local structure of preferential attachment models; its neighborhoods have explicit age densities used to compute degree distributions and process thresholds.
    RPPT is a mathematical construction defined in Section 2.3; it is not an empirical entity with external falsifiable evidence, but it is rigorously defined and shown to generalize the Pólya point tree of [21].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Stochastic processes on preferential attachment models." pith.science (2026). https://pith.science/paper/TS2OLHI7

@misc{pith2026241114111,
  author       = {Pith},
  title        = {Pith review of: Stochastic processes on preferential attachment models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TS2OLHI7}},
  note         = {Machine review of arXiv:2411.14111}
}
read the original abstract

In real life, networks are dynamic in nature; they grow over time and often exhibit power-law degree sequences. To model the evolving structure of the internet, Barab\'{a}si and Albert introduced a simple dynamic model with a power-law degree distribution. This model has since been generalised, leading to a broad class of affine preferential attachment models, where each new vertex connects to existing vertices with a probability proportional to the current degree of the vertex. While numerous studies have explored the global and local properties of these random graphs, their dynamic nature and the dependencies in edge-connection probabilities have posed significant analytical challenges. The first part of this thesis identifies the local limit of preferential attachment models in considerable generality. The second part focuses on stochastic processes on preferential attachment models, introducing an additional layer of randomness to the random graphs. Examples of such processes include bond and site percolation, random walks, the Ising and Potts models, and Gaussian processes on random graphs. In this thesis, we specifically examine percolation and the Ising model, exploring these processes using the local limit identified earlier.

Figures

Figures reproduced from arXiv: 2411.14111 by the authors.

Figure 1.1
Figure 1.1. Realisation of preferential attachment model on [PITH_FULL_IMAGE:figures/full_fig_p022_1_1.png] view at source ↗
Figure 1.2
Figure 1.2. Percolation on a complete graph. Percolation has been extensively studied on infinite connected graphs, such as the hypercubic lattice. This is a very simple model that exhibits a phase transition. For an in-depth exploration of percolation theory, we refer the reader to [50, 79, 90, 96, 106] and the references therein. Percolation is also employed to model vaccination strategies on a network, aim￾ing to prevent the… view at source ↗
Figure 1.3
Figure 1.3. Ising model realisation on a 4 × 4 grid. In its most basic form, the Ising model considers a graph structure where each site (or node) hosts a spin that can take one of two values, typically represented as +1 or −1. These spins interact with their nearest neighbours, favouring alignment to minimise the system’s energy. The interplay between thermal fluctuations, that tend to randomise spin orientation, and the inter… view at source ↗
Figures from the paper (5 more)
Figure 1.4
Figure 1.4. Figure 1.4: Collapsing process with r = (3, 3, 3, 3, . . .) PAM construction by collapsing. We start with a vertex-labelled graph G0 of size 2 and degrees a1 and a2, respectively. First, we explain the construction of model (A) using collapsing. Every v ≥ 3 comes with exactly on…
Figure 7.1
Figure 7.1. Figure 7.1: Log-log plot of the largest connected component and maximum degree [PITH_FULL_IMAGE:figures/full_fig_p179_7_1.png]
Figure 7.2
Figure 7.2. Figure 7.2: Log-log plot of the largest connected component and maximum degree [PITH_FULL_IMAGE:figures/full_fig_p180_7_2.png]
Figure 7.3
Figure 7.3. Figure 7.3: Log-log plot of the largest connected component and maximum degree [PITH_FULL_IMAGE:figures/full_fig_p181_7_3.png]
Figure 7.4
Figure 7.4. Figure 7.4: Log-log plot of the largest connected component and maximum degree [PITH_FULL_IMAGE:figures/full_fig_p181_7_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

144 extracted references · 74 canonical work pages

  1. [57]

    A preferential attachment model with random initial degrees

    D EIJFEN , M., VAN DEN ESKER , H., VAN DER HOFSTAD , R., AND HOOGHIEMSTRA , G. A preferential attachment model with random initial degrees. Ark. Mat. 47, 1 (2009), 41–72. 199 9999

    2009

  2. [1]

    Statistical mechanics of complex net- works

    A LBERT , R., AND BARAB ´ASI , A.-L. Statistical mechanics of complex net- works. Rev. Modern Phys. 74, 1 (2002), 47–97

    2002

  3. [2]

    A LDOUS , D., AND STEELE , J. M. The objective method: probabilistic com- binatorial optimization and local weak convergence. InProbability on discrete structures, vol. 110 ofEncyclopaedia Math. Sci. Springer, Berlin, 2004, pp. 1– 72

    2004

  4. [3]

    Locality of random digraphs on expanders

    A LIMOHAMMADI , Y., B ORGS , C., AND SABERI , A. Locality of random digraphs on expanders. Ann. Probab. 51, 4 (2023), 1249–1297

    2023

  5. [4]

    Percolation on finite graphs and isoperimetric inequalities

    A LON , N., B ENJAMINI , I., AND STACEY, A. Percolation on finite graphs and isoperimetric inequalities. Ann. Probab. 32, 3A (2004), 1727–1745

    2004

  6. [5]

    Limit laws for self-loops and multiple edges in the configuration model

    A NGEL , O., VAN DER HOFSTAD , R., AND HOLMGREN , C. Limit laws for self-loops and multiple edges in the configuration model. Ann. Inst. Henri Poincar´e Probab. Stat. 55, 3 (2019), 1509–1530

    2019

  7. [6]

    A THANASIOU , R., AND YOSHIOKA , G. A. The spatial character of friendship formation. Environment and behavior 5, 1 (1973), 43

    1973

  8. [7]

    A THREYA , K. B. Change of measures for Markov chains and the L log L theorem for branching processes. Bernoulli 6, 2 (2000), 323–338

    2000

Show all 144 references
  1. [8]

    A THREYA , K. B. Preferential attachment random graphs with general weight function. Internet Math. 4, 4 (2007), 401–418

    2007

  2. [9]

    B., G HOSH , A

    A THREYA , K. B., G HOSH , A. P., AND SETHURAMAN , S. Growth of pref- erential attachment random graphs via continuous-time branching processes. Proc. Indian Acad. Sci. Math. Sci. 118, 3 (2008), 473–494

    2008

  3. [10]

    B., AND NEY, P

    A THREYA , K. B., AND NEY, P. E. Branching processes, vol. Band 196 of Die Grundlehren der mathematischen Wissenschaften. Springer-Verlag, New York-Heidelberg, 1972. 195 9999

    1972

  4. [11]

    Threshold behaviour and final out- come of an epidemic on a random network with household structure

    B ALL , F., S IRL , D., AND TRAPMAN , P. Threshold behaviour and final out- come of an epidemic on a random network with household structure. Adv. in Appl. Probab. 41, 3 (2009), 765–796

    2009

  5. [12]

    Analysis of a stochastic SIR epi- demic on a random network incorporating household structure

    B ALL , F., S IRL , D., AND TRAPMAN , P. Analysis of a stochastic SIR epi- demic on a random network incorporating household structure. Math. Biosci. 224, 2 (2010), 53–73

    2010

  6. [13]

    Local weak limits for collapsed branching processes with random out-degrees

    B ANERJEE , S., D EKA , P., AND OLVERA -CRAVIOTO , M. Local weak limits for collapsed branching processes with random out-degrees. arXiv Preprint: arXiv:2302.00562 (02 2023)

    2023 arXiv

  7. [14]

    PageRank asymptotics on di- rected preferential attachment networks

    B ANERJEE , S., AND OLVERA -CRAVIOTO , M. PageRank asymptotics on di- rected preferential attachment networks. Ann. Appl. Probab. 32 , 4 (2022), 3060–3084

    2022

  8. [15]

    Emergence of scaling in random net- works

    B ARAB ´ASI , A.-L., AND ALBERT , R. Emergence of scaling in random net- works. Science 286, 5439 (1999), 509–512

    1999

  9. [16]

    S., AND BRUNDAVANAM , A

    B ASU , A., S HANNIGRAHI , S., C HHABRA , S. S., AND BRUNDAVANAM , A. On the rise and fall of online social networks. arXiv Preprint: arXiv:1403.5617 (2014)

    2014 arXiv

  10. [17]

    A., AND CANFIELD , E

    B ENDER , E. A., AND CANFIELD , E. R. The asymptotic number of labeled graphs with given degree sequences. J. Combinatorial Theory Ser. A 24 , 3 (1978), 296–307

    1978

  11. [18]

    Is the critical percolation probability local? Probab

    B ENJAMINI , I., N ACHMIAS , A., AND PERES , Y. Is the critical percolation probability local? Probab. Theory Related Fields 149, 1-2 (2011), 261–269

    2011

  12. [19]

    Recurrence of distributional limits of finite planar graphs

    B ENJAMINI , I., AND SCHRAMM , O. Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6(2001), no. 23, 13

    2001

  13. [20]

    T., AND SABERI , A

    B ERGER , N., B ORGS , C., C HAYES , J. T., AND SABERI , A. On the spread of viruses on the internet. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2005), ACM, New York, pp. 301–310

    2005

  14. [21]

    T., AND SABERI , A

    B ERGER , N., B ORGS , C., C HAYES , J. T., AND SABERI , A. Asymptotic be- havior and distributional limits of preferential attachment graphs.Ann. Probab. 42, 1 (2014), 1–40

    2014

  15. [22]

    Universal techniques to analyze preferential attachment trees : Global and local analysis

    B HAMIDI , S. Universal techniques to analyze preferential attachment trees : Global and local analysis. Preprint (2007). 196 9999

    2007

  16. [23]

    Univer- sality for critical heavy-tailed network models: metric structure of maximal components

    B HAMIDI , S., D HARA , S., VAN DER HOFSTAD , R., AND SEN, S. Univer- sality for critical heavy-tailed network models: metric structure of maximal components. Electron. J. Probab. 25(2020), Paper No. 47, 57

    2020

  17. [24]

    Mean field solution of the Ising model on a Barab ´asi-Albert network

    B IANCONI , G. Mean field solution of the Ising model on a Barab ´asi-Albert network. Phys. Lett. A 303, 2-3 (2002), 166–168

    2002

  18. [25]

    Competition and multiscaling in evolving networks

    B IANCONI , G., AND BARAB ´ASI , A.-L. Competition and multiscaling in evolving networks. In The Structure and Dynamics of Networks . Princeton University Press, 2011, pp. 361–367

    2011

  19. [26]

    H., G OLDIE , C

    B INGHAM , N. H., G OLDIE , C. M., AND TEUGELS , J. L. Regular varia- tion, vol. 27 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 1987

    1987

  20. [27]

    A probabilistic proof of an asymptotic formula for the number of labelled regular graphs

    B OLLOB ´AS, B. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European J. Combin. 1, 4 (1980), 311–316

    1980

  21. [28]

    Random graphs, second ed., vol

    B OLLOB ´AS, B. Random graphs, second ed., vol. 73 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 2001

    2001

  22. [29]

    The phase transition in inhomogeneous random graphs

    B OLLOB ´AS, B., J ANSON , S., AND RIORDAN , O. The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31, 1 (2007), 3–122

    2007

  23. [30]

    The diameter of a scale-free random graph

    B OLLOB ´AS, B., AND RIORDAN , O. The diameter of a scale-free random graph. Combinatorica 24, 1 (2004), 5–34

    2004

  24. [31]

    Sparse graphs: metrics and random models

    B OLLOB ´AS, B., AND RIORDAN , O. Sparse graphs: metrics and random models. Random Structures Algorithms 39, 1 (2011), 1–38

    2011

  25. [32]

    The degree sequence of a scale-free random graph process.Random Structures Algorithms 18, 3 (2001), 279–290

    B OLLOB ´AS, B., R IORDAN , O., S PENCER , J., AND TUSN ´ADY, G. The degree sequence of a scale-free random graph process.Random Structures Algorithms 18, 3 (2001), 279–290

    2001

  26. [33]

    First to mar- ket is not everything: an analysis of preferential attachment with fitness

    B ORGS , C., C HAYES , J., D ASKALAKIS , C., AND ROCH , S. First to mar- ket is not everything: an analysis of preferential attachment with fitness. In STOC’07—Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007), ACM, New York, pp. 135–144

    2007

  27. [34]

    Left and right con- vergence of graphs with bounded degree

    B ORGS , C., C HAYES , J., K AHN , J., AND LOV ´ASZ , L. Left and right con- vergence of graphs with bounded degree. Random Structures Algorithms 42, 1 (2013), 1–28. 197 9999

    2013

  28. [35]

    T., AND VESZTERGOMBI , K

    B ORGS , C., C HAYES , J., L OV ´ASZ , L., S ´OS, V. T., AND VESZTERGOMBI , K. Counting graph homomorphisms. In Topics in discrete mathematics , vol. 26 of Algorithms Combin. Springer, Berlin, 2006, pp. 315–371

    2006

  29. [36]

    T., L OV ´ASZ , L., S ´OS, V

    B ORGS , C., C HAYES , J. T., L OV ´ASZ , L., S ´OS, V. T., AND VESZTERGOMBI , K. Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219, 6 (2008), 1801–1851

    2008

  30. [37]

    T., L OV ´ASZ , L., S ´OS, V

    B ORGS , C., C HAYES , J. T., L OV ´ASZ , L., S ´OS, V. T., AND VESZTERGOMBI , K. Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Ann. of Math. (2) 176, 1 (2012), 151–219

    2012

  31. [38]

    Statistical mechanics of disordered systems, vol

    B OVIER , A. Statistical mechanics of disordered systems, vol. 18 ofCambridge Series in Statistical and Probabilistic Mathematics . Cambridge University Press, Cambridge, 2006. A mathematical perspective

    2006

  32. [39]

    L., AND SCHONMANN , R

    B RICMONT , J., K ESTEN , H., L EBOWITZ , J. L., AND SCHONMANN , R. H. A note on the Ising model in high dimensions. Comm. Math. Phys. 122 , 4 (1989), 597–607

    1989

  33. [40]

    Generating simple ran- dom graphs with prescribed degree distribution

    B RITTON , T., D EIJFEN , M., AND MARTIN -L ¨OF, A. Generating simple ran- dom graphs with prescribed degree distribution. J. Stat. Phys. 124, 6 (2006), 1377–1397

    2006

  34. [41]

    Scale-free networks are rare

    B ROIDO , A., AND CLAUSET , A. Scale-free networks are rare. Nature Com- munications 10 (03 2019)

    2019

  35. [42]

    E., K HOSROWSHAHI , A., O L- SHAUSEN , B

    B YBEE , C., K LEYKO , D., N IKONOV, D. E., K HOSROWSHAHI , A., O L- SHAUSEN , B. A., AND SOMMER , F. T. Efficient optimization with higher- order ising machines. Nature Communications 14 (2022)

    2022

  36. [43]

    C AN, V. H. Critical behavior of the annealed Ising model on random regular graphs. J. Stat. Phys. 169, 3 (2017), 480–503

    2017

  37. [44]

    H., G IARDIN `A, C., G IBERTI , C., AND VAN DER HOFSTAD , R

    C AN, V. H., G IARDIN `A, C., G IBERTI , C., AND VAN DER HOFSTAD , R. Annealed Ising model on configuration models. Ann. Inst. Henri Poincar ´e Probab. Stat. 58, 1 (2022), 134–163

    2022

  38. [45]

    Lectures on random polymers

    C ARAVENNA , F., DEN HOLLANDER , F., AND P ´ETR ´ELIS , N. Lectures on random polymers. In Probability and statistical physics in two and more di- mensions, vol. 15 ofClay Math. Proc.Amer. Math. Soc., Providence, RI, 2012, pp. 319–393. 198 9999

    2012

  39. [46]

    Diameter in ultra-small scale-free random graphs

    C ARAVENNA , F., G ARAVAGLIA , A., AND VAN DER HOFSTAD , R. Diameter in ultra-small scale-free random graphs. Random Structures Algorithms 54, 3 (2019), 444–498

    2019

  40. [47]

    A branching process, its application in biology: influence of demographic parameters on the social structure in mammal groups

    C ARON -LORMIER , G., M ASSON , J.-P., M ´ENARD , N., AND PIERRE , J.- S. A branching process, its application in biology: influence of demographic parameters on the social structure in mammal groups. Journal of theoretical biology 238 3 (2006), 564–74

    2006

  41. [48]

    A Curie-Weiss model of self-organized critical- ity

    C ERF, R., AND GORNY, M. A Curie-Weiss model of self-organized critical- ity. Ann. Probab. 44, 1 (2016), 444–478

    2016

  42. [49]

    D., AND SUNG , S

    C HOI , B. D., AND SUNG , S. H. Almost sure convergence theorems of weighted sums of random variables. Stochastic Anal. Appl. 5, 4 (1987), 365– 377

    1987

  43. [50]

    Percolation in general graphs

    C HUNG , F., H ORN , P., AND LU, L. Percolation in general graphs. Internet Math. 6, 3 (2009), 331–347

    2009

  44. [51]

    Connected components in random graphs with given expected degree sequences

    C HUNG , F., AND LU, L. Connected components in random graphs with given expected degree sequences. Ann. Comb. 6, 2 (2002), 125–145

    2002

  45. [52]

    The average distance in a random graph with given expected degrees

    C HUNG , F., AND LU, L. The average distance in a random graph with given expected degrees. Internet Math. 1, 1 (2003), 91–113

    2003

  46. [53]

    Perspectives on spin glasses

    C ONTUCCI , P., AND GIARDIN `A, C. Perspectives on spin glasses. Cambridge University Press, Cambridge, 2013

    2013

  47. [54]

    C OOK , C., Z HAO, H., S ATO, T., H IROMOTO , M., AND TAN, S. X.-D. Gpu based parallel ising computing for combinatorial optimization problems in vlsi physical design. arXiv Preprint: arXiv:1807.10750 (2018)

    2018 arXiv

  48. [55]

    A general model of web graphs

    C OOPER , C., AND FRIEZE , A. A general model of web graphs. Random Structures Algorithms 22, 3 (2003), 311–335

    2003

  49. [56]

    Mean field dilute ferromagnet: high temperature and zero temperature behavior

    D E SANCTIS , L., AND GUERRA , F. Mean field dilute ferromagnet: high temperature and zero temperature behavior. J. Stat. Phys. 132, 5 (2008), 759– 785

    2008

  50. [58]

    Ising models on locally tree-like graphs

    D EMBO , A., AND MONTANARI , A. Ising models on locally tree-like graphs. Ann. Appl. Probab. 20, 2 (2010), 565–592

    2010

  51. [59]

    Factor models on locally tree- like graphs

    D EMBO , A., M ONTANARI , A., AND SUN, N. Factor models on locally tree- like graphs. Ann. Probab. 41, 6 (2013), 4162–4213

    2013

  52. [60]

    Preferential attachment with fitness: unfolding the condensate

    D EREICH , S. Preferential attachment with fitness: unfolding the condensate. Electron. J. Probab. 21(2016), Paper No. 3, 38

    2016

  53. [61]

    Typical distances in ultra- small random networks

    D EREICH , S., M ¨ONCH , C., AND M ¨ORTERS , P. Typical distances in ultra- small random networks. Adv. in Appl. Probab. 44, 2 (2012), 583–601

    2012

  54. [62]

    Random networks with sublinear prefer- ential attachment: degree evolutions

    D EREICH , S., AND M ¨ORTERS , P. Random networks with sublinear prefer- ential attachment: degree evolutions. Electron. J. Probab. 14 (2009), no. 43, 1222–1267

    2009

  55. [63]

    Random networks with sublinear preferen- tial attachment: the giant component

    D EREICH , S., AND M ¨ORTERS , P. Random networks with sublinear preferen- tial attachment: the giant component. Ann. Probab. 41, 1 (2013), 329–384

    2013

  56. [64]

    Robust analysis of preferential attachment models with fitness

    D EREICH , S., AND ORTGIESE , M. Robust analysis of preferential attachment models with fitness. Combin. Probab. Comput. 23, 3 (2014), 386–411

    2014

  57. [65]

    D HARA , S., VAN DER HOFSTAD , R., VAN LEEUWAARDEN , J. S. H., AND SEN, S. Critical window for the configuration model: finite third moment degrees. Electron. J. Probab. 22(2017), Paper No. 16, 33

    2017

  58. [66]

    D OMMERS , S., G IARDIN `A, C., G IBERTI , C., VAN DER HOFSTAD , R., AND PRIORIELLO , M. L. Ising critical behavior of inhomogeneous Curie-Weiss models and annealed random graphs. Comm. Math. Phys. 348, 1 (2016), 221– 263

    2016

  59. [67]

    Ising models on power-law random graphs

    D OMMERS , S., G IARDIN `A, C., AND VAN DER HOFSTAD , R. Ising models on power-law random graphs. J. Stat. Phys. 141, 4 (2010), 638–660

    2010

  60. [68]

    Diame- ters in preferential attachment models

    D OMMERS , S., VAN DER HOFSTAD , R., AND HOOGHIEMSTRA , G. Diame- ters in preferential attachment models. J. Stat. Phys. 139, 1 (2010), 72–107

    2010

  61. [69]

    N., G OLTSEV, A

    D OROGOVTSEV , S. N., G OLTSEV, A. V., AND MENDES , J. F. F. Critical phenomena in complex networks. Rev. Mod. Phys. 80 (2008), 1275–1335

    2008

  62. [70]

    N., M ENDES , J

    D OROGOVTSEV , S. N., M ENDES , J. F. F., AND SAMUKHIN , A. N. Structure of growing networks with preferential linking. Phys. Rev. Lett. 85 (2000), 4633–4636. 200 9999

    2000

  63. [71]

    Random graph dynamics, vol

    D URRETT , R. Random graph dynamics, vol. 20 ofCambridge Series in Statis- tical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2007

    2007

  64. [72]

    The critical percolation probability is local

    E ASO , P., AND HUTCHCROFT , T. The critical percolation probability is local. arXiv Preprint: arXiv:2310.10983 (2023)

    2023 arXiv

  65. [73]

    Near critical preferential attachment networks have small giant components

    E CKHOFF , M., M ¨ORTERS , P., AND ORTGIESE , M. Near critical preferential attachment networks have small giant components. J. Stat. Phys. 173 , 3-4 (2018), 663–703

    2018

  66. [74]

    ¨Uber die statistik verketteter vorg¨ange

    E GGENBERGER , F., AND P ´OLYA, G. ¨Uber die statistik verketteter vorg¨ange. Zamm-zeitschrift Fur Angewandte Mathematik Und Mechanik 3 (1923), 279– 289

    1923

  67. [75]

    E ISELE , T., AND ELLIS , R. S. Multiple phase transitions in the generalized Curie-Weiss model. J. Statist. Phys. 52, 1-2 (1988), 161–202

    1988

  68. [76]

    E LLIS , R. S. Entropy, large deviations, and statistical mechanics. Classics in Mathematics. Springer-Verlag, Berlin, 2006. Reprint of the 1985 original

    2006

  69. [77]

    On random graphs

    E RD ˝OS, P., AND R ´ENYI , A. On random graphs. I. Publ. Math. Debrecen 6 (1959), 290–297

    1959

  70. [78]

    On the evolution of random graphs

    E RD ˝OS, P., AND R ´ENYI , A. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat´o Int. K¨ozl. 5 (1960), 17–61

    1960

  71. [79]

    Expansion of percolation critical points for Hamming graphs

    F EDERICO , L., VAN DER HOFSTAD , R., D EN HOLLANDER , F., AND HUL- SHOF , T. Expansion of percolation critical points for Hamming graphs. Com- bin. Probab. Comput. 29, 1 (2020), 68–100

    2020

  72. [80]

    Percolation on sparse random graphs with given degree sequence

    F OUNTOULAKIS , N. Percolation on sparse random graphs with given degree sequence. Internet Math. 4, 4 (2007), 329–356

    2007

  73. [81]

    Percolation on random graphs with a fixed degree sequence

    F OUNTOULAKIS , N., J OOS , F., AND PERARNAU , G. Percolation on random graphs with a fixed degree sequence. SIAM J. Discrete Math. 36 , 1 (2022), 1–46

    2022

  74. [82]

    M., AND SHEPELYANSKY , D

    F RAHM , K. M., AND SHEPELYANSKY , D. L. Ising-pagerank model of opin- ion formation on social networks. Physica A: Statistical Mechanics and its Applications 526 (2019), 121069. 201 9999

    2019

  75. [83]

    On the asymptotic normality of esti- mating the affine preferential attachment network models with random initial degrees

    G AO, F., AND VAN DER VAART, A. On the asymptotic normality of esti- mating the affine preferential attachment network models with random initial degrees. Stochastic Process. Appl. 127, 11 (2017), 3754–3775

    2017

  76. [84]

    Preferential attachment models for dynamic networks

    G ARAVAGLIA , A. Preferential attachment models for dynamic networks. PhD thesis, Mathematics and Computer Science, Jan. 2019

    2019

  77. [85]

    S., VAN DER HOFSTAD , R., AND RAY, R

    G ARAVAGLIA , A., H AZRA , R. S., VAN DER HOFSTAD , R., AND RAY, R. Universality of the local limit of preferential attachment models. arXiv Preprint: arXiv.2212.05551 (2022)

    2022

  78. [86]

    Local weak convergence for PageRank

    G ARAVAGLIA , A., VAN DER HOFSTAD , R., AND LITVAK , N. Local weak convergence for PageRank. Ann. Appl. Probab. 30, 1 (2020), 40–79

    2020

  79. [87]

    G ILBERT , E. N. Random graphs. Ann. Math. Statist. 30 (1959), 1141–1144

    1959

  80. [88]

    G ILBERT , E. N. Random plane networks. J. Soc. Indust. Appl. Math. 9(1961), 533–543

    1961

  81. [89]

    G RIFFITHS , R. B. Correlations in ising ferromagnets. ii. external magnetic fields. Journal of Mathematical Physics 8, 3 (03 1967), 484–489

    1967

  82. [90]

    Percolation, second ed., vol

    G RIMMETT , G. Percolation, second ed., vol. 321 of Grundlehren der math- ematischen Wissenschaften [Fundamental Principles of Mathematical Sci- ences]. Springer-Verlag, Berlin, 1999

    1999

  83. [91]

    The random-cluster model, vol

    G RIMMETT , G. The random-cluster model, vol. 333 ofGrundlehren der math- ematischen Wissenschaften [Fundamental Principles of Mathematical Sci- ences]. Springer-Verlag, Berlin, 2006

    2006

  84. [92]

    Probability: a graduate course, second ed

    G UT, A. Probability: a graduate course, second ed. Springer Texts in Statis- tics. Springer, New York, 2013

    2013

  85. [93]

    H ARRIS , T. E. The theory of branching processes , vol. Band 119 of Die Grundlehren der mathematischen Wissenschaften . Springer-Verlag, Berlin; Prentice Hall, Inc., Englewood Cliffs, NJ, 1963

    1963

  86. [94]

    S., VAN DER HOFSTAD , R., AND RAY, R

    H AZRA , R. S., VAN DER HOFSTAD , R., AND RAY, R. Percolation on prefer- ential attachment models. arXiv Preprint: arXiv:2312.14085 (2023)

    2023 arXiv

  87. [95]

    Random graphs and complex networks

    VAN DER HOFSTAD , R. Random graphs and complex networks. Vol. 1 , vol. [43] of Cambridge Series in Statistical and Probabilistic Mathematics . Cambridge University Press, Cambridge, 2017. 202 9999

    2017

  88. [96]

    Stochastic processes on random graphs

    VAN DER HOFSTAD , R. Stochastic processes on random graphs. Lecture notes for the 47th Summer School in Probability Saint-Flour 2017 (2017)

    2017

  89. [97]

    The giant in random graphs is almost local

    VAN DER HOFSTAD , R. The giant in random graphs is almost local. arXiv Preprint: arXiv:2103.11733 (2023)

    2023

  90. [98]

    Random graphs and complex networks

    VAN DER HOFSTAD , R. Random graphs and complex networks. Vol. 2. Cam- bridge Series in Statistical and Probabilistic Mathematics. Cambridge Univer- sity Press, 2024

    2024

  91. [99]

    Are giants in random digraphs ‘almost’ local? arXiv Preprint: arXiv:2403.02137 (2024)

    VAN DER HOFSTAD , R., AND PANDEY , M. Are giants in random digraphs ‘almost’ local? arXiv Preprint: arXiv:2403.02137 (2024)

    2024 arXiv

  92. [100]

    Schur-type Banach modules of integral kernels acting on mixed-norm Lebesgue spaces

    H OLIGHAUS , N., AND VOIGTLAENDER , F. Schur-type Banach modules of integral kernels acting on mixed-norm Lebesgue spaces. J. Funct. Anal. 281, 9 (2021), Paper No. 109197, 65

    2021

  93. [101]

    Beitrag zur theorie des ferromagnetismus

    I SING , E. Beitrag zur theorie des ferromagnetismus. Zeitschrift f¨ur Physik 31 (1925), 253–258

    1925

  94. [102]

    The growth and composition of branching populations

    J AGERS , P., AND NERMAN , O. The growth and composition of branching populations. Adv. in Appl. Probab. 16, 2 (1984), 221–259

    1984

  95. [103]

    On percolation in random graphs with given vertex degrees.Elec- tron

    J ANSON , S. On percolation in random graphs with given vertex degrees.Elec- tron. J. Probab. 14(2009), no. 5, 87–118

    2009

  96. [104]

    J ANSON , S., AND LUCZAK , M. J. A new approach to the giant component problem. Random Structures Algorithms 34, 2 (2009), 197–216

    2009

  97. [105]

    Random graphs

    J ANSON , S., Ł UCZAK , T., AND RUCINSKI , A. Random graphs . Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley- Interscience, New York, 2000

    2000

  98. [106]

    On the critical probability in percolation

    J ANSON , S., AND WARNKE , L. On the critical probability in percolation. Electron. J. Probab. 23(2018), Paper No. 1, 25

    2018

  99. [107]

    Critical percolation on random regular graphs

    J OOS , F., AND PERARNAU , G. Critical percolation on random regular graphs. Proc. Amer. Math. Soc. 146, 8 (2018), 3321–3332

    2018

  100. [108]

    How to deter- mine if a random graph with a fixed degree sequence has a giant component

    J OOS , F., P ERARNAU , G., R AUTENBACH , D., AND REED , B. How to deter- mine if a random graph with a fixed degree sequence has a giant component. Probab. Theory Related Fields 170, 1-2 (2018), 263–310. 203 9999

    2018

  101. [109]

    Preferential attachment graphs with co-existing types of different fitnesses

    J ORDAN , J. Preferential attachment graphs with co-existing types of different fitnesses. J. Appl. Probab. 55, 4 (2018), 1211–1227

    2018

  102. [110]

    G., AND SHERMAN , S

    K ELLY, D. G., AND SHERMAN , S. General griffiths’ inequalities on correla- tions in ising ferromagnets. Journal of Mathematical Physics 9, 3 (03 1968), 466–484

    1968

  103. [111]

    K IMMEL , M., AND AXELROD , D. E. Branching Processes in Biology, 1st ed., vol. 19 of Interdisciplinary Applied Mathematics. Springer, New York, 2002

    2002

  104. [112]

    S., P ASZKIEWICZ , T., AND WOLSKI , S

    K OCHMA ’NSKI , M. S., P ASZKIEWICZ , T., AND WOLSKI , S. Curie–Weiss magnet—a simple model of phase transition. European Journal of Physics 34 (2013), 1555 – 1573

    2013

  105. [113]

    K ONG , Z., AND YEH, E. M. Percolation processes and wireless network resilience. In 2008 Information Theory and Applications Workshop (2008), pp. 461–470

    2008

  106. [114]

    A mod- ified Ising model of Barab ´asi-Albert network with gene-type spins

    K RISHNAN , J., T ORABI , R., S CHUPPERT , A., AND DI NAPOLI , E. A mod- ified Ising model of Barab ´asi-Albert network with gene-type spins. J. Math. Biol. 81, 3 (2020), 769–798

    2020

  107. [115]

    Asymptotics in per- colation on high-girth expanders

    K RIVELEVICH , M., L UBETZKY , E., AND SUDAKOV, B. Asymptotics in per- colation on high-girth expanders. Random Structures Algorithms 56, 4 (2020), 927–947

    2020

  108. [116]

    E., AND RAHIMZADEH SANI , A

    K YPRIANOU , A. E., AND RAHIMZADEH SANI , A. Martingale conver- gence and the functional equation in the multi-type branching random walk. Bernoulli 7, 4 (2001), 593–604

    2001

  109. [117]

    A., AND CAMPBELL , K

    L EE, B. A., AND CAMPBELL , K. E. Neighbor networks of black and white americans. In Networks in the Global Village: Life in Contemporary Commu- nities, B. Wellman, Ed. Taylor & Francis, 2018, pp. 119–146

    2018

  110. [118]

    Beitrag zum verst ¨andnis der magnetischen erscheinungen in festen k¨orpern

    L ENZ , W. Beitrag zum verst ¨andnis der magnetischen erscheinungen in festen k¨orpern. European Physical Journal A 21 (1920)

    1920

  111. [119]

    K., S TANLEY, H

    L IU, X., L I, D., M A, M., S ZYMANSKI , B. K., S TANLEY, H. E., AND GAO, J. Network resilience. Physics Reports 971 (2022), 1–108. Network Re- silience

    2022

  112. [120]

    L O, T. Y. Y. Local weak limit of preferential attachment random trees with additive fitness. Advances in Applied Probability (2024), 1–40. 204 9999

    2024

  113. [121]

    Limits of dense graph sequences

    L OV ´ASZ , L., AND SZEGEDY , B. Limits of dense graph sequences. J. Combin. Theory Ser. B 96, 6 (2006), 933–957

    2006

  114. [122]

    The Ising model and percolation on trees and tree-like graphs

    L YONS , R. The Ising model and percolation on trees and tree-like graphs. Comm. Math. Phys. 125, 2 (1989), 337–353

    1989

  115. [123]

    Random walks and percolation on trees

    L YONS , R. Random walks and percolation on trees. Ann. Probab. 18 , 3 (1990), 931–958

    1990

  116. [124]

    Conceptual proofs of L log L criteria for mean behavior of branching processes

    L YONS , R., P EMANTLE , R., AND PERES , Y. Conceptual proofs of L log L criteria for mean behavior of branching processes. Ann. Probab. 23, 3 (1995), 1125–1138

    1995

  117. [125]

    On certain connectivity properties of the internet topology

    M IHAIL , M., P APADIMITRIOU , C., AND SABERI , A. On certain connectivity properties of the internet topology. J. Comput. System Sci. 72, 2 (2006), 239– 251

    2006

  118. [126]

    Random Graphs ’93

    M OLLOY, M., AND REED , B. A critical point for random graphs with a given degree sequence. In Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, “Random Graphs ’93” (Pozna´n, 1993) (1995), vol. 6, p...

    1995

  119. [127]

    W., P OTTS , R

    M ONTROLL , E. W., P OTTS , R. B., AND WARD , J. C. Correlations and spon- taneous magnetization of the two-dimensional Ising model. J. Mathematical Phys. 4 (1963), 308–322

    1963

  120. [128]

    M ´ORI , T. F. The maximum degree of the Barab ´asi-Albert random tree. Com- bin. Probab. Comput. 14, 3 (2005), 339–348

    2005

  121. [129]

    On the convergence of supercritical general (C-M-J) branching processes

    N ERMAN , O. On the convergence of supercritical general (C-M-J) branching processes. Z. Wahrsch. Verw. Gebiete 57, 3 (1981), 365–395

    1981

  122. [130]

    Networks: An Introduction

    N EWMAN , M. Networks: An Introduction. Oxford University Press, 03 2010

    2010

  123. [131]

    N EWMAN , M. E. J. Spread of epidemic disease on networks. Phys. Rev. E (3) 66, 1 (2002), 016128, 11

    2002

  124. [132]

    On a conditionally Poissonian graph process

    N ORROS , I., AND REITTU , H. On a conditionally Poissonian graph process. Adv. in Appl. Probab. 38, 1 (2006), 59–75

    2006

  125. [133]

    Crystal statistics

    O NSAGER , L. Crystal statistics. I. A two-dimensional model with an order- disorder transition. Phys. Rev. (2) 65 (1944), 117–149. 205

    1944

  126. [134]

    P ITTEL , B. G. On the largest component of a random graph with a subpower- law degree sequence in a subcritical phase. Ann. Appl. Probab. 18, 4 (2008), 1636–1650

    2008

  127. [135]

    Adventures in stochastic processes

    R ESNICK , S. Adventures in stochastic processes . Birkh ¨auser Boston, Inc., Boston, MA, 1992

    1992

  128. [136]

    Random trees and general branching processes

    R UDAS , A., T ´OTH , B., AND VALK ´O, B. Random trees and general branching processes. Random Structures Algorithms 31, 2 (2007), 186–202

    2007

  129. [137]

    A note on the local weak limit of a sequence of expander graphs

    S ARKAR , S. A note on the local weak limit of a sequence of expander graphs. Electron. Commun. Probab. 26 (2021), Paper No. 32, 6

    2021

  130. [138]

    Geometry of weighted recursive and affine preferential attachment trees

    S ´ENIZERGUES , D. Geometry of weighted recursive and affine preferential attachment trees. Electron. J. Probab. 26(2021), Paper No. 80, 56

    2021

  131. [139]

    On analytical approaches to epidemics on networks

    T RAPMAN , P. On analytical approaches to epidemics on networks. Theoreti- cal Population Biology 71, 2 (2007), 160–173

    2007

  132. [140]

    Scale-free networks well done

    V OITALOV, I., VAN DER HOORN , P., VAN DER HOFSTAD , R., AND KRI- OUKOV, D. Scale-free networks well done. Phys. Rev. Research 1(Oct 2019), 033034

    2019

  133. [141]

    W ACLAW, B., AND SOKOLOV, I. M. Finite-size effects in Barab ´asi-Albert growing networks. Phys. Rev. E (3) 75, 5 (2007), 056114, 10

    2007

  134. [142]

    The cellular ising model: a framework for phase transitions in multicellular environments

    W EBER , M., AND BUCETA , J. The cellular ising model: a framework for phase transitions in multicellular environments. Journal of The Royal Society Interface 13 (2016)

    2016

  135. [143]

    Different strokes from different folks: Community ties and social support

    W ELLMAN , B., AND WORTLEY , S. Different strokes from different folks: Community ties and social support. American Journal of Sociology - AMER J SOCIOL 96 (11 1990)

    1990

  136. [144]

    H., P ATTISON , P., AND ROBINS , G

    W ONG , L. H., P ATTISON , P., AND ROBINS , G. A spatial model for social networks. Physica A: Statistical Mechanics and its Applications 360, 1 (2006), 99–120. 206 Summary In real life, networks are dynamic in nature; they grow over time and often ex- hibit power-law degree s...

    2006

Pith tools

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