The DOI matches its OpenAlex record.
On a conditionally Poissonian graph process
Open accessAbstract
Random (pseudo)graphs G N with the following structure are studied: first, independent and identically distributed capacities Λ i are drawn for vertices i = 1, …, N; then, each pair of vertices (i, j) is connected, independently of the other pairs, with E(i, j) edges, where E(i, j) has distribution Poisson(Λ i Λ j / ∑ k=1 N Λ k ). The main result of the paper is that when P(Λ1 > x) ≥ x −τ+1, where τ ∈ (2, 3), then, asymptotically almost surely, G N has a giant component, and the distance between two randomly selected vertices of the giant component is less than (2 + o(N))(log log N)/(-log (τ − 2)). It is also shown that the cases τ > 3, τ ∈ (2, 3), and τ ∈ (1, 2) present three qualitatively different connectivity architectures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
Frieze, A., & Karoński, M. (2015) · doi:10.1017/cbo9781316339831 · Cited by 576
The phase transition in inhomogeneous random graphs
Bollobás, B., Janson, S., & Riordan, O. (2007) · Random Structures & Algorithms · doi:10.1002/rsa.20168 · Cited by 545
Edge-based compartmental modelling for infectious disease spread
Miller, J. C., Slim, A. C., & Volz, E. M. (2012) · Journal of The Royal Society Interface · doi:10.1098/rsif.2011.0403 · Cited by 278
Metadata
- Authors
- Norros, I., & Reittu, H.
- Venue
- Advances in Applied Probability
- Publisher
- Cambridge University Press
- Published
- 2006-03-01
- Volume
- 38
- Issue
- 01
- Pages
- 59-75
- ISSN
- 0001-8678 (ISSN-L)
- OpenAlex
- W2057505998
- Cited by
- 215
- References
- 0
- FWCI
- 4.89
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On a conditionally Poissonian graph process. https://app.cochat.ai/papers/10.1017/s000186780000080x
- The paper
- Norros, I., & Reittu, H. (2006). On a conditionally Poissonian graph process. Advances in Applied Probability. https://doi.org/10.1017/s000186780000080x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.