Search results for "Binary tree"

showing 4 items of 44 documents

CENTRAL LIMIT THEOREM FOR BIFURCATING MARKOV CHAINS

2020

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We first provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (2007), where the considered additive functionals are sums of martingale increments, and only one regime appears. Our first result can be seen as a discrete time version, but with general trait evoluti…

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]fluctuations for tree indexed Markov chain60J80[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Bifurcating Markov chains60F05binary trees62G05[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 60J05
researchProduct

The b-chromatic number of power graphs

2003

The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.

b-chromatic numberGeneral Computer Science[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]power graphTheoretical Computer ScienceCombinatoricsComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsChromatic scaleGraph coloringcoloringMathematicscycle and complete binary treeMathematics::CombinatoricsBinary treelcsh:Mathematicscycle and complete binary tree.path[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Complete coloringlcsh:QA1-939Vertex (geometry)Brooks' theorem[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Edge coloringFractional coloringDiscrete Mathematics & Theoretical Computer Science
researchProduct

KERNEL ESTIMATION OF THE TRANSITION DENSITY IN BIFURCATING MARKOV CHAINS

2023

We study the kernel estimator of the transition density of bifurcating Markov chains. Under some ergodic and regularity properties, we prove that this estimator is consistent and asymptotically normal. Next, in the numerical studies, we propose two data-driven methods to choose the bandwidth parameters. These methods are based on the so-called two bandwidths approach.

cross validation methodKernel estimatorrule of thumb type methodasymptotic normalitybinary trees[MATH.MATH-ST] Mathematics [math]/Statistics [math.ST]bifurcating Markov chains[STAT] Statistics [stat]
researchProduct

Central limit theorem for bifurcating Markov chains under L 2 -ergodic conditions

2021

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for additive functionals of BMC under L 2-ergodic conditions with three different regimes. This completes the pointwise approach developed in a previous work. As application, we study the elementary case of symmetric bifurcating autoregressive process, which justify the non-trivial hypothesis considered on the kernel transition of the BMC. We illustrate in this example the phase transition observed in the fluctuations.

fluctuations for tree indexed Markov chain60J80[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Bifurcating Markov chains60F05binary treesbifurcating auto-regressive processdensity estimation Mathematics Subject Classification (2020): 60J05
researchProduct