The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
A mixture model for random graphs
Open accessOverview
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
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Network motifs in the transcriptional regulation network of Escherichia coli
Shen-Orr, S. S., Milo, R., Mangan, S., & Alon, U. (2002) · Nature Genetics · doi:10.1038/ng881 · Cited by 2,952
A critical point for random graphs with a given degree sequence
Molloy, M., & Reed, B. (1995) · Random Structures & Algorithms · doi:10.1002/rsa.3240060204 · Cited by 2,351
Assessing a mixture model for clustering with the integrated completed likelihood
Biernacki, C., Celeux, G., & Govaert, G. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.865189 · Cited by 1,535
Random graph models of social networks
Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582999 · Cited by 1,326
Estimation and Prediction for Stochastic Blockstructures
Nowicki, K., & Snijders, T. A. B. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753208735 · Cited by 1,148
Cited by
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
The auxin signalling network translates dynamic input into robust patterning at the shoot apex
Vernoux, T., Brunoud, G., Farcot, E., Morin, V., Van den Daele, H., Legrand, J., Oliva, M., Das, P., Larrieu, A., Wells, D., et al. (2011) · Molecular Systems Biology · doi:10.1038/msb.2011.39 · Cited by 576
Self-citationStatistical Models for Social Networks
Snijders, T. A. B. (2011) · Annual Review of Sociology · doi:10.1146/annurev.soc.012809.102709 · Cited by 460
Identifiability of parameters in latent structure models with many observed variables
Allman, E. S., Matias, C., & Rhodes, J. A. (2009) · The Annals of Statistics · doi:10.1214/09-aos689 · Cited by 458
Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
Matias, C., & Miele, V. (2017) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12200 · Cited by 326
Metadata
- Authors
- Daudin, J.-J., Picard, F., & Robin, S.
- Venue
- Statistics and Computing
- Published
- 2007-12-11
- Volume
- 18
- Issue
- 2
- Pages
- 173-183
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2133095386
- Cited by
- 475
- References
- 20
- FWCI
- 9.88
- Type
- journal article
- Language
- en
- Open access
- green
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: A mixture model for random graphs. https://app.cochat.ai/papers/10.1007/s11222-007-9046-7
- The paper
- Daudin, J.-J., Picard, F., & Robin, S. (2008). A mixture model for random graphs. Statistics and Computing. https://doi.org/10.1007/s11222-007-9046-7
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.