Search results for " Markov chain"

showing 10 items of 52 documents

Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *

2013

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Variable length Markov chainProbability (math.PR)Semi Markov processesIntegrated telegraph noise[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Mathematics::ProbabilitySimple and double infinite combs.Variable memoryFOS: Mathematics[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityPersistent random walkSimple and double infinite combsPiecewise Deterministic Markov Processes
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

All-sky search in early O3 LIGO data for continuous gravitational-wave signals from unknown neutron stars in binary systems

2021

Rapidly spinning neutron stars are promising sources of continuous gravitational waves. Detecting such a signal would allow probing of the physical properties of matter under extreme conditions. A significant fraction of the known pulsar population belongs to binary systems. Searching for unknown neutron stars in binary systems requires specialized algorithms to address unknown orbital frequency modulations. We present a search for continuous gravitational waves emitted by neutron stars in binary systems in early data from the third observing run of the Advanced LIGO and Advanced Virgo detectors using the semicoherent, GPU-accelerated, binaryskyhough pipeline. The search analyzes the most s…

binary: orbitneutron star: binaryPhysics and Astronomy (miscellaneous)Astronomybinary [neutron star]AstrophysicsGravitational Waves; LIGO (Observatory); Neutron Stars01 natural sciencesneutron starsGeneral Relativity and Quantum CosmologyMonte Carlo: Markov chainPhysics Particles & Fieldsbinary starsbinary systemsBinary SystemsLIGOgravitational waveQCQBpulsarastro-ph.HEHigh Energy Astrophysical Phenomena (astro-ph.HE)Physicseducation.field_of_studySettore FIS/03Physicsorbit [binary]General relativityPhysical Sciences[PHYS.GRQC]Physics [physics]/General Relativity and Quantum Cosmology [gr-qc]Astrophysics - High Energy Astrophysical Phenomenabinary stardata analysis methodsensitivity [detector]General relativitygr-qcfrequency [modulation]Populationneutron star: spinFOS: Physical sciencesalternative theories of gravityMarkov chain [Monte Carlo]General Relativity and Quantum Cosmology (gr-qc)Astronomy & AstrophysicsGravitational Waves Neutron Stars Binary Systems LIGO VirgoLIGO (Observatory)emission [gravitational radiation]Pulsarbinary: coalescence0103 physical sciencesBinary starddc:530spin [neutron star]background [gravitational radiation]010306 general physicseducationSTFCOrbital elementsGravitational WavesScience & Technology010308 nuclear & particles physicsGravitational waveVirgogravitational radiation: backgroundmodulation: frequencyRCUKNeutron StarsLIGOgravitational radiation detectordetector: sensitivityNeutron starVIRGOgravitational radiation: emissionDewey Decimal Classification::500 | Naturwissenschaften::530 | Physikcoalescence [binary][PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph]binary stars; neutron stars
researchProduct

Analysis on channel bonding/aggregation for multi-channel cognitive radio networks

2010

Channel bonding/aggregation techniques, which assemble several channels together as one channel, could be used in cognitive radio networks for the purpose of achieving better bandwidth utilization. In existing work on this topic, channel bonding/aggregation is focused on the cases when primary channels are time slotted or stationary as compared with secondary users' activities. In this paper, we analyze the performance of channel bonding/aggregation strategies when primary channels are not time slotted and the time scale of primary activities is at the same level as the secondary users', given that spectrum handover is not allowed. Continuous time Markov chain models are built in order to a…

business.industryComputer scienceMarkov processChannel bondingBlocking (statistics)Continuous-time Markov chainChannel capacitysymbols.namesakeCognitive radioHandoversymbolsbusinessComputer networkCommunication channel2010 European Wireless Conference (EW)
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

Multi-phase epidemic model and its numerical simulation

2008

epidemic model Markov chainSettore MAT/05 - Analisi Matematica
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

Dynamics in stochastic evolutionary models

2014

First published: 01 February 2016 We characterize transitions between stochastically stable states and relative ergodic probabilities in the theory of the evolution of conventions. We give an application to the fall of hegemonies in the evolutionary theory of institutions and conflict, and illustrate the theory with the fall of the Qing dynasty and the rise of communism in China. We are especially indebted to Juan Block for his many comments and suggestions. We would also like to thank Drew Fudenberg, Kevin Hasker, Matt Jackson, Peyton Young, and five anonymous referees. We are grateful to NSF Grant SES-08-51315 and to the MIUR PRIN 20103S5RN3 for financial support.

markov chainsEvolutionMarkov chainjel:C73conventionsEvolution conventionsmarkov chainsstate powerEconomics Econometrics and Finance (all)2001 Economics Econometrics and Finance (miscellaneous)C73state powerPracticesconventionddc:330Equilibrium SelectionLawPragmatismconventions; Evolution; Markov chains; state power; Economics Econometrics and Finance (all)2001 Economics Econometrics and Finance (miscellaneous)Theoretical Economics
researchProduct