The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Complex Graphs and Networks
Abstract
Graph theory in the information age Old and new concentration inequalities A generative model--the preferential attachment scheme Duplication models for biological networks Random graphs with given expected degrees The rise of the giant component Average distance and the diameter Eigenvalues of the adjacency matrix of $G(\mathbf{w})$ The semi-circle law for $G(\mathbf{w})$ Coupling on-line and off-line analyses of random graphs The configuration model for power law graphs The small world phenomenon in hybrid graphs Bibliography Index.
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
Cites
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
Self-citation
Cited by
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Statistical properties of community structure in large social and information networks
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367591 · Cited by 860
Random Graphs and Complex Networks
Hofstad, R. V. D. (2016) · Cambridge University Press eBooks · doi:10.1017/9781316779422 · Cited by 840
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
Analyzing and modeling real-world phenomena with complex networks: a survey of applications
Costa, L. D. F., Oliveira, O. N., Travieso, G., Rodrigues, F. A., Villas Boas, P. R., Antiqueira, L., Viana, M. P., & Correa Rocha, L. E. (2011) · Advances in Physics · doi:10.1080/00018732.2011.572452 · Cited by 800
A nonparametric view of network models and Newman–Girvan and other modularities
Bickel, P. J., & Chen, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0907096106 · Cited by 765
Kronecker Graphs: An Approach to Modeling Networks
Leskovec, J., Chakrabarti, D., Kleinberg, J. M., Faloutsos, C., & Ghahramani, Z. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.4905 · Cited by 697
Kar, S., & Moura, J. M. F. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007111 · Cited by 691
A survey of random processes with reinforcement
Pemantle, R. (2007) · Probability Surveys · doi:10.1214/07-ps094 · Cited by 578
Concentration Inequalities and Martingale Inequalities: A Survey
Chung, F., & Lu, L. (2006) · Internet Mathematics · doi:10.1080/15427951.2006.10129115 · Cited by 427
Self-citationClique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
Balasundaram, B., Butenko, S., & Hicks, I. V. (2011) · Operations Research · doi:10.1287/opre.1100.0851 · Cited by 302
Investor Networks in the Stock Market
Ozsoylev, H. N., Walden, J., Yavuz, M. D., & Bildik, R. (2014) · Review of Financial Studies · doi:10.1093/rfs/hht065 · Cited by 258
Structural Information and Dynamical Complexity of Networks
Li, A., & Pan, Y. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2555904 · Cited by 200
Tree-Like Structure in Large Social and Information Networks
Adcock, A. B., Sullivan, B. D., & Mahoney, M. W. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.77 · Cited by 141
Homophily and the Glass Ceiling Effect in Social Networks
Avin, C., Keller, B., Lotker, Z., Mathieu, C., Peleg, D., & Pignolet, Y.-A. (2015) · Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science · doi:10.1145/2688073.2688097 · Cited by 90
Metadata
- Authors
- Chung, F., & Lu, L.
- Venue
- CBMS Regional Conference Series in Mathematics
- Publisher
- American Mathematical Society
- Published
- 2006-08-28
- ISSN
- 0160-7642 (ISSN-L)
- 2380-5668
- OpenAlex
- W638149299
- Cited by
- 700
- References
- 1
- FWCI
- 52.07
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.