Student Puzzle Corner
Anirban DasGupta says, “We are going to continue with our contest model introduced in the previous puzzle. Each correct answer receives 3 points, each incorrect answer receives -2 points, and each item left unanswered receives -1 point. The top three scorers will be recognized. You can answer just one of …
Deadline: March 15, 2024.
Student members of IMS are invited to submit solutions to bulletin@imstat.org (subject “Student Puzzle Corner”). If correct, we’ll publish your name (and photo, if there’s space), and the answer, in the next issue. The Puzzle Editor is Anirban DasGupta. His decision is final.
Anirban DasGupta says, …
Anirban DasGupta sets two puzzles, one on probability and one on statistics, about Erdős–Rényi graphs, among the most basic models of random graphs. Random graphs are used to model network data. Take a vertex set equal to $\{1, 2, \cdots , n\}$ where $n \geq 2$. Given two distinct vertices…
We have two problems again—but this time the statistics problem and the probability problem are both based on the same story, and both are somewhat non-standard versions of the birthday problem. Student members of IMS are invited to send us your answers for either or both. The deadline is EXTENDED …
Student Puzzle Editor Anirban DasGupta poses another two problems, and says, “Our statistics problem this time is on universally consistent estimation of the regression coefficients for not necessarily Gaussian errors, and the probability problem is on probabilistic graph theory. The statistics problem is a practically important problem that will make …