Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Moumanti Podder"'
Autor:
Moumanti Podder, Maksim Zhukovskii
Publikováno v:
ACM Transactions on Computational Logic. 23:1-27
For any fixed positive integer k , let α k denote the smallest α ∈ (0,1) such that the random graph sequence { G ( n, n -α )} n does not satisfy the zero-one law for the set ε k of all existential first-order sentences that are of quantifier de
Autor:
Erik Bates, Moumanti Podder
Publikováno v:
Random Structures & Algorithms. 59:25-52
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 processes have focused almost exclusively on complete graphs, in particula
Publikováno v:
Johnson, T, Podder, M & Skerman, F 2019, ' Random tree recursions : Which fixed points correspond to tangible sets of trees? ', Random Structures and Algorithms . https://doi.org/10.1002/rsa.20895
Let $\mathcal{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 if its root has children $u$ and $v$ such that the subtrees rooted at $
Autor:
Moumanti Podder
Publikováno v:
European Journal of Combinatorics. 78:214-235
A well-known result from the 1960 paper of Erdős and Renyi (1960) [2] tells us that the almost sure theory for first order language on the random graph sequence G ( n , c n − 1 ) is not complete. Our paper proposes and proves what the complete set
Publikováno v:
Discrete Mathematics. 342:152-167
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 expressible as an existential monadic second order sentence (EMSO). On the othe
Autor:
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 at rate $1$, sending two of its particles to neighbouring sites chosen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91d7388747fd69f167e22d8fe55c5b0c
http://arxiv.org/abs/2001.04268
http://arxiv.org/abs/2001.04268
Autor:
Krishanu Maulik, Moumanti Podder
Publikováno v:
Statistics & Probability Letters. 117:173-182
Our work aims to study the tail behaviour of weighted sums of the form $\sum_{i=1}^{\infty} X_{i} \prod_{j=1}^{i}Y_{j}$, where $(X_{i}, Y_{i})$ are independent and identically distributed, with common joint distribution bivariate Sarmanov. Such quant
Autor:
Joel Spencer, Moumanti Podder
Publikováno v:
A Journey Through Discrete Mathematics ISBN: 9783319444789
In the regime of Galton–Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such finite subtre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a03b8af22df4ec0b6a1d1aa0a4504a87
https://doi.org/10.1007/978-3-319-44479-6_29
https://doi.org/10.1007/978-3-319-44479-6_29
Autor:
Joel Spencer, Moumanti Podder
Publikováno v:
Electron. Commun. Probab.
We are concerned with exploring the probabilities of first order statements for Galton-Watson trees with $Poisson(c)$ offspring distribution. Fixing a positive integer $k$, we exploit the $k$-move Ehrenfeucht game on rooted trees for this purpose. Le
Autor:
Moumanti Podder, Tim Austin
Consider a statistical physical model on the $d$-regular infinite tree $T_{d}$ described by a set of interactions $\Phi$. Let $\{G_{n}\}$ be a sequence of finite graphs with vertex sets $V_n$ that locally converge to $T_{d}$. From $\Phi$ one can cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::83ce2ab5515c8bf6af75063fe13b11ea