Search results for "Mathematics Subject Classification"

showing 10 items of 30 documents

Mean square rate of convergence for random walk approximation of forward-backward SDEs

2020

AbstractLet (Y,Z) denote the solution to a forward-backward stochastic differential equation (FBSDE). If one constructs a random walk$B^n$from the underlying Brownian motionBby Skorokhod embedding, one can show$L_2$-convergence of the corresponding solutions$(Y^n,Z^n)$to$(Y, Z).$We estimate the rate of convergence based on smoothness properties, especially for a terminal condition function in$C^{2,\alpha}$. The proof relies on an approximative representation of$Z^n$and uses the concept of discretized Malliavin calculus. Moreover, we use growth and smoothness properties of the partial differential equation associated to the FBSDE, as well as of the finite difference equations associated to t…

Statistics and ProbabilityDiscretizationapproximation schemeMalliavin calculus01 natural sciences010104 statistics & probabilityconvergence rateMathematics::ProbabilityConvergence (routing)random walk approximation 2010 Mathematics Subject Classification: Primary 60H10FOS: MathematicsApplied mathematics0101 mathematicsBrownian motionrandom walk approximationMathematicsstokastiset prosessitSmoothness (probability theory)konvergenssiApplied Mathematics010102 general mathematicsProbability (math.PR)Backward stochastic differential equationsFunction (mathematics)Random walkfinite difference equation[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Rate of convergencebackward stochastic differential equations60G50 Secondary 60H3060H35approksimointidifferentiaaliyhtälötMathematics - Probability
researchProduct

A PHASE TRANSITION FOR LARGE VALUES OF BIFURCATING AUTOREGRESSIVE MODELS

2019

We describe the asymptotic behavior of the number $$Z_n[a_n,\infty )$$ of individuals with a large value in a stable bifurcating autoregressive process, where $$a_n\rightarrow \infty $$ . The study of the associated first moment is equivalent to the annealed large deviation problem of an autoregressive process in a random environment. The trajectorial behavior of $$Z_n[a_n,\infty )$$ is obtained by the study of the ancestral paths corresponding to the large deviation event together with the environment of the process. This study of large deviations of autoregressive processes in random environment is of independent interest and achieved first. The estimates for bifurcating autoregressive pr…

Statistics and Probability[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Phase transitionrandom environmentGeneral Mathematicsmedia_common.quotation_subjectmoderate deviationslimit-theoremsmarkov-chainsStatistics::Other StatisticsBranching processdeviation inequalities92D2501 natural sciencesAsymmetry010104 statistics & probability[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]Convergence (routing)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Applied mathematics60C05[MATH]Mathematics [math]0101 mathematicsautoregressive process60J20lawMathematicsBranching processmedia_commonEvent (probability theory)parametersconvergenceMarkov chain010102 general mathematics[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Large deviationslarge deviations Mathematics Subject Classification (2010): 60J8060K37Autoregressive modelcellsLarge deviations theoryStatistics Probability and Uncertaintyasymmetry60F10
researchProduct

MODERATE DEVIATION PRINCIPLES FOR BIFURCATING MARKOV CHAINS: CASE OF FUNCTIONS DEPENDENT OF ONE VARIABLE

2021

The main purpose of this article is to establish moderate deviation principles for additive functionals of bifurcating Markov chains. Bifurcating Markov chains are a class of processes which are indexed by a regular binary tree. They can be seen as the models which represent the evolution of a trait along a population where each individual has two offsprings. Unlike the previous results of Bitseki, Djellout \& Guillin (2014), we consider here the case of functions which depend only on one variable. So, mainly inspired by the recent works of Bitseki \& Delmas (2020) about the central limit theorem for general additive functionals of bifurcating Markov chains, we give here a moderate deviatio…

Statistics and Probability[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]60J80Bifurcating Markov chainsbinary trees[MATH]Mathematics [math]binary trees Mathematics Subject Classification (2020): 60F10deviation inequalitiesMathematics - Probabilitymoderate deviation principles
researchProduct

OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS

2010

The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…

[ INFO.INFO-NA ] Computer Science [cs]/Numerical Analysis [cs.NA]Linear programmingPolytopeBernstein polynomials01 natural sciencesSimplex algorithmApplied mathematicssimplex algorithm0101 mathematicsMathematicsDiscrete mathematicsBasis (linear algebra)Applied Mathematics010102 general mathematicssubdivision solverlinear programmingalgebraic systemsQuadratic function[INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA]Solver1991 Mathematics Subject Classification: 14Q15 14Q20 65G40Bernstein polynomialComputer Science Applications010101 applied mathematicsModeling and SimulationStandard basisGeometry and TopologyComputer Vision and Pattern RecognitionSoftwareInternational Journal of Shape Modeling
researchProduct

MODERATE DEVIATION PRINCIPLES FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS

2021

Bitseki and Delmas (2021) have studied recently the central limit theorem for kernel estimator of invariant density in bifurcating Markov chains models. We complete their work by proving a moderate deviation principle for this estimator. Unlike the work of Bitseki and Gorgui (2021), it is interesting to see that the distinction of the two regimes disappears and that we are able to get moderate deviation principle for large values of the ergodic rate. It is also interesting and surprising to see that for moderate deviation principle, the ergodic rate begins to have an impact on the choice of the bandwidth for values smaller than in the context of central limit theorem studied by Bitseki and …

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]60J80[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Bifurcating Markov chains[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]binary trees[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 62G0560F10
researchProduct

CENTRAL LIMIT THEOREM FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS

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. Motivated by the functional estimation of the density of the invariant probability measure which appears as the asymptotic distribution of the trait, we prove the consistence and the Gaussian fluctuations for a kernel estimator of this density based on late generations. In this setting, it is interesting to note that the distinction of the three regimes on the ergodic rate identified in a previous work (for fluctuations of average over large generations) disappears. This result is a first step to go beyond the thresh…

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

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

$MC$-hypercentral groups

2007

This paper is devoted to the imposition of some chain conditions on groups having a generalized central series. It is also given a characterization of MC-groups with finite abelian section rank: such class of groups is a suitable enlargement of the class of FC-groups. Mathematics Subject Classification: 20F24; 20F14

chains of normal subgroupsClass (set theory)Rank (linear algebra)$CC$-hypercentral groupRank of an abelian group$PC$-hypercentral groupAlgebraSettore MAT/02 - AlgebraSection (category theory)Mathematics Subject ClassificationCA-groupSettore MAT/03 - GeometriaAbelian groupupper central serieZ-groupMathematics
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

SOME EXAMPLES RELATED TO A CLASS OF FUNCTIONALS WITHOUT GLOBAL MINIMA

2012

Abstract: In this paper, we provide six examples which show the sharpness of the assumptions of a recent deep result of Ricceri about a class of functionals without global minima.

non-existence theorem. 2010 Mathematics Subject Classification: 49J27Settore MAT/05 - Analisi MatematicaKey words: global minimumintegral functional
researchProduct