activity
20162021
most citedSecond order logic on random rooted trees

1 citations · 1 across the 3 of their papers we have counts for

collaborators

9 papers

math.PR2021

Combinatorial games on multi-type Galton-Watson trees

Moumanti Podder

When normal and misère games are played on bi-type binary Galton-Watson trees (with vertices coloured blue or red and each having either no child or precisely children), with o…

math.PR2020

Uniqueness of communities in regular stochastic block models

Sayar Karmakar, Moumanti Podder

This paper studies the regular stochastic block model comprising \emph{several} communities: each of the non-overlapping communities, for , possesses vertice…

math.PR2020

Uniform threshold for fixation of the stochastic sandpile model on the line

Moumanti Podder, Leonardo T. Rolla

We consider the abelian stochastic sandpile model. In this model, a site is deemed unstable when it contains more than one particle. Each unstable site, independently, is toppled a…

math.PR2020

Avoidance couplings on non-complete graphs

Erik Bates, Moumanti Podder

A coupling of random walkers on the same finite graph, who take turns sequentially, is said to be an avoidance coupling if the walkers never collide. Previous studies of these proc…

math.PR2019

Zero-one laws for existential first order sentences of bounded quantifier depth

Moumanti Podder, Maksim Zhukovskii

For any fixed positive integer , let denote the smallest such that the random graph sequence does not satisfy the z…

math.LO2019

Quantifier alternation in a class of recursively defined tree properties

Moumanti Podder

Alternating quantifier depth is a natural measure of difficulty required to express first order logical sentences. We define a sequence of first order properties on rooted, locally…