On random graphs. I.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Since the early study of random graphs by Erdös and Renyi (1959), the degree distribution P(k) has become a common way of classifying graphs into categories.
“Since the early study of random graphs performed by Erdös and Renyi (1959), the degree distribution”
From A Network Approach to Link Visibility and Urban Activity Location (2018) · cites this paper as Erdös and Renyi 1959
Cited by
Sorted by citations
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293 · see citing works
Opinion mining and sentiment analysis
Pang, B., & Lee, L. (2008) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000011 · Cited by 6,372 · see citing works
Network analysis: An integrative approach to the structure of psychopathology
Borsboom, D., & Cramer, A. O. J. (2013) · Annual Review of Clinical Psychology · doi:10.1146/annurev-clinpsy-050212-185608 · Cited by 4,359 · see citing works
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119 · see citing works
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697 · see citing works
Synchronization in complex networks
Arenas, A., Díaz-Guilera, A., Kurths, J., Moreno, Y., & Zhou, C. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.002 · Cited by 3,713 · see citing works
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125 · see citing works
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220 · see citing works
Complex Contagions and the Weakness of Long Ties
Centola, D., & Macy, M. (2007) · American Journal of Sociology · doi:10.1086/521848 · Cited by 1,878 · see citing works
Uncovering disease-disease relationships through the incomplete interactome
Menche, J., Sharma, A., Kitsak, M., Ghiassian, S. D., Vidal, M., Loscalzo, J., & Barabási, A.-L. (2015) · Science · doi:10.1126/science.1257601 · Cited by 1,546 · see citing works
Hyperbolic geometry of complex networks
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., & Boguñá, M. (2010) · Physical Review E · doi:10.1103/physreve.82.036106 · Cited by 1,059 · see citing works
Clustering in weighted networks
Opsahl, T., & Panzarasa, P. (2009) · Social Networks · doi:10.1016/j.socnet.2009.02.002 · Cited by 1,037 · see citing works
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788 · see citing works
The Network Structure of Exploration and Exploitation
Lazer, D., & Friedman, A. (2007) · Administrative Science Quarterly · doi:10.2189/asqu.52.4.667 · Cited by 696 · see citing works
Activity driven modeling of time varying networks
Perra, N., Gonçalves, B., Pastor-Satorras, R., & Vespignani, A. (2012) · Scientific Reports · doi:10.1038/srep00469 · Cited by 709 · see citing works
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2002) · Physical Review E · doi:10.1103/physreve.65.066122 · Cited by 540 · see citing works
Evolutionary dynamics on any population structure
Allen, B., Lippner, G., Chen, Y.-T., Fotouhi, B., Momeni, N., Yau, S.-T., & Nowak, M. A. (2017) · Nature · doi:10.1038/nature21723 · Cited by 534 · see citing works
Mocanu, D. C., Mocanu, E., Stone, P., Nguyen, P. H., Gibescu, M., & Liotta, A. (2018) · Nature Communications · doi:10.1038/s41467-018-04316-3 · Cited by 524 · see citing works
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00048 · Cited by 442 · see citing works
Maximal planar networks with large clustering coefficient and power-law degree distribution
Zhou, T., Yan, G., & Wang, B.-H. (2005) · Physical Review E · doi:10.1103/physreve.71.046141 · Cited by 265 · see citing works
Model of genetic variation in human social networks
Fowler, J. H., Dawes, C. T., & Christakis, N. A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0806746106 · Cited by 245 · see citing works
Geometric De-noising of Protein-Protein Interaction Networks
Kuchaiev, O., Rašajski, M., Higham, D. J., & Pržulj, N. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000454 · Cited by 180 · see citing works
Spatial Search by Quantum Walk is Optimal for Almost all Graphs
Chakraborty, S., Novo, L., Ambainis, A., & Omar, Y. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.100501 · Cited by 164 · see citing works
Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison
De Domenico, M., & Biamonte, J. (2016) · Physical Review X · doi:10.1103/physrevx.6.041062 · Cited by 160 · see citing works
Reconsideration of the Winner-Take-All Hypothesis: Complex Networks and Local Bias
Lee, E., Lee, J., & Lee, J. (2006) · Management Science · doi:10.1287/mnsc.1060.0571 · Cited by 157 · see citing works
Large-scale curvature of networks
Narayan, O., & Saniee, I. (2011) · Physical Review E · doi:10.1103/physreve.84.066108 · Cited by 145 · see citing works
Shannon and von Neumann entropy of random networks with heterogeneous expected degree
Anand, K., Bianconi, G., & Severini, S. (2011) · Physical Review E · doi:10.1103/physreve.83.036109 · Cited by 137 · see citing works
Perseguers, S., Lewenstein, M., Acín, A., & Cirac, J. I. (2010) · Nature Physics · doi:10.1038/nphys1665 · Cited by 139 · see citing works
Multiple weak hits confuse complex systems: A transcriptional regulatory network as an example
Ágoston, V., Csermely, P., & Pongor, S. (2005) · Physical Review E · doi:10.1103/physreve.71.051909 · Cited by 111 · see citing works
Harnessing smoothness to accelerate distributed optimization
Qu, G., & Li, N. (2016) · 2016 IEEE 55th Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798263 · Cited by 72 · see citing works
Evans, T., & Fu, F. (2018) · Royal Society Open Science · doi:10.1098/rsos.181122 · Cited by 61 · see citing works
igraph 1.0 enables fast and robust network analysis across programming languages
Antonov, M., Csárdi, G., Horvát, S., Müller, K., Nepusz, T., Noom, D., Salmon, M., Traag, V., Welles, B. F., & Zanini, F. (2026) · PLOS One · doi:10.1371/journal.pone.0355108 · Cited by 56 · see citing works
Spiekermann, K. (2020) · Politics, Philosophy & Economics · doi:10.1177/1470594x19872505 · Cited by 25 · see citing works
A Graph Feature Auto-Encoder for the prediction of unobserved node features on biological networks
Hasibi, R., & Michoel, T. (2021) · BMC Bioinformatics · doi:10.1186/s12859-021-04447-3 · Cited by 19 · see citing works
Relative superiority of key centrality measures for identifying influencers on social media
Zhang, Y., & Li, X. (2014) · International Journal of Intelligent Information Technologies · doi:10.4018/ijiit.2014100101 · Cited by 14 · see citing works
A Network Approach to Link Visibility and Urban Activity Location
Natapov, A., Czamanski, D., & Fisher-Gewirtzman, D. (2018) · Networks and Spatial Economics · doi:10.1007/s11067-018-9411-4 · Cited by 11 · see citing works
Discovering study-specific gene regulatory networks
Bo, V., Curtis, T., Lysenko, A., Saqi, M., Swift, S., & Tucker, A. (2014) · PLoS ONE · doi:10.1371/journal.pone.0106524 · Cited by 10 · see citing works
- Authors
- Erdős, P., & Rényi, A.
- Venue
- Publicationes Mathematicae Debrecen
- Published
- 2022-07-01
- Volume
- 6
- Issue
- 3-4
- Pages
- 290-297
- ISSN
- 0033-3883 (ISSN-L)
- OpenAlex
- W4312512934
- Cited by
- 5,337
- References
- 0
- Citations by year
- 2026: 202 · 2025: 283 · 2024: 275 · 2023: 229 · 2022: 258 · 2021: 280 · 2020: 297 · 2019: 335 · 2018: 327 · 2017: 293 · 2016: 286 · 2015: 279 · 2014: 245 · 2013: 226 · 2012: 215
- FWCI
- 454.86
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Publicationes Mathematicae Debrecen (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Keywords
- random graphs
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