A simplified proof of a conjecture of D. G. Kendall concerning shapes of random polygons

Igor N. Kovalenko

International Journal of Stochastic Analysis, 1999, vol. 12, 1-10

Abstract:

Following investigations by Miles, the author has given a few proofs of a conjecture of D.G. Kendall concerning random polygons determined by the tessellation of a Euclidean plane by an homogeneous Poisson line process. This proof seems to be rather elementary. Consider a Poisson line process of intensity λ on the plane ℛ 2 determining the tessellation of the plane into convex random polygons. Denote by K ω a random polygon containing the origin (so-called Crofton cell ). If the area of K ω is known to equal 1 , then the probability of the event {the contour of K ω lies between two concentric circles with the ratio 1 + ϵ of their ratio} tends to 1 as λ → ∞ .

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/12/195318.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/12/195318.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:195318

DOI: 10.1155/S1048953399000283

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().