2 citations · 2 across the 4 of their papers we have counts for
6 papers
Asymptotic normality for general subtree counts in conditioned Galton--Watson trees
Fameno Rakotoniaina, Dimbinaina Ralaivaosaona
Let denote a Galton--Watson tree with offspring distribution satisfying , and let be the Galton--Watson tree conditioned to hav…
Paired domination in trees: A linear algorithm and asymptotic normality
Michael A. Henning, Dimbinaina Ralaivaosaona
A set of vertices in a graph is a paired dominating set if every vertex of is adjacent to a vertex in and the subgraph induced by contains a perfect matching (n…
Higher rank motivic Donaldson-Thomas invariants of via wall-crossing, and asymptotics
Alberto Cazzaniga, Dimbinaina Ralaivaosaona, Andrea T. Ricolfi
We compute, via motivic wall-crossing, the generating function of virtual motives of the Quot scheme of points on , generalising to higher rank a result of Behrend, B…
An explicit upper bound for Siegel zeros of imaginary quadratic fields
Dimbinaina Ralaivaosaona, Faratiana Brice Razakarinoro
For any integer such that is a fundamental discriminant, we show that the Dirichlet -function associated with the real primitive character $χ(\cdot)=(\frac{-d}{\c…
A central limit theorem for almost local additive tree functionals
Dimbinaina Ralaivaosaona, Matas Šileikis, Stephan Wagner
An additive functional of a rooted tree is a functional that can be calculated recursively as the sum of the values of the functional over the branches, plus a certain toll functio…
Additive functionals of -ary increasing trees
Dimbinaina Ralaivaosaona, Stephan Wagner
A tree functional is called additive if it satisfies a recursion of the form , where are the branches of the tree and …