The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
Class of correlated random networks with hidden variables
Open accessAbstract
We study a class of models of correlated random networks in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological properties of these models as a function of the distribution of hidden variables and the probability of connecting vertices. The expressions obtained are checked by means of numerical simulations in a particular example. The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure. We also present an extension of the class, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Self-citationLethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Cited by
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
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
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
Self-citationDetecting rich-club ordering in complex networks
Colizza, V., Flammini, A., Serrano, M. A., & Vespignani, A. (2006) · Nature Physics · doi:10.1038/nphys209 · Cited by 1,001
“In turn, the quantity E kk ′ can be expressed as a function of the joint degree probability distribution 11,21,28,29 via the identity R R From Eq.”
BackgroundModels of social networks based on social distance attachment
Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., & Arenas, A. (2004) · Physical Review E · doi:10.1103/physreve.70.056122 · Cited by 769
Self-citationScale-Free Networks: Complex Webs in Nature and Technology
Caldarelli, G. (2007) · doi:10.1093/acprof:oso/9780199211517.001.0001 · Cited by 748
Generation of uncorrelated random scale-free networks
Catanzaro, M., Boguñá, M., & Pastor-Satorras, R. (2005) · Physical Review E · doi:10.1103/physreve.71.027103 · Cited by 739
Self-citationActivity 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
Self-citationStatistical mechanics of networks
Park, J., & Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.70.066117 · Cited by 673
Popularity versus similarity in growing networks
Papadopoulos, F., Kitsak, M., Serrano, M. Á., Boguñá, M., & Krioukov, D. (2012) · Nature · doi:10.1038/nature11459 · Cited by 634
Self-citationNavigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
Self-citationThe statistical physics of real-world networks
Cimini, G., Squartini, T., Saracco, F., Garlaschelli, D., Gabrielli, A., & Caldarelli, G. (2019) · Nature Reviews Physics · doi:10.1038/s42254-018-0002-6 · Cited by 378
Complex Networks: Principles, Methods and Applications
Latora, V., Nicosia, V., & Russo, G. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316216002 · Cited by 372
Entropy measures for networks: Toward an information theory of complex topologies
Anand, K., & Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.80.045102 · Cited by 368
Fitness-Dependent Topological Properties of the World Trade Web
Garlaschelli, D., & Loffredo, M. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.188701 · Cited by 368
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Baronchelli, A., Ferrer-i-Cancho, R., Pastor-Satorras, R., Chater, N., & Christiansen, M. H. (2013) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2013.04.010 · Cited by 333
Self-citationSelf-Similarity of Complex Networks and Hidden Metric Spaces
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.078701 · Cited by 332
Self-citationAverage path length in random networks
Fronczak, A., Fronczak, P., & Hołyst, J. A. (2004) · Physical Review E · doi:10.1103/physreve.70.056110 · Cited by 326
Cut-offs and finite size effects in scale-free networks
Boguñá, M., Pastor-Satorras, R., & Vespignani, A. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00038-8 · Cited by 309
Self-citationWater for food: The global virtual water trade network
Konar, M., Dalin, C., Suweis, S., Hanasaki, N., Rinaldo, A., & Rodriguez‐Iturbe, I. (2011) · Water Resources Research · doi:10.1029/2010wr010307 · Cited by 285
Bianconi, G. (2009) · Physical Review E · doi:10.1103/physreve.79.036114 · Cited by 273
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
Krioukov, D., Kitsak, M., Sinkovits, R. S., Rideout, D., Meyer, D., & Boguñá, M. (2012) · Scientific Reports · doi:10.1038/srep00793 · Cited by 128
Self-citationPercolation in self-similar networks
Serrano, M. Á., Krioukov, D., & Boguñá, M. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.048701 · Cited by 47
Self-citationTraffic in Social Media II: Modeling Bursty Popularity
Ratkiewicz, J., Menczer, F., Fortunato, S., Flammini, A., & Vespignani, A. (2010) · 2010 IEEE Second International Conference on Social Computing · doi:10.1109/socialcom.2010.63 · Cited by 38
Metadata
- Authors
- Boguñá, M., & Pastor-Satorras, R.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2003-09-15
- Volume
- 68
- Issue
- 3
- Pages
- 036112-036112
- ISSN
- 1063-651X (ISSN-L)
- 1095-3787
- OpenAlex
- W1995052256
- Cited by
- 452
- References
- 47
- FWCI
- 13.38
- 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
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.