Almost surely (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Almost surely" in English language version.

Last modified: 16:34:45, 3 August 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

6^th place

6^th place

2^nd place

2^nd place

4^th place

4^th place

1,091^st place

1,169^th place

9,054^th place

5,053^rd place

292^nd place

233^rd place

11semanticscholar.org

15^th place

8^th place

11books.google.com

3^rd place

3^rd place

archive.org (Global: 6^th place; English: 6^th place)

Grädel, Erich; Kolaitis, Phokion G.; Libkin, Leonid; Marx, Maarten; Spencer, Joel; Vardi, Moshe Y.; Venema, Yde; Weinstein, Scott (2007). Finite Model Theory and Its Applications. Springer. p. 232. ISBN 978-3-540-00428-8.
Jacod, Jean; Protter (2004). Probability Essentials. Springer. p. 37. ISBN 978-3-540-438717.

books.google.com (Global: 3^rd place; English: 3^rd place)

Spencer, Joel H. (2001). "0. Two Starting Examples". The Strange Logic of Random Graphs. Algorithms and Combinatorics. Vol. 22. Springer. p. 4. ISBN 978-3540416548.

doi.org (Global: 2^nd place; English: 2^nd place)

Williamson, Timothy (2007-07-01). "How probable is an infinite sequence of heads?". Analysis. 67 (3): 173–180. doi:10.1093/analys/67.3.173. ISSN 0003-2638.
Friedgut, Ehud; Rödl, Vojtech; Rucinski, Andrzej; Tetali, Prasad (January 2006). "A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring". Memoirs of the American Mathematical Society. 179 (845). AMS Bookstore: 3–4. doi:10.1090/memo/0845. ISSN 0065-9266. S2CID 9143933.

oup.com (Global: 292^nd place; English: 233^rd place)

academic.oup.com

Williamson, Timothy (2007-07-01). "How probable is an infinite sequence of heads?". Analysis. 67 (3): 173–180. doi:10.1093/analys/67.3.173. ISSN 0003-2638.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Friedgut, Ehud; Rödl, Vojtech; Rucinski, Andrzej; Tetali, Prasad (January 2006). "A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring". Memoirs of the American Mathematical Society. 179 (845). AMS Bookstore: 3–4. doi:10.1090/memo/0845. ISSN 0065-9266. S2CID 9143933.

uregina.ca (Global: 9,054^th place; English: 5,053^rd place)

mathcentral.uregina.ca

"Almost surely - Math Central". mathcentral.uregina.ca. Retrieved 2019-11-16.

wolfram.com (Global: 1,091^st place; English: 1,169^th place)

mathworld.wolfram.com

Weisstein, Eric W. "Almost Surely". mathworld.wolfram.com. Retrieved 2019-11-16.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Williamson, Timothy (2007-07-01). "How probable is an infinite sequence of heads?". Analysis. 67 (3): 173–180. doi:10.1093/analys/67.3.173. ISSN 0003-2638.
Friedgut, Ehud; Rödl, Vojtech; Rucinski, Andrzej; Tetali, Prasad (January 2006). "A Sharp Threshold for Random Graphs with a Monochromatic Triangle in Every Edge Coloring". Memoirs of the American Mathematical Society. 179 (845). AMS Bookstore: 3–4. doi:10.1090/memo/0845. ISSN 0065-9266. S2CID 9143933.