Hyperbolic geometric graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hyperbolic geometric graph" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

6harvard.edu

18^th place

17^th place

5arxiv.org

69^th place

59^th place

4semanticscholar.org

11^th place

8^th place

3nih.gov

4^th place

2web.archive.org

1^st place

1soton.ac.uk

6,219^th place

4,029^th place

1archive.org

6^th place

1dagstuhl.de

low place

archive.org

Meyerhenke, Henning; Laue, Sören; Özdayi, Mustafa; von Looz, Moritz (2016-06-30). "Generating massive complex networks with hyperbolic geometry faster in practice". arXiv.org. arXiv:1606.09481. Bibcode:2016arXiv160609481V. {{cite journal}}: Cite journal requires |journal= (help)

arxiv.org

Barthélemy, Marc (2011). "Spatial networks". Physics Reports. 499 (1–3): 1–101. arXiv:1010.0302. Bibcode:2011PhR...499....1B. doi:10.1016/j.physrep.2010.11.002. S2CID 4627021.
Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim; Vahdat, Amin; Boguñá, Marián (2010). "Hyperbolic geometry of complex networks". Physical Review E. 82 (3): 036106. arXiv:1006.5169. Bibcode:2010PhRvE..82c6106K. doi:10.1103/PhysRevE.82.036106. PMID 21230138. S2CID 6451908.
Krioukov, Dmitri; Orsini, Chiara; Aldecoa, Rodrigo (2015-03-17). "Hyperbolic Graph Generator". Computer Physics Communications. 196: 492–496. arXiv:1503.05180. Bibcode:2015CoPhC.196..492A. doi:10.1016/j.cpc.2015.05.028. S2CID 8454036.
Meyerhenke, Henning; Laue, Sören; Özdayi, Mustafa; von Looz, Moritz (2016-06-30). "Generating massive complex networks with hyperbolic geometry faster in practice". arXiv.org. arXiv:1606.09481. Bibcode:2016arXiv160609481V. {{cite journal}}: Cite journal requires |journal= (help)
Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M. Ángeles; Boguñá, Marián; Krioukov, Dmitri (12 September 2012). "Popularity versus similarity in growing networks". Nature. 489 (7417): 537–540. arXiv:1106.0286. Bibcode:2012Natur.489..537P. doi:10.1038/nature11459. PMID 22972194. S2CID 4424179.

dagstuhl.de

drops.dagstuhl.de

Penschuck, Manuel (2017). "Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory". Schloss Dagstuhl - Leibniz-Zentrum für Informatik GMBH, Wadern/Saarbruecken, Germany. Leibniz International Proceedings in Informatics (LIPIcs). 75: 26:1–26:21. doi:10.4230/lipics.sea.2017.26. ISBN 9783959770361. Archived from the original on 2023-02-04. Retrieved 2023-02-04.

doi.org

Barthélemy, Marc (2011). "Spatial networks". Physics Reports. 499 (1–3): 1–101. arXiv:1010.0302. Bibcode:2011PhR...499....1B. doi:10.1016/j.physrep.2010.11.002. S2CID 4627021.
Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim; Vahdat, Amin; Boguñá, Marián (2010). "Hyperbolic geometry of complex networks". Physical Review E. 82 (3): 036106. arXiv:1006.5169. Bibcode:2010PhRvE..82c6106K. doi:10.1103/PhysRevE.82.036106. PMID 21230138. S2CID 6451908.
Barnett, L.; Di Paolo, E.; Bullock, S. (2007). "Spatially embedded random networks" (PDF). Physical Review E. 76 (5): 056115. Bibcode:2007PhRvE..76e6115B. doi:10.1103/PhysRevE.76.056115. PMID 18233726. Archived (PDF) from the original on 2023-02-04. Retrieved 2023-02-04.
Krioukov, Dmitri; Orsini, Chiara; Aldecoa, Rodrigo (2015-03-17). "Hyperbolic Graph Generator". Computer Physics Communications. 196: 492–496. arXiv:1503.05180. Bibcode:2015CoPhC.196..492A. doi:10.1016/j.cpc.2015.05.028. S2CID 8454036.
von Looz, Moritz; Meyerhenke, Henning; Prutkin, Roman (2015). "Generating Random Hyperbolic Graphs in Subquadratic Time". In Elbassioni, Khaled; Makino, Kazuhisa (eds.). Algorithms and Computation. Lecture Notes in Computer Science. Vol. 9472. Springer Berlin Heidelberg. pp. 467–478. doi:10.1007/978-3-662-48971-0_40. ISBN 9783662489710.
Penschuck, Manuel (2017). "Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory". Schloss Dagstuhl - Leibniz-Zentrum für Informatik GMBH, Wadern/Saarbruecken, Germany. Leibniz International Proceedings in Informatics (LIPIcs). 75: 26:1–26:21. doi:10.4230/lipics.sea.2017.26. ISBN 9783959770361. Archived from the original on 2023-02-04. Retrieved 2023-02-04.
Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M. Ángeles; Boguñá, Marián; Krioukov, Dmitri (12 September 2012). "Popularity versus similarity in growing networks". Nature. 489 (7417): 537–540. arXiv:1106.0286. Bibcode:2012Natur.489..537P. doi:10.1038/nature11459. PMID 22972194. S2CID 4424179.

harvard.edu

ui.adsabs.harvard.edu

Barthélemy, Marc (2011). "Spatial networks". Physics Reports. 499 (1–3): 1–101. arXiv:1010.0302. Bibcode:2011PhR...499....1B. doi:10.1016/j.physrep.2010.11.002. S2CID 4627021.
Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim; Vahdat, Amin; Boguñá, Marián (2010). "Hyperbolic geometry of complex networks". Physical Review E. 82 (3): 036106. arXiv:1006.5169. Bibcode:2010PhRvE..82c6106K. doi:10.1103/PhysRevE.82.036106. PMID 21230138. S2CID 6451908.
Barnett, L.; Di Paolo, E.; Bullock, S. (2007). "Spatially embedded random networks" (PDF). Physical Review E. 76 (5): 056115. Bibcode:2007PhRvE..76e6115B. doi:10.1103/PhysRevE.76.056115. PMID 18233726. Archived (PDF) from the original on 2023-02-04. Retrieved 2023-02-04.
Krioukov, Dmitri; Orsini, Chiara; Aldecoa, Rodrigo (2015-03-17). "Hyperbolic Graph Generator". Computer Physics Communications. 196: 492–496. arXiv:1503.05180. Bibcode:2015CoPhC.196..492A. doi:10.1016/j.cpc.2015.05.028. S2CID 8454036.
Meyerhenke, Henning; Laue, Sören; Özdayi, Mustafa; von Looz, Moritz (2016-06-30). "Generating massive complex networks with hyperbolic geometry faster in practice". arXiv.org. arXiv:1606.09481. Bibcode:2016arXiv160609481V. {{cite journal}}: Cite journal requires |journal= (help)
Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M. Ángeles; Boguñá, Marián; Krioukov, Dmitri (12 September 2012). "Popularity versus similarity in growing networks". Nature. 489 (7417): 537–540. arXiv:1106.0286. Bibcode:2012Natur.489..537P. doi:10.1038/nature11459. PMID 22972194. S2CID 4424179.

nih.gov

pubmed.ncbi.nlm.nih.gov

Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim; Vahdat, Amin; Boguñá, Marián (2010). "Hyperbolic geometry of complex networks". Physical Review E. 82 (3): 036106. arXiv:1006.5169. Bibcode:2010PhRvE..82c6106K. doi:10.1103/PhysRevE.82.036106. PMID 21230138. S2CID 6451908.
Barnett, L.; Di Paolo, E.; Bullock, S. (2007). "Spatially embedded random networks" (PDF). Physical Review E. 76 (5): 056115. Bibcode:2007PhRvE..76e6115B. doi:10.1103/PhysRevE.76.056115. PMID 18233726. Archived (PDF) from the original on 2023-02-04. Retrieved 2023-02-04.
Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M. Ángeles; Boguñá, Marián; Krioukov, Dmitri (12 September 2012). "Popularity versus similarity in growing networks". Nature. 489 (7417): 537–540. arXiv:1106.0286. Bibcode:2012Natur.489..537P. doi:10.1038/nature11459. PMID 22972194. S2CID 4424179.

semanticscholar.org

api.semanticscholar.org

Barthélemy, Marc (2011). "Spatial networks". Physics Reports. 499 (1–3): 1–101. arXiv:1010.0302. Bibcode:2011PhR...499....1B. doi:10.1016/j.physrep.2010.11.002. S2CID 4627021.
Krioukov, Dmitri; Papadopoulos, Fragkiskos; Kitsak, Maksim; Vahdat, Amin; Boguñá, Marián (2010). "Hyperbolic geometry of complex networks". Physical Review E. 82 (3): 036106. arXiv:1006.5169. Bibcode:2010PhRvE..82c6106K. doi:10.1103/PhysRevE.82.036106. PMID 21230138. S2CID 6451908.
Krioukov, Dmitri; Orsini, Chiara; Aldecoa, Rodrigo (2015-03-17). "Hyperbolic Graph Generator". Computer Physics Communications. 196: 492–496. arXiv:1503.05180. Bibcode:2015CoPhC.196..492A. doi:10.1016/j.cpc.2015.05.028. S2CID 8454036.
Papadopoulos, Fragkiskos; Kitsak, Maksim; Serrano, M. Ángeles; Boguñá, Marián; Krioukov, Dmitri (12 September 2012). "Popularity versus similarity in growing networks". Nature. 489 (7417): 537–540. arXiv:1106.0286. Bibcode:2012Natur.489..537P. doi:10.1038/nature11459. PMID 22972194. S2CID 4424179.

soton.ac.uk

eprints.soton.ac.uk

Barnett, L.; Di Paolo, E.; Bullock, S. (2007). "Spatially embedded random networks" (PDF). Physical Review E. 76 (5): 056115. Bibcode:2007PhRvE..76e6115B. doi:10.1103/PhysRevE.76.056115. PMID 18233726. Archived (PDF) from the original on 2023-02-04. Retrieved 2023-02-04.

web.archive.org

Barnett, L.; Di Paolo, E.; Bullock, S. (2007). "Spatially embedded random networks" (PDF). Physical Review E. 76 (5): 056115. Bibcode:2007PhRvE..76e6115B. doi:10.1103/PhysRevE.76.056115. PMID 18233726. Archived (PDF) from the original on 2023-02-04. Retrieved 2023-02-04.
Penschuck, Manuel (2017). "Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory". Schloss Dagstuhl - Leibniz-Zentrum für Informatik GMBH, Wadern/Saarbruecken, Germany. Leibniz International Proceedings in Informatics (LIPIcs). 75: 26:1–26:21. doi:10.4230/lipics.sea.2017.26. ISBN 9783959770361. Archived from the original on 2023-02-04. Retrieved 2023-02-04.