Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×

Online ordering will be unavailable from 17:00 GMT on Friday, April 25 until 17:00 GMT on Sunday, April 27 due to maintenance. We apologise for the inconvenience.

  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • Critical Path Statistics of Max-Plus Linear Systems with Gaussian Noise

  • Part of
  • James Hook
  • Journal:
    Journal of Applied Probability / Volume 50 / Issue 3 / September 2013
    Published online by Cambridge University Press:
    30 January 2018, pp. 654-670
    Print publication:
    September 2013
    • Article
      • You have access
    • PDF
    • Export citation

  • The critical paths of a max-plus linear system with noise are random variables. In this paper we introduce the edge criticalities which measure how often the critical paths traverse each edge in the precedence graph. We also present the parallel path approximation, a novel method for approximating these new statistics as well as the previously studied max-plus exponent. We show that, for low amplitude noise, the critical paths spend most of their time traversing the deterministic maximally weighted cycle and that, as the noise amplitude is increased, the critical paths become more random and their distribution over the edges in the precedence graph approaches a highly uniform measure of maximal entropy.