D. Ralaivaosaona

activity

20152026

most citedA central limit theorem for almost local additive tree functionals

5 citations · 17 across the 7 of their papers we have counts for

collaborators

8 papers

math.PR2026

Asymptotic normality for general subtree counts in conditioned Galton--Watson trees

Fameno Rakotoniaina, Dimbinaina Ralaivaosaona

Let $T$ denote a Galton--Watson tree with offspring distribution $ξ$ satisfying $E (ξ) = 1$ , and let $T_{n}$ be the Galton--Watson tree conditioned to hav…

math.CO2025

Paired domination in trees: A linear algorithm and asymptotic normality

Michael A. Henning, Dimbinaina Ralaivaosaona

A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ contains a perfect matching (n…

math.CO2020

The birth of the strong components

Sergey Dovgal, Élie de Panafieu, Dimbinaina Ralaivaosaona +2

Random directed graphs $D (n, p)$ undergo a phase transition around the point $p = 1/ n$ , and the width of the transition window has been known since the works of Luczak and Seierstad…

math.AG2020★ 2 cited

Higher rank motivic Donaldson-Thomas invariants of $A^{3}$ 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 $A^{3}$ , generalising to higher rank a result of Behrend, B…

math.NT2020

An explicit upper bound for Siegel zeros of imaginary quadratic fields

Dimbinaina Ralaivaosaona, Faratiana Brice Razakarinoro

For any integer $d \geq 3$ such that $- d$ is a fundamental discriminant, we show that the Dirichlet $L$ -function associated with the real primitive character $χ(\cdot)=(\frac{-d}{\c…

math.CO2018★ 5 cited

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…

math.CO2016★ 5 cited

Additive functionals of $d$ -ary increasing trees

Dimbinaina Ralaivaosaona, Stephan Wagner

A tree functional is called additive if it satisfies a recursion of the form $F (T) = \sum_{j = 1}^{k} F (B_{j}) + f (T)$ , where $B_{1}, \dots, B_{k}$ are the branches of the tree $T$ and $f (T)$ …

math.NT2015★ 5 cited

Multi-Base Representations of Integers: Asymptotic Enumeration and Central Limit Theorems

Daniel Krenn, Dimbinaina Ralaivaosaona, Stephan Wagner

In a multi-base representation of an integer (in contrast to, for example, the binary or decimal representation) the base (or radix) is replaced by products of powers of single bas…