Sarat Moka

Mathematics

1. Rejection Sampling 100%
2. Perfect Sampling 78%
3. Multiclass Queueing Networks 78%
4. Queueing Networks 61%
5. Rare Events 61%
6. Subset Selection 56%
7. Importance Sampling 51%
8. Hard Spheres 49%
9. Continuous Optimization 48%
10. Perfect Simulation 48%
11. Heavy Tails 44%
12. Estimator 43%
13. Random Geometric Graph 42%
14. Q-learning 40%
15. Multi-class 40%
16. Point Process 40%
17. Simulation 40%
18. Unbiased Estimation 39%
19. Spatial Point Process 36%
20. Variance Component Model 35%
21. Coordinate Descent 33%
22. Poisson Point Process 33%
23. Standard deviation 32%
24. Regeneration 30%
25. Scheduling Policy 25%
26. Variance Reduction 22%
27. Bernoulli 21%
28. Performance Measures 21%
29. Network Flow 21%
30. Diffusion Limit 21%
31. Sampling Methods 20%
32. Partial 20%
33. Sums of Independent Random Variables 20%
34. Large Deviation Theory 20%
35. Mean deviation 19%
36. Coupling from the Past 19%
37. Markov Process 19%
38. Large Deviations 18%
39. Routing 17%
40. Interaction 17%
41. Random variable 17%
42. Non-negative 16%
43. Applied Probability 16%
44. Asymptotic Variance 16%
45. Model 16%
46. Justify 16%
47. Asymptotic Analysis 15%
48. Markov Random Field 15%
49. Engineering 15%
50. Central limit theorem 14%