Skip to content
Register Sign in Wishlist

Markov Processes, Gaussian Processes, and Local Times

£62.99

Part of Cambridge Studies in Advanced Mathematics

  • Date Published: October 2011
  • availability: Available
  • format: Paperback
  • isbn: 9781107403758

£ 62.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This book was first published in 2006. Written by two of the foremost researchers in the field, this book studies the local times of Markov processes by employing isomorphism theorems that relate them to certain associated Gaussian processes. It builds to this material through self-contained but harmonized 'mini-courses' on the relevant ingredients, which assume only knowledge of measure-theoretic probability. The streamlined selection of topics creates an easy entrance for students and experts in related fields. The book starts by developing the fundamentals of Markov process theory and then of Gaussian process theory, including sample path properties. It then proceeds to more advanced results, bringing the reader to the heart of contemporary research. It presents the remarkable isomorphism theorems of Dynkin and Eisenbaum and then shows how they can be applied to obtain new properties of Markov processes by using well-established techniques in Gaussian process theory. This original, readable book will appeal to both researchers and advanced graduate students.

    • Starts with streamlined 'mini-courses' that give easy entry to important areas in stochastic process theory
    • This was the first time material on the isomorphism appeared in book form
    • Authors are acknowledged experts
    Read more

    Reviews & endorsements

    Review of the hardback: 'This is a masterly written text which should be accessible to advanced graduate students and non-specialists. For the researcher interested in Gaussian processes or local times it will become an indispensable standard resource.' Zentralblatt MATH

    Review of the hardback: 'The authors make every effort to make the material accessible, and the proofs presented are often much easier than the original ones. The material is well organized and well presented.' Journal of the American Statistical Association

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: October 2011
    • format: Paperback
    • isbn: 9781107403758
    • length: 632 pages
    • dimensions: 229 x 152 x 36 mm
    • weight: 0.92kg
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Brownian motion and Ray-Knight theorems
    3. Markov processes and local times
    4. Constructing Markov processes
    5. Basic properties of Gaussian processes
    6. Continuity and boundedness
    7. Moduli of continuity
    8. Isomorphism theorems
    9. Sample path properties of local times
    10. p-Variation
    11. Most visited site
    12. Local times of diffusions
    13. Associated Gaussian processes
    Appendices: A. Kolmogorov's theorem for path continuity
    B. Bessel processes
    C. Analytic sets and the projection theorem
    D. Hille-Yosida theorem
    E. Stone-Weierstrass theorems
    F. Independent random variables
    G. Regularly varying functions
    H. Some useful inequalities
    I. Some linear algebra
    References
    Index.

  • Resources for

    Markov Processes, Gaussian Processes, and Local Times

    Michael B. Marcus, Jay Rosen

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact lecturers@cambridge.org.

  • Authors

    Michael B. Marcus, City University of New York

    Jay Rosen, City University of New York

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×