Mathematics · Markov Chains
मान लीजिए कि S = {1, 2, 3, 4, 5} है। संक्रमण प्रायिकता आव्यूह (transition probability matrix) के साथ अवस्था समष्टि (state space) S पर एक मार्कोव श्रृंखला पर विचार कीजिए: 0000.70.30.30000.70.70.300000.70.300000.70.30 तो निम्नलिखित में से कौन सा हमेशा सत्य है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1श्रृंखला कम से कम दो स्थिर बंटन (stationary distributions) स्वीकार करती है
- 2अवस्था 3 क्षणिक (transient) है
- 3अवस्था 2 पुनरावर्ती (recurrent) है✓
- 4अवस्था 1 का आवर्त (period) 2 है
सही उत्तर देखें
अवस्था 2 पुनरावर्ती (recurrent) है
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Markov Chains MCQs →Want more practice questions on Markov Chains?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Markov Chains