The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A continuous mapping theorem for the argmin-set functional with applications to convex stochastic processes”

On reliability analysis of consecutive k -out-of- n systems with arbitrarily dependent components

Ebrahim Salehi (2016)

Applications of Mathematics

Similarity:

In this paper, we consider the linear and circular consecutive k -out-of- n systems consisting of arbitrarily dependent components. Under the condition that at least n - r + 1 components ( r n ) of the system are working at time t , we study the reliability properties of the residual lifetime of such systems. Also, we present some stochastic ordering properties of residual lifetime of consecutive k -out-of- n systems. In the following, we investigate the inactivity time of the component with lifetime...

On linear preservers of two-sided gut-majorization on 𝐌 n , m

Asma Ilkhanizadeh Manesh, Ahmad Mohammadhasani (2018)

Czechoslovak Mathematical Journal

Similarity:

For X , Y 𝐌 n , m it is said that X is gut-majorized by Y , and we write X gut Y , if there exists an n -by- n upper triangular g-row stochastic matrix R such that X = R Y . Define the relation gut as follows. X gut Y if X is gut-majorized by Y and Y is gut-majorized by X . The (strong) linear preservers of gut on n and strong linear preservers of this relation on 𝐌 n , m have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of gut on n and 𝐌 n , m .

Weak convergence of mutually independent X B and X A under weak convergence of X X B - X A

W. Szczotka (2006)

Applicationes Mathematicae

Similarity:

For each n ≥ 1, let v n , k , k 1 and u n , k , k 1 be mutually independent sequences of nonnegative random variables and let each of them consist of mutually independent and identically distributed random variables with means v̅ₙ and u̅̅ₙ, respectively. Let X B ( t ) = ( 1 / c ) j = 1 [ n t ] ( v n , j - v ̅ ) , X A ( t ) = ( 1 / c ) j = 1 [ n t ] ( u n , j - u ̅ ̅ ) , t ≥ 0, and X = X B - X A . The main result gives conditions under which the weak convergence X X , where X is a Lévy process, implies X B X B and X A X A , where X B and X A are mutually independent Lévy processes and X = X B - X A .

Nonconventional limit theorems in averaging

Yuri Kifer (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider “nonconventional” averaging setup in the form d X ε ( t ) d t = ε B ( X ε ( t ) , 𝛯 ( q 1 ( t ) ) , 𝛯 ( q 2 ( t ) ) , ... , 𝛯 ( q ( t ) ) ) where 𝛯 ( t ) , t 0 is either a stochastic process or a dynamical system with sufficiently fast mixing while q j ( t ) = α j t , α 1 l t ; α 2 l t ; l t ; α k and q j , j = k + 1 , ... , grow faster than linearly. We show that the properly normalized error term in the “nonconventional” averaging principle is asymptotically Gaussian.

On row-sum majorization

Farzaneh Akbarzadeh, Ali Armandnejad (2019)

Czechoslovak Mathematical Journal

Similarity:

Let 𝕄 n , m be the set of all n × m real or complex matrices. For A , B 𝕄 n , m , we say that A is row-sum majorized by B (written as A rs B ) if R ( A ) R ( B ) , where R ( A ) is the row sum vector of A and is the classical majorization on n . In the present paper, the structure of all linear operators T : 𝕄 n , m 𝕄 n , m preserving or strongly preserving row-sum majorization is characterized. Also we consider the concepts of even and circulant majorization on n and then find the linear preservers of row-sum majorization of these relations on 𝕄 n , m . ...

On the combinatorial structure of 0 / 1 -matrices representing nonobtuse simplices

Jan Brandts, Abdullah Cihangir (2019)

Applications of Mathematics

Similarity:

A 0 / 1 -simplex is the convex hull of n + 1 affinely independent vertices of the unit n -cube I n . It is nonobtuse if none of its dihedral angles is obtuse, and acute if additionally none of them is right. Acute 0 / 1 -simplices in I n can be represented by 0 / 1 -matrices P of size n × n whose Gramians G = P P have an inverse that is strictly diagonally dominant, with negative off-diagonal entries. In this paper, we will prove that the positive part D of the transposed inverse P - of P is doubly stochastic and has the...

Spectral condition, hitting times and Nash inequality

Eva Löcherbach, Oleg Loukianov, Dasha Loukianova (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Let X be a μ -symmetric Hunt process on a LCCB space 𝙴 . For an open set 𝙶 𝙴 , let τ 𝙶 be the exit time of X from 𝙶 and A 𝙶 be the generator of the process killed when it leaves 𝙶 . Let r : [ 0 , [ [ 0 , [ and R ( t ) = 0 t r ( s ) d s . We give necessary and sufficient conditions for 𝔼 μ R ( τ 𝙶 ) l t ; in terms of the behavior near the origin of the spectral measure of - A 𝙶 . When r ( t ) = t l , l 0 , by means of this condition we derive the Nash inequality for the killed process. In the diffusion case this permits to show that the existence of moments of order l + 1 for τ 𝙶 ...

𝒞 k -regularity for the ¯ -equation with a support condition

Shaban Khidr, Osama Abdelkader (2017)

Czechoslovak Mathematical Journal

Similarity:

Let D be a 𝒞 d q -convex intersection, d 2 , 0 q n - 1 , in a complex manifold X of complex dimension n , n 2 , and let E be a holomorphic vector bundle of rank N over X . In this paper, 𝒞 k -estimates, k = 2 , 3 , , , for solutions to the ¯ -equation with small loss of smoothness are obtained for E -valued ( 0 , s ) -forms on D when n - q s n . In addition, we solve the ¯ -equation with a support condition in 𝒞 k -spaces. More precisely, we prove that for a ¯ -closed form f in 𝒞 0 , q k ( X D , E ) , 1 q n - 2 , n 3 , with compact support and for ε with 0 < ε < 1 there...

Uniform mixing time for random walk on lamplighter graphs

Júlia Komjáthy, Jason Miller, Yuval Peres (2014)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Suppose that 𝒢 is a finite, connected graph and X is a lazy random walk on 𝒢 . The lamplighter chain X associated with X is the random walk on the wreath product 𝒢 = 𝐙 2 𝒢 , the graph whose vertices consist of pairs ( f ̲ , x ) where f is a labeling of the vertices of 𝒢 by elements of 𝐙 2 = { 0 , 1 } and x is a vertex in 𝒢 . There is an edge between ( f ̲ , x ) and ( g ̲ , y ) in 𝒢 if and only if x is adjacent to y in 𝒢 and f z = g z for all z x , y . In each step, X moves from a configuration ( f ̲ , x ) by updating x to y using the transition rule of X and then...

More on exposed points and extremal points of convex sets in n and Hilbert space

Stoyu T. Barov (2023)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let 𝕍 be a separable real Hilbert space, k with k < dim 𝕍 , and let B be convex and closed in 𝕍 . Let 𝒫 be a collection of linear k -subspaces of 𝕍 . A point w B is called exposed by 𝒫 if there is a P 𝒫 so that ( w + P ) B = { w } . We show that, under some natural conditions, B can be reconstituted as the convex hull of the closure of all its exposed by 𝒫 points whenever 𝒫 is dense and G δ . In addition, we discuss the question when the set of exposed by some 𝒫 points forms a G δ -set.