⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

March 1, 1986Journal of Applied Probability

On aggregated Markov processes

View at Publisher

Ask AI

Bookmark

Share

Abstract

A finite-state Markov process is aggregated into several groups. What can be learned about the underlying process from the aggregated one? We provide some partial answers to this question.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

D. R. Fredkin (1986) studied this question.

synapsesocial.com/papers/6a9332294192a83a0acd59bc https://doi.org/10.1017/s0021900200106412

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Genetic contribution of advantaged ancestors in the biparental Moran model–finite selectionJournal of Applied Probability · Wed,
2Stochastic dominance for linear combinations of infinite-mean risksJournal of Applied Probability · Wed,
3Convergence of complex martingales in supercritical multi-type general branching processes in bold italic upper L Superscript bold italic q L q Lq for 1 less than bold italic q less than or equals 2 1 < q ≤ 2 1 < q ≤ 2Journal of Applied Probability · Thu,
4Usual stochastic order of the third order statistics based on heterogeneous and statistically dependent random variablesJournal of Applied Probability · Thu,
5Convergence rate of the join-the-shortest-queue systemJournal of Applied Probability · Wed,

More from Journal of Applied Probability

Generalized families of fractional stochastic dominanceWed,
The k -window statistic in a random permutationThu,
Statistical guarantees for italic k k k -degree neural networks via scale regularizationWed,
Complete left-tail asymptotic for branching processes with immigrationMon,
An anticipative Markov modulated marketFri,