Moumanti Podder

activity

20152026

most citedGibbs measures over locally tree-like graphs and percolative entropy over infinite regular trees

8 citations · 21 across the 26 of their papers we have counts for

collaborators

29 papers

math.PR2026

Elephant random walk with attributed steps and extractions of random sizes

Sooraj M, Moumanti Podder, Archi Roy

We study a model of market economics wherein the $(n + 1)$ -st customer, for each $n ⩾ N$ , with $N$ being a prespecified positive integer, draws a sample of (random) size $K_{n…

math.PR2026

An exactly solvable evaporation-deposition PCA with long-distance interactions

Arvind Ayyer, Moumanti Podder

We consider a probabilistic cellular automaton (PCA) of evaporation-deposition on the one-dimensional lattice having $n$ sites with periodic boundary conditions, in which each site…

math.CO2025

The Maker-Breaker directed triangle game

Hrishikesh Jagtap, Moumanti Podder

In this work, we investigate Maker-Breaker directed triangle games, a directionally constrained variant of the classical Maker-Breaker triangle game. Our board of interest is a tou…

math.CO2025

The Game of Graph Nim on graphs with four edges

Sayar Karmakar, Moumanti Podder, Souvik Roy +1

This work is concerned with the study of the Game of Graph Nim -- a class of two-player combinatorial games -- on graphs with $4$ edges. To each edge of such a graph is assigned a…

math.PR2025

Elephant random walks with multiple extractions and general reinforcement functions

Moumanti Podder, Archi Roy

We consider a generalized model of elephant random walks wherein the walker, during the $(n + 1)$ -st time-stamp, draws from the past (i.e. the set ${1, 2, \dots, n}$ ) a sample of $k$ …

math.PR2024

Largest eigenvalue of positive mean Gaussian matrices

Arijit Chakrabarty, Rajat Subhra Hazra, Moumanti Podder

This short note studies the fluctuations of the largest eigenvalue of symmetric random matrices with correlated Gaussian entries having positive mean. Under the assumption that the…

stat.ME2024★ 1 cited

Nonparametric method of structural break detection in stochastic time series regression model

Archi Roy, Moumanti Podder, Soudeep Deb

We propose a novel nonparametric test to detect structural breaks in the conditional mean and/or variance of a time series. Our method does not assume any specific parametric form…

math.PR2024

Percolation games on rooted, edge-weighted random trees

Sayar Karmakar, Moumanti Podder, Souvik Roy +1

Consider a rooted Galton-Watson tree $T$ , to each of whose edges we assign, independently, a weight that equals $+ 1$ with probability $p_{1}$ , $0$ with probability $p_{0}$ and $- 1$ …

math.PR2024

Learning models on rooted regular trees with majority update policy: convergence and phase transition

Moumanti Podder, Anish Sarkar

We study a learning model in which an agent is stationed at each vertex of $T_{m}$ , the rooted tree in which each vertex has $m$ children. At any time-step $t \in \mathbb{…

math.PR2024

Generalized percolation games on the $2$ -dimensional square lattice, and ergodicity of associated probabilistic cellular automata

Dhruv Bhasin, Sayar Karmakar, Moumanti Podder +1

Each vertex of the infinite $2$ -dimensional square lattice graph is assigned, independently, a label that reads trap with probability $p$ , target with probability $q$ , and open wit…

math.PR2023

The spread of an epidemic: a game-theoretic approach

Sayar Karmakar, Moumanti Podder, Souvik Roy +1

We introduce and study a model stemming from game theory for the spread of an epidemic throughout a given population. Each agent is allowed to choose an action whose value dictates…

math.PR2023

Phase transition in percolation games on rooted Galton-Watson trees

Sayar Karmakar, Moumanti Podder, Souvik Roy +1

We study the bond percolation game and the site percolation game on the rooted Galton-Watson tree $T_{χ}$ with offspring distribution $χ$ . We obtain the probabilities of win, loss an…

math.PR2022

Ergodicity of a generalized probabilistic cellular automaton with parity-based neighbourhoods

Dhruv Bhasin, Sayar Karmakar, Moumanti Podder +1

We study a one-dimensional generalized probabilistic cellular automaton $E_{p, q}$ with universe $Z$ , alphabet $A = {0, 1}$ , parameters $p$ and $q$ such that $0…

math.PR2022

On a class of probabilistic cellular automata with size- $3$ neighbourhood and their applications in percolation games

Dhruv Bhasin, Sayar Karmakar, Moumanti Podder +1

Different versions of percolation games on $Z^{2}$ , with parameters $p$ and $q$ that indicate, respectively, the probability with which a site in $Z^{2}$ is label…

math.PR2022

Combinatorial games on Galton-Watson trees involving several-generation-jump moves

Moumanti Podder, Dhruv Bhasin

We study the $k$ -jump normal and $k$ -jump misère games on rooted Galton-Watson trees, expressing the probabilities of various outcomes of these games as specific fixed points of ce…

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 $2$ children), with o…

math.PR2020★ 1 cited

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 $k$ non-overlapping communities, for $k ⩾ 3$ , possesses $n$ vertice…

math.PR2020★ 2 cited

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 $k$ , let $α_{k}$ denote the smallest $α \in (0, 1)$ such that the random graph sequence ${G (n, n^{- α})}$ 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…

math.PR2018★ 5 cited

Random tree recursions: which fixed points correspond to tangible sets of trees?

Tobias Johnson, Moumanti Podder, Fiona Skerman

Let $B$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only i…

math.PR2018

First order theory on $G (n, c n^{- 1})$

Moumanti Podder

A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence ${G (n, c n^{- 1})}$ is not complete.…

math.PR2017★ 1 cited

Second order logic on random rooted trees

Alexander E. Holroyd, Avi Levy, Moumanti Podder +1

We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressib…

Elephant random walk with attributed steps and extractions of random sizes

An exactly solvable evaporation-deposition PCA with long-distance interactions

The Maker-Breaker directed triangle game

The Game of Graph Nim on graphs with four edges

Elephant random walks with multiple extractions and general reinforcement functions

Largest eigenvalue of positive mean Gaussian matrices

Nonparametric method of structural break detection in stochastic time series regression model

Percolation games on rooted, edge-weighted random trees

Learning models on rooted regular trees with majority update policy: convergence and phase transition

Generalized percolation games on the 2-dimensional square lattice, and ergodicity of associated probabilistic cellular automata

The spread of an epidemic: a game-theoretic approach

Phase transition in percolation games on rooted Galton-Watson trees

Ergodicity of a generalized probabilistic cellular automaton with parity-based neighbourhoods

On a class of probabilistic cellular automata with size-3 neighbourhood and their applications in percolation games

Combinatorial games on Galton-Watson trees involving several-generation-jump moves

Combinatorial games on multi-type Galton-Watson trees

Uniqueness of communities in regular stochastic block models

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

Avoidance couplings on non-complete graphs

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

Quantifier alternation in a class of recursively defined tree properties

Random tree recursions: which fixed points correspond to tangible sets of trees?

First order theory on G(n,cn−1)

Second order logic on random rooted trees

Generalized percolation games on the $2$ -dimensional square lattice, and ergodicity of associated probabilistic cellular automata

On a class of probabilistic cellular automata with size- $3$ neighbourhood and their applications in percolation games

First order theory on $G (n, c n^{- 1})$