• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Transforming stochastic matrices for stochastic comparison with the st-order

      Thumbnail
      View / Download
      230.6 Kb
      Author
      Dayar T.
      Fourneau, J. M.
      Pekergin, N.
      Date
      2003
      Source Title
      RAIRO - Operations Research
      Print ISSN
      0399-0559
       
      1290-3868
       
      Publisher
      E D P Sciences
      Volume
      37
      Issue
      2
      Pages
      85 - 97
      Language
      English
      Type
      Article
      Item Usage Stats
      58
      views
      55
      downloads
      Metadata
      Show full item record
      Abstract
      We present a transformation for stochastic matrices and analyze the effects of using it in stochastic comparison with the strong stochastic (st) order. We show that unless the given stochastic matrix is row diagonally dominant, the transformed matrix provides better st bounds on the steady state probability distribution. © EDP Sciences 2003.
      Keywords
      Markov Processes
      Probability Distributions
      St-order
      Stochastic Ordering
      Branch and Bound Method
      Mathematical Transformations
      Matrix Algebra
      Probability Distributions
      Stochastic (st) Order
      Stochastic Ordering
      Transformed Matrix
      Markov Processes
      Permalink
      http://hdl.handle.net/11693/24367
      Published Version (Please cite this version)
      http://dx.doi.org/10.1051/ro:2003015
      Collections
      • Department of Computer Engineering 1308

      Related items

      Showing items related by title, author, creator and subject.

      • Thumbnail

        Conditional steady-state bounds for a subset of states in Markov chains 

        Dayar, Tuğrul; Pekergin, N.; Younès, S. (ACM, 2006-10)
        The problem of computing bounds on the conditional steady-state probability vector of a subset of states in finite, ergodic discrete-time Markov chains (DTMCs) is considered. An improved algorithm utilizing the strong ...
      • Thumbnail

        Stochastic lot sizing problem with controllable processing times 

        Koca, E.; Yaman, H.; Aktürk, M. S. (Elsevier, 2015)
        In this study, we consider the stochastic capacitated lot sizing problem with controllable processing times where processing times can be reduced in return for extra compression cost. We assume that the compression cost ...
      • Thumbnail

        Comments on 'a Representation for the Symbol Error Rate Using Completely Monotone Functions' 

        Dulek, B. (Institute of Electrical and Electronics Engineers Inc., 2014)
        It was shown in the above-titled paper by Rajan and Tepedelenlioglu (see ibid., vol. 59, no. 6, p. 3922-31, June 2013) that the symbol error rate (SER) of an arbitrary multidimensional constellation subject to additive ...

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University | Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin