On the Number of F-Recurrent Runs and Tuples in a Finite Markov Chain

Prikladnaya diskretnaya matematika. Prilozhenie
doi 10.17223/2226308x/12/4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Tomsk State University

Related search

On the Number of Event Appearances in a Markov Chain

International Journal of Applied Mathematics
Computational TheoryMathematics
2019English

Poisson Approximation for the Number of Non-Decreasing Runs in Markov Chains

Математические вопросы криптографии
2018English

The Convergence of Sums of Transition Probabilities of a Positive Recurrent Markov Chain.

Mathematica Scandinavica
Mathematics
1981English

Conjectures and Results on the Size and Number of Diophantine Tuples

AIP Conference Proceedings
AstronomyPhysics
2008English

Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2008English

On the Number of $F$-Matchings in a Tree

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

On the Geometric Growth in a Class of Homogeneous Multitype Markov Chain

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2005English

The Markov Chain Market

ASTIN Bulletin
AccountingEconomicsEconometricsFinance
2003English

Case for First Courses on Finite Markov Chain Modeling to Include Sojourn Time Cycle Chart

SIAM Review
Computational MathematicsApplied MathematicsTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy