Reversibility and Stochastic Networks
Home > Mathematics and Science Textbooks > Mathematics > Probability and statistics > Reversibility and Stochastic Networks: (Cambridge Mathematical Library)
Reversibility and Stochastic Networks: (Cambridge Mathematical Library)

Reversibility and Stochastic Networks: (Cambridge Mathematical Library)


     0     
5
4
3
2
1



Available


About the Book

This classic in stochastic network modelling broke new ground when it was published in 1979, and it remains a superb introduction to reversibility and its applications. The book concerns behaviour in equilibrium of vector stochastic processes or stochastic networks. When a stochastic network is reversible its analysis is greatly simplified, and the first chapter is devoted to a discussion of the concept of reversibility. The rest of the book focuses on the various applications of reversibility and the extent to which the assumption of reversibility can be relaxed without destroying the associated tractability. Now back in print for a new generation, this book makes enjoyable reading for anyone interested in stochastic processes thanks to the author's clear and easy-to-read style. Elementary probability is the only prerequisite and exercises are interspersed throughout.

Table of Contents:
1. Markov processes and reversibility; 2. Migration processes; 3. Queueing networks; 4. Examples of queueing networks; 5. Electrical analogues; 6. Reversible migration processes; 7. Population genetics models; 8. Clustering processes; 9. Spatial processes; References; Symbol index; Subject index.

About the Author :
F. P. Kelly is Professor of the Mathematics of Systems in the Statistical Laboratory, University of Cambridge.

Review :
'… the exposition is clear and precise without being pedantic … essential (and enjoyable) reading for any operational researcher. But not only for him, because as so often with good mathematics, these methods draw together many diverse applied fields.' J. F. C. Kingman, European Journal of Operational Research 'Its wealth of ideas is so rich and (as in much of Kelly's work) it starts with very elementary ideas which in his hands are built up until suddenly you have something that is very valuable … It is a book that should be on the shelf of anyone working on stochastic networks.' Onna Boxma, EURANDOM and Eindhoven University of Technology 'This superb book displays the power and beauty of combining two simple ideas … Kelly progresses in easy, intelligible steps through an enormous range of models. He weaves general theorems together with concrete applications that lead to explicit formulas … Kelly illuminates his material with the understanding and care of an old jeweller examining a diamond … Topics once presented reappear as new theorems and throughout the book are comments that convey, and reveal on the part of the author, a wonderful insight into how all parts of the book are related. This is the instruction one would hope for in a private tutorial from the author … The notation is always natural, uncluttered, and helpful. A complete symbol index gives one-line reminders of definitions in addition to page references. Part of the reason the mathematics is so clear is that Kelly's pleasant, simple English exploits fully the power of natural language to describe abstract processes.' Joel E. Cohen, Technometrics '… the main points of the book will be readily grasped by anyone with a knowledge of Markov Chains and processes … It is a good buy for anyone interested in network modelling.' Antony Unwin, Journal of the Operational Research Society '… an important and well-written book that should be in the library of every student of stochastic networks … Among the many appealing features of this book, we note the great diversity of the models to which the results may be applied. There are examples and discussions from genetics, chemical kinetics, queues, migration processes, epidemic theory, and others … The author has a lucid style and has obviously been led by the desire to inform the reader. This, indeed, is also the way to be genuinely impressive.' Marcel F. Neuts, Journal of the American Statistical Association '… a fascinating account of reversibility and its generalisations and consequences, mostly for Markov processes … written in an extremely lucid and clear style … an outstanding book and is essential reading for anyone interested in stochastic processes. Dr Kelly is to be congratulated for producing what is bound to become a standard text.' B. W. Silverman, Journal of the Royal Statistical Society: Series A '… a fascinating and original contribution to probability theory … Anyone with a knowledge of probability theory to the level of Feller's volume I and an interest in stochastic processes is strongly encouraged to read this book.' P. M. Lee, Mathematical Gazette '… an interesting contribution, important from a theoretical as well as an applied point of view … A great number of examples is clearly discussed and analyzed, and as such the book is a nice introduction.' J. W. Cohen, Statistical Neerlandica 'Although the mathematics in this book is elementary, the results are useful and sophisticated.' Frank Spitzer, SIAM Review


Best Sellers


Product Details
  • ISBN-13: 9781107401150
  • Publisher: Cambridge University Press
  • Publisher Imprint: Cambridge University Press
  • Height: 229 mm
  • No of Pages: 238
  • Returnable: N
  • Series Title: Cambridge Mathematical Library
  • Weight: 376 gr
  • ISBN-10: 1107401151
  • Publisher Date: 30 Jun 2011
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Returnable: N
  • Spine Width: 11 mm
  • Width: 153 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Reversibility and Stochastic Networks: (Cambridge Mathematical Library)
Cambridge University Press -
Reversibility and Stochastic Networks: (Cambridge Mathematical Library)
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.

Reversibility and Stochastic Networks: (Cambridge Mathematical Library)

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!