very interesting research challenge

Правка en5, от blyat, 2021-02-13 01:48:54

hello codeforces

i want to suggest a research

let's call the depth of an english wikipedia page the smallest amount of clicks on links (in the text) to reach this page.

what is (approximately) the mathematical expectation of this value (the page is chosen randomly equiprobably)? I'm waiting for your approaches (with description)!!!

Теги research, strange, topic, among us

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский blyat 2021-02-13 05:24:23 212
en5 Английский blyat 2021-02-13 01:48:54 13 Tiny change: 'edia page a minimal amount of' -> 'edia page the smallest amount of'
en4 Английский blyat 2021-02-13 01:48:26 3 Tiny change: 'epth** of english w' -> 'epth** of an english w'
en3 Английский blyat 2021-02-13 01:47:28 0 (published)
en2 Английский blyat 2021-02-13 01:47:22 4 (saved to drafts)
en1 Английский blyat 2021-02-13 01:47:06 424 Initial revision (published)