Staff profile

• Combinatorics
• Probability
• Statistical mechanics

Journal Article

• Rahman, M., & Virag, B. (in press). Infinite geodesics, competition interfaces and the second class particle in the scaling limit. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques,
• Isgur, A., Kuznetsov, V., Rahman, M., & Tanny, S. (online). Nested Recursions, Simultaneous Parameters and Tree Superpositions. Electronic Journal of Combinatorics, 21(1), 1-40
• Johansson, K., & Rahman, M. (2022). On inhomogeneous polynuclear growth. Annals of Probability, 50(2), 559-590. https://doi.org/10.1214/21-aop1540
• Johansson, K., & Rahman, M. (2021). Multi-time distribution in discrete polynuclear growth. Communications on Pure and Applied Mathematics, 74(12), 2561-2627. https://doi.org/10.1002/cpa.21980
• Quastel, J., & Rahman, M. (2020). TASEP fluctuations with soft-shock initial data. Annales Henri Lebesgue, 3, 999-1021. https://doi.org/10.5802/ahl.52
• Huang, B., & Rahman, M. (2019). On the local geometry of graphs in terms of their spectra. European Journal of Combinatorics, 81, 378-393. https://doi.org/10.1016/j.ejc.2019.07.001
• Gorin, V., & Rahman, M. (2019). Random sorting networks: local statistics via random matrix laws. Probability Theory and Related Fields, 175(1-2), 45-96. https://doi.org/10.1007/s00440-018-0886-1
• Rahman, M., Virág, B., & Vizer, M. (2019). Geometry of Permutation Limits. Combinatorica, 39, 933-960. https://doi.org/10.1007/s00493-019-3817-6
• Chen, W.-K., Gamarnik, D., Panchenko, D., & Rahman, M. (2019). Suboptimality of local algorithms for a class of max-cut problems. Annals of Probability, 47(3), 1587-1618. https://doi.org/10.1214/18-aop1291
• Rahman, M., & Virág, B. (2017). Local algorithms for independent sets are half-optimal. Annals of Probability, 45(3), 1543-1577. https://doi.org/10.1214/16-aop1094
• Rahman, M. (2016). Percolation with Small Clusters on Random Graphs. Graphs and Combinatorics, 32(3), 1167-1185. https://doi.org/10.1007/s00373-015-1628-0
• Rahman, M. (2016). Factor of IID Percolation on Trees. SIAM Journal on Discrete Mathematics, 30(4), 2217--2242. https://doi.org/10.1137/15m1021362
• Isgur, A., Rahman, M., & Tanny, S. (2013). Solving Non-Homogeneous Nested Recursions Using Trees. Annals of Combinatorics, 17(4), https://doi.org/10.1007/s00026-013-0202-9
• Dalton, B., Rahman, M., & Tanny, S. (2011). Spot-Based Generations for Meta-Fibonacci Sequences. Experimental Mathematics, 20(2), https://doi.org/10.1080/10586458.2011.544565
• Isgur, A., & Rahman, M. (2011). On variants of Conway and Conolly's Meta-Fibonacci recursions. Electronic Journal of Combinatorics, 18(1), Article P96. https://doi.org/10.37236/583