Search results for "102"

showing 10 items of 2892 documents

The MLE of the mean of the exponential distribution based on grouped data is stochastically increasing

2016

Abstract This paper refers to the problem stated by Balakrishnan et al. (2002). They proved that maximum likelihood estimator (MLE) of the exponential mean obtained from grouped samples is stochastically ordered provided that the sequence of the successive distances between inspection times is decreasing. In this paper we show that the assumption of monotonicity of the sequence of distances can be dropped.

Statistics and ProbabilitySequenceExponential distributionMaximum likelihood010102 general mathematicsFixed-point theoremMonotonic function01 natural sciencesExponential functionGrouped data010104 statistics & probabilityStatisticsApplied mathematics0101 mathematicsStatistics Probability and UncertaintyMathematicsStatistics & Probability Letters
researchProduct

A note on Malliavin smoothness on the Lévy space

2017

We consider Malliavin calculus based on the Itô chaos decomposition of square integrable random variables on the Lévy space. We show that when a random variable satisfies a certain measurability condition, its differentiability and fractional differentiability can be determined by weighted Lebesgue spaces. The measurability condition is satisfied for all random variables if the underlying Lévy process is a compound Poisson process on a finite time interval. peerReviewed

Statistics and ProbabilitySmoothness (probability theory)matematiikkaLévy processMalliavin calculus010102 general mathematicsMalliavin calculus01 natural sciencesLévy processinterpolation010104 statistics & probability60H07Mathematics::ProbabilitySquare-integrable functionCompound Poisson processApplied mathematicsinterpolointiDifferentiable functiontila0101 mathematicsStatistics Probability and UncertaintyLp spaceRandom variable60G51MathematicsElectronic Communications in Probability
researchProduct

On the stability and ergodicity of adaptive scaling Metropolis algorithms

2011

The stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. The both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one incorporates also covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.

Statistics and ProbabilityStochastic approximationMathematics - Statistics TheoryStatistics Theory (math.ST)Law of large numbersMultiple-try Metropolis01 natural sciencesStability (probability)010104 statistics & probabilityModelling and Simulation65C40 60J27 93E15 93E35Adaptive Markov chain Monte CarloFOS: Mathematics0101 mathematicsScalingMetropolis algorithmMathematicsta112Applied Mathematics010102 general mathematicsRejection samplingErgodicityProbability (math.PR)ta111CovarianceRandom walkMetropolis–Hastings algorithmModeling and SimulationAlgorithmStabilityMathematics - ProbabilityStochastic Processes and their Applications
researchProduct

Quantitative ergodicity for some switched dynamical systems

2012

International audience; We provide quantitative bounds for the long time behavior of a class of Piecewise Deterministic Markov Processes with state space Rd × E where E is a finite set. The continuous component evolves according to a smooth vector field that switches at the jump times of the discrete coordinate. The jump rates may depend on the whole position of the process. Under regularity assumptions on the jump rates and stability conditions for the vector fields we provide explicit exponential upper bounds for the convergence to equilibrium in terms of Wasserstein distances. As an example, we obtain convergence results for a stochastic version of the Morris-Lecar model of neurobiology.

Statistics and ProbabilitySwitched dynamical systemsDynamical systems theoryMarkov process01 natural sciences34D2393E15010104 statistics & probabilitysymbols.namesakeCouplingPiecewise Deterministic Markov ProcessPosition (vector)60J25FOS: MathematicsState spaceApplied mathematicsWasserstein distance0101 mathematicsMathematicsProbability (math.PR)010102 general mathematicsErgodicityErgodicity[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Linear Differential EquationsPiecewisesymbolsJumpAMS-MSC. 60J75; 60J25; 93E15; 34D23Vector fieldStatistics Probability and Uncertainty60J75[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - Probability
researchProduct

Stochastic ordering of classical discrete distributions

2010

For several pairs $(P,Q)$ of classical distributions on $\N_0$, we show that their stochastic ordering $P\leq_{st} Q$ can be characterized by their extreme tail ordering equivalent to $ P(\{k_\ast \})/Q(\{k_\ast\}) \le 1 \le \lim_{k\to k^\ast} P(\{k\})/Q(\{k\})$, with $k_\ast$ and $k^\ast$ denoting the minimum and the supremum of the support of $P+Q$, and with the limit to be read as $P(\{k^\ast\})/Q(\{k^\ast\})$ for $k^\ast$ finite. This includes in particular all pairs where $P$ and $Q$ are both binomial ($b_{n_1,p_1} \leq_{st} b_{n_2,p_2}$ if and only if $n_1\le n_2$ and $(1-p_1)^{n_1}\ge(1-p_2)^{n_2}$, or $p_1=0$), both negative binomial ($b^-_{r_1,p_1}\leq_{st} b^-_{r_2,p_2}$ if and on…

Statistics and ProbabilityWaiting timeApplied MathematicsProbability (math.PR)010102 general mathematicsCoupling (probability)Poisson distribution01 natural sciencesStochastic orderingInfimum and supremumHypergeometric distributionCombinatorics010104 statistics & probabilitysymbols.namesakeFOS: MathematicsMonotone likelihood ratiosymbolsLimit (mathematics)60E150101 mathematicsMathematics - ProbabilityMathematicsAdvances in Applied Probability
researchProduct

An extended continuous mapping theorem for outer almost sure weak convergence

2019

International audience; We prove an extended continuous mapping theorem for outer almost sure weak convergence in a metric space, a notion that is used in bootstrap empirical processes theory. Then we make use of those results to establish the consistency of several bootstrap procedures in empirical likelihood theory for functional parameters.

Statistics and ProbabilityWeak convergence010102 general mathematicsContinuous mapping theorem16. Peace & justiceEmpirical measure01 natural sciences010104 statistics & probabilityMetric spaceEmpirical likelihoodConsistency (statistics)[MATH.MATH-ST]Mathematics [math]/Statistics [math.ST]Applied mathematicsStatistics::Methodology0101 mathematicsStatistics Probability and UncertaintyMathematics
researchProduct

Simulation of BSDEs with jumps by Wiener Chaos Expansion

2016

International audience; We present an algorithm to solve BSDEs with jumps based on Wiener Chaos Expansion and Picard's iterations. This paper extends the results given in Briand-Labart (2014) to the case of BSDEs with jumps. We get a forward scheme where the conditional expectations are easily computed thanks to chaos decomposition formulas. Concerning the error, we derive explicit bounds with respect to the number of chaos, the discretization time step and the number of Monte Carlo simulations. We also present numerical experiments. We obtain very encouraging results in terms of speed and accuracy.

Statistics and ProbabilityWiener Chaos expansionDiscretizationMonte Carlo methodTime stepConditional expectation01 natural sciences010104 statistics & probabilitybackward stochastic differential equations with jumpsFOS: MathematicsApplied mathematics60H10 60J75 60H35 65C05 65G99 60H070101 mathematicsMathematicsPolynomial chaosApplied MathematicsNumerical analysis010102 general mathematicsMathematical analysista111Probability (math.PR)numerical methodCHAOS (operating system)[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Modeling and SimulationScheme (mathematics)Mathematics - Probability
researchProduct

On delocalization of eigenvectors of random non-Hermitian matrices

2019

We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let $A$ be an $n\times n$ random matrix with i.i.d real subgaussian entries of zero mean and unit variance. We show that with probability at least $1-e^{-\log^{2} n}$ $$ \min\limits_{I\subset[n],\,|I|= m}\|{\bf v}_I\| \geq \frac{m^{3/2}}{n^{3/2}\log^Cn}\|{\bf v}\| $$ for any real eigenvector ${\bf v}$ and any $m\in[\log^C n,n]$, where ${\bf v}_I$ denotes the restriction of ${\bf v}$ to $I$. Further, when the entries of $A$ are complex, with i.i.d real and imaginary parts, we show that with probability at least $1-e^{-\log^{2} n}$ all eigenvectors of $A$ are delocalized in the sense that $$ \min\l…

Statistics and ProbabilityZero mean010102 general mathematicsNull (mathematics)Probability (math.PR)01 natural sciencesHermitian matrixCombinatorics010104 statistics & probabilityDelocalized electronFOS: Mathematics0101 mathematicsStatistics Probability and UncertaintyRandom matrixUnit (ring theory)Mathematics - ProbabilityAnalysisEigenvalues and eigenvectorsMathematicsProbability Theory and Related Fields
researchProduct

Donsker-Type Theorem for BSDEs: Rate of Convergence

2019

In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, Delyon and Mémin (Electron. Commun. Probab. 6 (2001) Art. ID 1). This is related to the approximation of solutions to semilinear second order parabolic PDEs by solutions to their associated finite difference schemes and the speed of convergence. peerReviewed

Statistics and Probability[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Markov processType (model theory)scaled random walk01 natural sciencesconvergence rate010104 statistics & probabilitysymbols.namesakeMathematics::ProbabilityConvergence (routing)FOS: MathematicsOrder (group theory)Applied mathematicsWasserstein distance0101 mathematicsDonsker's theoremstokastiset prosessitMathematicskonvergenssiProbability (math.PR)010102 general mathematicsFinite differenceRandom walk[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Rate of convergencebackward stochastic differential equationssymbolsapproksimointiDonsker’s theoremfinite difference schemedifferentiaaliyhtä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