Longest Increasing Path within the Critical Strip

نویسندگان

  • PARTHA S. DEY
  • MATHEW JOSEPH
چکیده

Consider the square [0, n] with points from a Poisson point process of intensity 1 distributed within it. In [4] it was shown that the length Ln of a maximal increasing path (an increasing path that contains the most number of points) when properly centered and scaled converges to the Tracy-Widom distribution. Later [16] showed that all maximal paths have a displacement of n 2 3 +o(1) from the diagonal with probability tending to 1 as n → ∞. In this paper, we consider the length L (γ) n of maximal increasing paths restricted to lie within a strip of width n γ , γ < 2 3 around the diagonal and show that when properly centered and scaled it converges to a Gaussian distribution. We also obtain bounds on the expectation and variance of L (γ) n .

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

ثبت نام

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

منابع مشابه

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Near–Critical Path Analysis: A Tool for Parallel Program Optimization

Program activity graphs (PAGs) can be constructed from timestamped traces of appropriate execution events. Information about the activities on the k longest execution paths is useful in the analysis of parallel program performance. In this paper, four algorithms for finding the near–critical paths of PAGs are compared, including a best–first search (BFS) algorithm that is worst–case asymptotica...

متن کامل

Investigating the effect of structural form of outdoor path of residential complexes on improving the routing of people in emergency situations

Background and Objective: Due to the importance of time in choosing the optimal routing to reduce the damage caused by accidents in critical situations such as earthquakes, fires, etc., the structural form of the route has a significant impact on the selection of people in emergencies. It can also be very effective in the work for designers, managers and urban planners for disaster risk managem...

متن کامل

Critical Path Analysis for the Execution of Parallel and Distributed Programs

This paper presents the design, implementation and testing of the critical path analysis technique on the IPS performance measurement tool for parallel and distributed programs. We create a precedence graph of a program’s activities (Program Activity Graph) with the data collected during the execution of a program. The critical path, the longest path in the program activity graph, represents th...

متن کامل

The Critical Path Problem in Timing Veri

This paper is an introduction to the problem of Critical Path determination in the context of Timing Veriication. After correct logic veriication, timing is the next most important concern to be addressed by designers. The speed of a circuit is related to the length of the longest path through which a signal can travel, also known as the longest true path or critical path of the circuit. This p...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015