Stability of Skorokhod problem is undecidable

Details Stability of Skorokhod problem is undecidable Stability of Skorokhod problem is undecidable

2010-07-10

arxiv.org/abs/1007.1694v1

Mathematics

Probability

Scientific paper

Skorokhod problem arises in studying Reflected Brownian Motion (RBM) on an non-negative orthant, specifically in the context of queueing networks in the heavy traffic regime. One of the key problems is identifying conditions for stability of a Skorokhod problem, defined as the property that trajectories are attracted to the origin. The stability conditions are known in dimension up to three, but not for general dimensions. In this paper we explain the fundamental difficulties encountered in trying to establish stability conditions for general dimensions. We prove that stability of Skorokhod problem is an undecidable property when the starting state is a part of the input. Namely, there does not exist an algorithm (a constructive procedure) for identifying stable Skorokhod problem in general dimensions.

Affiliated with

Also associated with

No associations

Rating

Stability of Skorokhod problem is undecidable does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stability of Skorokhod problem is undecidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of Skorokhod problem is undecidable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-300228