scholarly journals Strong convergence of multivariate maxima

2020 ◽  
Vol 57 (1) ◽  
pp. 314-331
Author(s):  
Michael Falk ◽  
Simone A. Padoan ◽  
Stefano Rizzelli

AbstractIt is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We extend this result to higher dimensions by considering copulas. We show that the strong convergence result holds for copulas that are in a differential neighbourhood of a multivariate generalised Pareto copula. Sklar’s theorem then implies convergence in variational distance of the maximum of n independent and identically distributed random vectors with arbitrary common distribution function and (under conditions on the marginals) of its appropriately normalised version. We illustrate how these convergence results can be exploited to establish the almost-sure consistency of some estimation procedures for max-stable models, using sample maxima.

2014 ◽  
Vol 57 (4) ◽  
pp. 708-720 ◽  
Author(s):  
Michael Brannan

AbstractIt is known that the normalized standard generators of the free orthogonal quantum groupO+Nconverge in distribution to a free semicircular system as N → ∞. In this note, we substantially improve this convergence result by proving that, in addition to distributional convergence, the operator normof any non-commutative polynomial in the normalized standard generators ofO+Nconverges asN→ ∞ to the operator norm of the corresponding non-commutative polynomial in a standard free semicircular system. Analogous strong convergence results are obtained for the generators of free unitary quantum groups. As applications of these results, we obtain a matrix-coefficient version of our strong convergence theorem, and we recover a well-knownL2-L∞norm equivalence for noncommutative polynomials in free semicircular systems.


2001 ◽  
Vol 33 (4) ◽  
pp. 864-873 ◽  
Author(s):  
Raúl Gouet ◽  
F. Javier López ◽  
Miguel San Miguel

Let (Xn) be a sequence of independent, identically distributed random variables, with common distribution function F, possibly discontinuous. We use martingale arguments to connect the number of upper records from (Xn) with sums of minima of related random variables. From this relationship we derive a general strong law for the number of records for a wide class of distributions F, including geometric and Poisson.


2001 ◽  
Vol 33 (04) ◽  
pp. 864-873 ◽  
Author(s):  
Raúl Gouet ◽  
F. Javier López ◽  
Miguel San Miguel

Let (X n ) be a sequence of independent, identically distributed random variables, with common distribution function F, possibly discontinuous. We use martingale arguments to connect the number of upper records from (X n ) with sums of minima of related random variables. From this relationship we derive a general strong law for the number of records for a wide class of distributions F, including geometric and Poisson.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Chibueze Christian Okeke ◽  
Abdulmalik Usman Bello ◽  
Lateef Olakunle Jolaoso ◽  
Kingsley Chimuanya Ukandu

<p style='text-indent:20px;'>This paper analyzed the new extragradient type algorithm with inertial extrapolation step for solving self adaptive split null point problem and pseudomonotone variational inequality in real Hilbert space. Furthermore, in this study, a strong convergence result is obtained without assuming Lipschitz continuity of the associated mapping and the operator norm is self adaptive. Additionally, the proposed algorithm only uses one projections onto the feasible set in each iteration. More so, the strong convergence results are obtained under some relaxed conditions on the initial factor and the iterative parameters. Numerical results are presented to illustrate the performance of the proposed algorithm.The results obtained in this study improved and extended related studies in the literature.</p>


Author(s):  
Hazim Mansour Gorgees ◽  
Bushra Abdualrasool Ali ◽  
Raghad Ibrahim Kathum

     In this paper, the maximum likelihood estimator and the Bayes estimator of the reliability function for negative exponential distribution has been derived, then a Monte –Carlo simulation technique was employed to compare the performance of such estimators. The integral mean square error (IMSE) was used as a criterion for this comparison. The simulation results displayed that the Bayes estimator performed better than the maximum likelihood estimator for different samples sizes.


1965 ◽  
Vol 2 (02) ◽  
pp. 352-376 ◽  
Author(s):  
Samuel Karlin ◽  
James McGregor

In the Ehrenfest model with continuous time one considers two urns and N balls distributed in the urns. The system is said to be in stateiif there areiballs in urn I, N −iballs in urn II. Events occur at random times and the time intervals T between successive events are independent random variables all with the same negative exponential distributionWhen an event occurs a ball is chosen at random (each of theNballs has probability 1/Nto be chosen), removed from its urn, and then placed in urn I with probabilityp, in urn II with probabilityq= 1 −p, (0 &lt;p&lt; 1).


Author(s):  
Stefano Almi ◽  
Marco Morandotti ◽  
Francesco Solombrino

AbstractA multi-step Lagrangian scheme at discrete times is proposed for the approximation of a nonlinear continuity equation arising as a mean-field limit of spatially inhomogeneous evolutionary games, describing the evolution of a system of spatially distributed agents with strategies, or labels, whose payoff depends also on the current position of the agents. The scheme is Lagrangian, as it traces the evolution of position and labels along characteristics, and is a multi-step scheme, as it develops on the following two stages: First, the distribution of strategies or labels is updated according to a best performance criterion, and then, this is used by the agents to evolve their position. A general convergence result is provided in the space of probability measures. In the special cases of replicator-type systems and reversible Markov chains, variants of the scheme, where the explicit step in the evolution of the labels is replaced by an implicit one, are also considered and convergence results are provided.


1987 ◽  
Vol 102 (2) ◽  
pp. 329-349 ◽  
Author(s):  
Philip S. Griffin ◽  
William E. Pruitt

Let X, X1, X2,… be a sequence of non-degenerate i.i.d. random variables with common distribution function F. For 1 ≤ j ≤ n, let mn(j) be the number of Xi satisfying either |Xi| > |Xj|, 1 ≤ i ≤ n, or |Xi| = |Xj|, 1 ≤ i ≤ j, and let (r)Xn = Xj if mn(j) = r. Thus (r)Xn is the rth largest random variable in absolute value from amongst X1, …, Xn with ties being broken according to the order in which the random variables occur. Set (r)Sn = (r+1)Xn + … + (n)Xn and write Sn for (0)Sn. We will refer to (r)Sn as a trimmed sum.


Sign in / Sign up

Export Citation Format

Share Document