Home > Mathematics and Science Textbooks > Mathematics > Probability and statistics > Homogeneous Denumerable Markov Processes
Homogeneous Denumerable Markov Processes

Homogeneous Denumerable Markov Processes

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

Markov processes play an important role in the study of probability theory. Homogeneous denumerable Markov processes are among the main topics in the theory and have a wide range of application in various fields of science and technology (for example, in physics, cybernetics, queuing theory and dynamical programming). This book is a detailed presentation and summary of the research results obtained by the authors in recent years. Most of the results are published for the first time. Two new methods are given: one is the minimal nonnegative solution, the second the limit transition method. With the help of these two methods, the authors solve many important problems in the framework of denumerable Markov processes.

Table of Contents:
I Construction Theory of Sample Functions of Homogeneous Denumerable Markov Processes.- I The First Construction Theorem.- 1.1 Introduction.- 1.2 Definition of transformation gn.- 1.3 Convergence of the sequence X(n)(?) (n?1).- 1.4 Further properties of X(n)(?) (n?1).- 1.5 The first construction theorem.- II The Second Construction Theorem.- 2.1 Introduction.- 2.2 The mapping Tmn.- 2.3 The mapping Wn.- 2.4 Constructing auxiliary functions.- 2.5 The second construction theorem.- 2.6 Summary.- 2.7 Two notes.- II Theory of Minimal Nonnegative Solutions for Systems of Nonnegative Linear Equations.- III General Theory.- 3.1 Introduction.- 3.2 Definition of a system of nonnegative linear equations and definition, existence and uniqueness of its minimal nonnegative solution.- 3.3 Comparison theorem and linear combination theorem.- 3.4 Localization theorem.- 3.5 Connecting property of the minimal nonnegative solution.- 3.6 Limit theorem.- 3.7 Matrix representation.- 3.8 Dual theorem.- IV Calculation.- 4.1 Some lemmas.- 4.2 Reduction of the problems.- 4.3 Ordinary systems of strictly nonhomogeneous equations with dimension n.- V Systems of 1-Bounded Equations.- 5.1 Introduction.- 5.2 First-type leading-outside systems of equations.- 5.3 First-type consistent systems of equations.- 5.4 Tailed random systems of strictly nonhomogeneous equations.- 5.5 Regular systems of equations.- 5.6 Pseudo-normal systems of equations.- 5.7 Pseudo-normal systems of equations of finite dimension.- 5.8 Second-type regular systems of equations.- III Homogeneous Denumerable Markov Chains.- VI General Theory.- 6.1 Introduction.- 6.2 Transition probabilities.- 6.3 Distribution and moments of the first passage time.- 6.4 Distribution and moments of the first passage time of a homogeneous finite Markov chain.- 6.5 Distribution and moments of the times of passage.- 6.6 Criteria for recurrence.- 6.7 Distribution and moments of additive functionals.- 6.8 Derived Markov chains and criteria for atomic almost closed sets.- VII Martin Exit Boundary Theory.- 7.1 Introduction.- 7.2 Decomposition for Markov chains.- 7.3 Limit behaviour of excessive functions.- 7.4 Green functions and Martin kernels.- 7.5 h-chains.- 7.6 Limit theorem for Martin kernels.- 7.7 Martin boundaries.- 7.8 Distribution of x?.- 7.9 Martin expressions of excessive functions.- 7.10 Exit space.- 7.11 Uniqueness theorem.- 7.12 Minimal excessive functions.- 7.13 Terminal random variables.- 7.14 Criteria for potentials and excessive functions, Riesz decomposition.- 7.15 Criteria for minimal harmonic functions, minimal potentials and minimal excessive functions.- 7.16 Atomic exit spaces and nonatomic exit spaces.- 7.17 Blackwell decomposition of the state space.- VIII Martin Entrance Boundary Theory.- 8.1 Introduction.- 8.2 The first group of lemmas.- 8.3 Properties of finite excessive measures.- 8.4 The second group of lemmas.- 8.5 Entrance boundary.- 8.6 Entrance space and the expressions of excessive measures.- IV Homogeneous Denumerable Markov Processes.- IX Minimal Q-Processes.- 9.1 Introduction.- 9.2 Transition probabilities.- 9.3 Distribution and moments of the first passage time.- 9.4 Criterion for the positive recurrence.- 9.5 Distribution and moments of integral-type functionals.- 9.6 Distribution and moments of integral-type functionals on pseudo-translatable sets.- 9.7 Extensions of the results in 9.3.- X Q-Processes of Order One.- 10.1 Introduction.- 10.2 Transition probabilities.- 10.3 Distribution and moments of the first passage time.- XI Arbitrary Q-Processes.- 11.1 Strengthening of the first construction theorem.- 11.2 Transition probability.- 11.3 Decomposition theorems for excessive measures and excessive functions.- V Construction Theory of Homogeneous Denumerable Markov Processes.- XII Criteria for the Uniqueness of Q-Processes.- 12.1 Introduction.- 12.2 Lemmas.- 12.3 Proof of the main theorem.- 12.4 The case of diagonal type.- 12.5 The bounded case.- 12.6 The case when E is finite.- 12.7 The case of a branch Q-matrix.- 12.8 Another criterion and the finite and nonconservative case.- 12.9 Independence of the two conditions in Theorem 12.1.1.- 12.10 Probability interpretation of Condition (i) in Theorem 12.1.1.- XIII Construction of Q-Processes.- 13.1 Construction theorem.- 13.2 Specifications of all the Q-processes.- 13.3 Expression of $$\left\{ {Q,\,{\Pi _{{{\left( {\partial X} \right)}_{e,}}\,x\,E}}} \right\}$$-processes.- 13.4 Discussion.- XIV Qualitative Theory.- 14.1 Introduction.- 14.2 Statement of results.- 14.3 Reduction of the construction problem of B-type Q-processes, Doob processes.- 14.4 Reduction of the construction problem of B?F-type Q-processes.- 14.5 Proofs of Theorems 14.2.1-14.2.3.- 14.6 Proof and examples of applications of Theorem 14.2.4.- 14.7 Proofs of Theorems 14.2.5-14.2.10.


Best Sellers


Product Details
  • ISBN-13: 9783540108177
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Language: English
  • Returnable: N
  • Weight: 655 gr
  • ISBN-10: 3540108173
  • Publisher Date: 26 Aug 1988
  • Binding: Hardback
  • No of Pages: 281
  • Series Title: English


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Homogeneous Denumerable Markov Processes
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Homogeneous Denumerable Markov Processes
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Homogeneous Denumerable Markov Processes

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA