Sparse network (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sparse network" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

69^th place

59^th place

4^th place

4^th place

low place

low place

485^th place

440^th place

18^th place

17^th place

1episciences.org

low place

low place

1semanticscholar.org

11^th place

8^th place

1mathinsight.org

low place

low place

1small-project.eu

low place

low place

arxiv.org

Janson, Svante (2018). "On Edge Exchangeable Random Graphs". J Stat Phys. 173 (3–4): 448–484. arXiv:1702.06396. Bibcode:2018JSP...173..448J. doi:10.1007/s10955-017-1832-9. PMC 6405020. PMID 30930480.
Scholz, Matthias (7 January 2015). "Node similarity as a basic principle behind connectivity in complex networks". Journal of Data Mining and Digital Humanities. 2015 (77). arXiv:1010.0803. doi:10.46298/jdmdh.33. S2CID 221799. Retrieved 25 May 2015.

barabasi.com

Barabási, Albert-László (2015). Network Science. Cambridge University Press. Retrieved 25 May 2015.

doi.org

Janson, Svante (2018). "On Edge Exchangeable Random Graphs". J Stat Phys. 173 (3–4): 448–484. arXiv:1702.06396. Bibcode:2018JSP...173..448J. doi:10.1007/s10955-017-1832-9. PMC 6405020. PMID 30930480.
van der Hofstad, Remco (2017). Random Graphs and Complex Networks. Cambridge University Press. doi:10.1017/9781316779422. ISBN 9781316779422.
Scholz, Matthias (7 January 2015). "Node similarity as a basic principle behind connectivity in complex networks". Journal of Data Mining and Digital Humanities. 2015 (77). arXiv:1010.0803. doi:10.46298/jdmdh.33. S2CID 221799. Retrieved 25 May 2015.

episciences.org

jdmdh.episciences.org

Scholz, Matthias (7 January 2015). "Node similarity as a basic principle behind connectivity in complex networks". Journal of Data Mining and Digital Humanities. 2015 (77). arXiv:1010.0803. doi:10.46298/jdmdh.33. S2CID 221799. Retrieved 25 May 2015.

harvard.edu

ui.adsabs.harvard.edu

Janson, Svante (2018). "On Edge Exchangeable Random Graphs". J Stat Phys. 173 (3–4): 448–484. arXiv:1702.06396. Bibcode:2018JSP...173..448J. doi:10.1007/s10955-017-1832-9. PMC 6405020. PMID 30930480.

mathinsight.org

Nykamp, Duane Q. "An introduction to networks". Math Insight. Retrieved 25 May 2015.

nih.gov

ncbi.nlm.nih.gov

Janson, Svante (2018). "On Edge Exchangeable Random Graphs". J Stat Phys. 173 (3–4): 448–484. arXiv:1702.06396. Bibcode:2018JSP...173..448J. doi:10.1007/s10955-017-1832-9. PMC 6405020. PMID 30930480.

pubmed.ncbi.nlm.nih.gov

Janson, Svante (2018). "On Edge Exchangeable Random Graphs". J Stat Phys. 173 (3–4): 448–484. arXiv:1702.06396. Bibcode:2018JSP...173..448J. doi:10.1007/s10955-017-1832-9. PMC 6405020. PMID 30930480.

oup.com

global.oup.com

Newman, Mark. Networks 2nd Edition. Retrieved 14 Feb 2021.

semanticscholar.org

api.semanticscholar.org

Scholz, Matthias (7 January 2015). "Node similarity as a basic principle behind connectivity in complex networks". Journal of Data Mining and Digital Humanities. 2015 (77). arXiv:1010.0803. doi:10.46298/jdmdh.33. S2CID 221799. Retrieved 25 May 2015.

small-project.eu

Gribonval, Rémi. "Sparse Models, Algorithms and Learning for Large-scale data". SMALL. Retrieved 25 May 2015.