A Geometrical Characterization of Multidimensional Hausdorff Polytopes with Applications to Exit Time Problems

نویسندگان

  • Kurt Helmes
  • Stefan Röhl
چکیده

We present a formula for the corner points of the multi-dimensional Hausdorff polytopes and show how this result can be used to improve linear programming models for computing, e. g., moments of exit time distributions of diffusion processes. Specifically, we compute the mean exit time of two-dimensional Brownian motion from the unit square, as well as higher moments of the exit time of time-space Brownian motion, i.e. the two-dimensional process composed of a one-dimensional Wiener process and the time component, from a rectangle. The corner point formula is complemented by a convergence result which provides the analytical underpinning of the numerical method which we use.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometrical properties of polyconvex polytopes

Motivated by existence and semicontinuity problems in multidimensional calculus of variations, a number of generalized convexity notions for functions has been introduced since the 50s of the last century. In its hierarchical order, the most important of these notions are polyconvexity, quasiconvexity and rank-one convexity. 01) However, the necessity to employ these semiconvexity notions as we...

متن کامل

Locality of Corner Transformation for Multidimensional Spatial Access Methods

The geometric structural complexity of spatial objects does not render an intuitive distance metric on the data space that measures spatial proximity. However, such a metric provides a formal basis for analytical work in transformation-based multidimensional spatial access methods, including locality preservation of the underlying transformation and distance-based spatial queries. We study the ...

متن کامل

Computational Aspects of the Hausdorff Distance in Unbounded Dimension

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspaceor vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed to be homothetically transformed in order to minimize its Hausdorff distance to another one. For this problem, we characterize optimal solutions, deduce a Hell...

متن کامل

Polyhedral results for assignment problems

This paper introduces an Integer Programming model for multidimensional assignment problems and examines the underlying polytopes. It also proposes a certain hierarchy among assignment polytopes. The dimension for classes of multidimensional assignment polytopes is established, unifying and generalising previous results. The framework introduced constitutes the first step towards a polyhedral c...

متن کامل

The Lower Bound Theorem for polytopes that approximate C-convex bodies

The face numbers of simplicial polytopes that approximate C-convex bodies in the Hausdorff metric is studied. Several structural results about the skeleta of such polytopes are studied and used to derive a lower bound theorem for this class of polytopes. This partially resolves a conjecture made by Kalai in 1994: if a sequence {Pn}n=0 of simplicial polytopes converges to a C-convex body in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2008