Timeline for Concentration of $k$-th pairwise distance of random points in a unit square
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 10, 2022 at 0:50 | answer | added | AspiringMat | timeline score: 1 | |
| Jan 29, 2022 at 2:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 1, 2021 at 1:08 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 1, 2021 at 0:59 | answer | added | Sangchul Lee | timeline score: 0 | |
| Aug 28, 2021 at 2:19 | comment | added | Jukka Kohonen | Somewhat related, although it asks about the sum of (some number of) smallest pairwise distances: mathoverflow.net/questions/309063/… | |
| Aug 28, 2021 at 1:55 | comment | added | AspiringMat | @JukkaKohonen Large $n$, asymptotics work as well. | |
| Aug 28, 2021 at 1:27 | comment | added | Jukka Kohonen | Are you interested in very small $n$ (say, $n \le 5$), very large $n$, or something between? | |
| Aug 27, 2021 at 23:43 | history | edited | LSpice | CC BY-SA 4.0 |
Moved math shifts
|
| Aug 27, 2021 at 22:56 | history | edited | J.J. Green | CC BY-SA 4.0 |
TeXisms
|
| Aug 27, 2021 at 22:41 | history | asked | AspiringMat | CC BY-SA 4.0 |