Search results for "Markov"

showing 10 items of 628 documents

Random time-changes and asymptotic results for a class of continuous-time Markov chains on integers with alternating rates

2021

We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state probabilities of the random variables of the process. Moreover we study independent random time-changes with the inverse of the stable subordinator, the stable subordinator and the tempered stable subodinator. We also present some asymptotic results in the fashion of large deviations. These results give some generalizations of those presented in Di Crescenzo A., Macci C., Martinucci B. (2014).

Statistics and ProbabilityPure mathematicsSubordinatormoderate deviationsInversefractional processfractional process; large deviations; moderate deviations; tempered stable subordinatorlarge deviationsChain (algebraic topology)FOS: MathematicsProbability-generating function60F10 60J27 60G22 60G52MathematicsMarkov chainlcsh:T57-57.97lcsh:MathematicsProbability (math.PR)State (functional analysis)tempered stable subordinatorlcsh:QA1-939Modeling and SimulationSettore MAT/06lcsh:Applied mathematics. Quantitative methodsLarge deviations theoryStatistics Probability and UncertaintyRandom variableMathematics - Probability
researchProduct

Bayesian hierarchical models in manufacturing bulk service queues

2006

In this paper, Queueing Theory and Bayesian statistical tools are used to analyze the congestion of various manufacturing bulk service queues with the same characteristics that are working independently of one another and in equilibrium. Hierarchical models are discussed in order to develop the whole inferential process for the parameters governing the system. Markov Chain Monte Carlo methods and numerical inversion of transforms are addressed to compute the posterior predictive distributions of the usual measures of performance in practice.

Statistics and ProbabilityQueueing theoryMathematical optimizationApplied MathematicsBayesian probabilityPosterior probabilityInversion (meteorology)Markov chain Monte CarloHierarchical database modelsymbols.namesakesymbolsEconometricsStatistics Probability and UncertaintyQueueMcmc algorithmMathematicsJournal of Statistical Planning and Inference
researchProduct

A Bayesian analysis of a queueing system with unlimited service

1997

Abstract A queueing system occurs when “customers” arrive at some facility requiring a certain type of “service” provided by the “servers”. Both the arrival pattern and the service requirements are usually taken to be random. If all the servers are busy when customers arrive, they usually wait in line to get served. Queues possess a number of mathematical challenges and have been mainly approached from a probability point of view, and statistical analysis are very scarce. In this paper we present a Bayesian analysis of a Markovian queue in which customers are immediately served upon arrival, and hence no waiting lines form. Emergency and self-service facilities provide many examples. Techni…

Statistics and ProbabilityService (business)Operations researchApplied MathematicsBayesian probabilityMarkov processFork–join queuesymbols.namesakeMean value analysisServerStatisticsLayered queueing networksymbolsStatistics Probability and UncertaintyQueueMathematicsJournal of Statistical Planning and Inference
researchProduct

Non-Markovianity and Coherence of a Moving Qubit inside a Leaky Cavity

2017

Non-Markovian features of a system evolution, stemming from memory effects, may be utilized to transfer, storage, and revive basic quantum properties of the system states. It is well known that an atom qubit undergoes non-Markovian dynamics in high quality cavities. We here consider the qubit-cavity interaction in the case when the qubit is in motion inside a leaky cavity. We show that, owing to the inhibition of the decay rate, the coherence of the traveling qubit remains closer to its initial value as time goes by compared to that of a qubit at rest. We also demonstrate that quantum coherence is preserved more efficiently for larger qubit velocities. This is true independently of the evol…

Statistics and ProbabilitySettore FIS/02 - Fisica Teorica Modelli E Metodi MatematiciFOS: Physical sciencesMarkov processNon-Markovianity01 natural sciencesSettore FIS/03 - Fisica Della Materia010305 fluids & plasmassymbols.namesakeComputer Science::Emerging TechnologiesQuantum mechanics0103 physical sciencesInitial value problem010306 general physicsQuantumMathematical PhysicsPhysicsQuantum PhysicsMoving atom qubitStatistical and Nonlinear PhysicsQuantum PhysicsCavity quantum electrodynamicQuantum coherenceQubitOpen quantum systemsymbolsQuantum Physics (quant-ph)Coherence (physics)
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

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

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

bssm: Bayesian Inference of Non-linear and Non-Gaussian State Space Models in R

2021

We present an R package bssm for Bayesian non-linear/non-Gaussian state space modelling. Unlike the existing packages, bssm allows for easy-to-use approximate inference based on Gaussian approximations such as the Laplace approximation and the extended Kalman filter. The package accommodates also discretely observed latent diffusion processes. The inference is based on fully automatic, adaptive Markov chain Monte Carlo (MCMC) on the hyperparameters, with optional importance sampling post-correction to eliminate any approximation bias. The package implements also a direct pseudo-marginal MCMC and a delayed acceptance pseudo-marginal MCMC using intermediate approximations. The package offers …

Statistics and ProbabilitymallintaminenFOS: Computer and information sciencesNumerical AnalysisMonte Carlo -menetelmätmatematiikkabayesilainen menetelmäMarkovin ketjuttila-avaruusmallitStatistics Probability and Uncertaintymatemaattiset mallitStatistics - ComputationComputation (stat.CO)
researchProduct