Limit distributions of the maximal distance to the nearest neighbour

2019 ◽  
Vol 29 (6) ◽  
pp. 373-381
Author(s):  
Oleg P. Orlov
Keyword(s):  
Metric Space ◽  
Limit Theorems ◽  
Random Variable ◽  
Nearest Neighbour ◽  
Limit Distributions ◽  
Maximal Distance ◽  
Definite Sense ◽  
Methods Of Moments ◽  
Stein Method

Abstract For sets of iid random points having a uniform (in a definite sense) distribution on the arbitrary metric space a maximal distance to the nearest neighbour is considered. By means of the Chen–Stein method new limit theorems for this random variable is proved. For random uniform samples from the set of binary cube vertices analogous results are obtained by the methods of moments.

scholarly journals On limit theorems for random fields

2009 ◽  
Vol 50 ◽  
Author(s):  
Rimas Banys
Keyword(s):  
Metric Space ◽  
Random Fields ◽  
Limit Theorems ◽  
Characteristic Property ◽  
Complete Separable Metric Space ◽  
Separable Metric Space

A complete separable metric space of functions defined on the positive quadrant of the plane is constructed. The characteristic property of these functions is that at every point x there exist two lines intersecting at this point such that limits limy→x f (y) exist when y approaches x along any path not intersecting these lines. A criterion of compactness of subsets of this space is obtained.

Čebyšev Sets in Hyperspaces over Rn

2009 ◽  
Vol 61 (2) ◽  
pp. 299-314 ◽  
Author(s):  
Robert J. MacG. Dawson and ◽  
Maria Moszyńska
Keyword(s):  
Metric Space ◽  
Convex Sets ◽  
Compact Convex ◽  
Hausdorff Metric ◽  
Linear Structure ◽  
Convex Compact ◽  
Nearest Neighbour ◽  
Compact Sets ◽  
Strictly Convex ◽  
Convex Compact Sets

Abstract. A set in a metric space is called a Čebyšev set if it has a unique “nearest neighbour” to each point of the space. In this paper we generalize this notion, defining a set to be Čebyšev relative to another set if every point in the second set has a unique “nearest neighbour” in the first. We are interested in Čebyšev sets in some hyperspaces over Rn, endowed with the Hausdorff metric, mainly the hyperspaces of compact sets, compact convex sets, and strictly convex compact sets. We present some new classes of Čebyšev and relatively Čebyšev sets in various hyperspaces. In particular, we show that certain nested families of sets are Čebyšev. As these families are characterized purely in terms of containment,without reference to the semi-linear structure of the underlyingmetric space, their properties differ markedly from those of known Čebyšev sets.

Limit theorems for random mating in infinite populations

1966 ◽  
Vol 3 (01) ◽  
pp. 94-114 ◽  
Author(s):  
B. E. Ellison
Keyword(s):  
Limit Distribution ◽  
Limit Theorems ◽  
Random Mating ◽  
Limit Distributions ◽  
Infinite Population ◽  
The Law

This paper is concerned with the distribution of “types” of individuals in an infinite population after indefinitely many nonoverlapping generations of random mating. The absence of selection and mutation is assumed. The probabilistic law which governs the production of an offspring may be asymmetrical with respect to the “sexes” of the two parents, but the law is assumed to apply independently of the “sex” of the offspring. The question of the existence of a limit distribution of types, the rate at which a limit distribution is approached, and properties of limit distributions are treated.

scholarly journals Limit distribution of distances in biased random tries

2006 ◽  
Vol 43 (02) ◽  
pp. 377-390 ◽  
Author(s):  
Rafik Aguech ◽  
Nabil Lasmar ◽  
Hosam Mahmoud
Keyword(s):  
Fixed Point ◽  
Metric Space ◽  
Limit Distribution ◽  
Analytical Techniques ◽  
Random Variable ◽  
Wasserstein Metric ◽  
Contraction Method ◽  
Point Solution ◽  
Mean And Variance

Thetrieis a sort of digital tree. Ideally, to achieve balance, the trie should grow from an unbiased source generating keys of bits with equal likelihoods. In practice, the lack of bias is not always guaranteed. We investigate the distance between randomly selected pairs of nodes among the keys in a biased trie. This research complements that of Christophi and Mahmoud (2005); however, the results and some of the methodology are strikingly different. Analytical techniques are still useful for moments calculation. Both mean and variance are of polynomial order. It is demonstrated that the standardized distance approaches a normal limiting random variable. This is proved by the contraction method, whereby the limit distribution is shown to approach the fixed-point solution of a distributional equation in the Wasserstein metric space.

Limit theorems for stochastic growth models. I

1972 ◽  
Vol 4 (02) ◽  
pp. 193-232 ◽  
Author(s):  
Harry Kesten
Keyword(s):  
Fixed Point ◽  
Limit Theorem ◽  
Limit Theorems ◽  
Growth Models ◽  
Branching Processes ◽  
Random Variable ◽  
Present Situation ◽  
Stochastic Growth ◽  
Stochastic Growth Models ◽  
Zygotic Selection

We consider d-dimensional stochastic processes which take values in (R+) d . These processes generalize Galton-Watson branching processes, but the main assumption of branching processes, independence between particles, is dropped. Instead, we assume for some Here τ: (R+) d → R+, |x| = Σ1 d |x(i)| A = {x ∈ (R+) d : |x| = 1} and T: A → A. Under various assumptions on the maps τ and T it is shown that with probability one there exists a ρ > 1, a fixed point p ∈ A of T and a random variable w such that lim n→∞ Z n ρ−n = wp. This result is a generalization of the main limit theorem for super-critical branching processes; note, however, that in the present situation both p and ρ are random as well. The results are applied to a population genetical model for zygotic selection without mutation at one locus.

Short distances, flat triangles and Poisson limits

1978 ◽  
Vol 15 (04) ◽  
pp. 815-825 ◽  
Author(s):  
Bernard Silverman ◽  
Tim Brown
Keyword(s):  
Spatial Data ◽  
Limit Theorems ◽  
Nearest Neighbour ◽  
Poisson Limit

Motivated by problems in the analysis of spatial data, we prove some general Poisson limit theorems for the U-statistics of Hoeffding (1948). The theorems are applied to tests of clustering or collinearities in plane data; nearest neighbour distances are also considered.

Conditioned limit theorems for waiting-time processes of the M/G/1 queue

1983 ◽  
Vol 20 (03) ◽  
pp. 675-688 ◽  
Author(s):  
G. Hooghiemstra
Keyword(s):  
Waiting Time ◽  
Limit Theorems ◽  
Random Variable ◽  
Weak Limit ◽  
Random Time ◽  
Time Process ◽  
Brownian Excursion ◽  
Time Index ◽  
Waiting Time Process ◽  
Number Of Customers

This paper is on conditioned weak limit theorems for imbedded waiting-time processes of an M/G/1 queue. More specifically we study functional limit theorems for the actual waiting-time process conditioned by the event that the number of customers in a busy period exceeds n or equals n. Attention is also paid to the actual waiting-time process with random time index. Combined with the existing literature on the subject this paper gives a complete account of the conditioned limit theorems for the actual waiting-time process of an M/G/1 queue for arbitrary traffic intensity and for a rather general class of service-time distributions. The limit processes that occur are Brownian excursion and meander, while in the case of random time index also the following limit occurs: Brownian excursion divided by an independent and uniform (0, 1) distributed random variable.

Limit theorems for stochastic growth models. II

1972 ◽  
Vol 4 (3) ◽  
pp. 393-428 ◽  
Author(s):  
Harry Kesten
Keyword(s):  
Limit Theorems ◽  
Growth Models ◽  
Branching Processes ◽  
Random Variable ◽  
Present Situation ◽  
Stochastic Growth ◽  
Stochastic Growth Models ◽  
Zygotic Selection ◽  
Image Position ◽  
Supercritical Branching Processes

We consider d-dimensional stochastic processes which take values in (R+)d These processes generalize Galton-Watson branching processes, but the main assumption of branching processes, independence between particles, is dropped. Instead, we assume for some Here τ:(R+)d→R +, |x| = σ1d |x(i)|, A {x ∈(R+)d: |x| 1} and T: A→A. Under various assumptions on the maps τ and T it is shown that with probability one there exists a ρ > 1, a fixed point p ∈ A of T and a random variable w such that limn→∞Zn|ρnwp. This result is a generalization of the main limit theorem for supercritical branching processes; note, however, that in the present situation both ρ and ρ are random as well. The results are applied to a population genetical model for zygotic selection without mutation at one locus.

Sojourns and extremes of a diffusion process on a fixed interval

1982 ◽  
Vol 14 (4) ◽  
pp. 811-832 ◽  
Author(s):  
Simeon M. Berman
Keyword(s):  
Diffusion Process ◽  
Lebesgue Measure ◽  
Stationary Distribution ◽  
Real Line ◽  
Diffusion Coefficients ◽  
Limit Theorems ◽  
Random Variable ◽  
Fixed Interval ◽  
The Real ◽  
And Diffusion

Let X(t), , be an Ito diffusion process on the real line. For u > 0 and t > 0, let Lt(u) be the Lebesgue measure of the set . Limit theorems are obtained for (i) the distribution of Lt(u) for u → ∞and fixed t, and (ii) the tail of the distribution of the random variable max[0, t]X(s). The conditions on the process are stated in terms of the drift and diffusion coefficients. These conditions imply the existence of a stationary distribution for the process.

Random walks and periodic continued fractions

1985 ◽  
Vol 17 (1) ◽  
pp. 67-84 ◽  
Author(s):  
Wolfgang Woess
Keyword(s):  
Random Walks ◽  
Harmonic Functions ◽  
Limit Theorems ◽  
Continued Fraction ◽  
Transition Probabilities ◽  
Local Limit ◽  
Periodic Sequence ◽  
Nearest Neighbour ◽  
Continued Fraction Expansions ◽  
Local Limit Theorems

Nearest-neighbour random walks on the non-negative integers with transition probabilities p0,1 = 1, pk,k–1 = gk, pk,k+1 = 1– gk (0 < gk < 1, k = 1, 2, …) are studied by use of generating functions and continued fraction expansions. In particular, when (gk) is a periodic sequence, local limit theorems are proved and the harmonic functions are determined. These results are applied to simple random walks on certain trees.

Sign in / Sign up

Export Citation Format

Share Document