Displaying similar documents to “On families of weakly dependent random variables”

Size of the giant component in a random geometric graph

Ghurumuruhan Ganesan (2013)

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

Similarity:

In this paper, we study the size of the giant component C G in the random geometric graph G = G ( n , r n , f ) of n nodes independently distributed each according to a certain density f ( · ) in [ 0 , 1 ] 2 satisfying inf x [ 0 , 1 ] 2 f ( x ) g t ; 0 . If c 1 n r n 2 c 2 log n n for some positive constants c 1 , c 2 and n r n 2 as n , we show that the giant component of G contains at least n - o ( n ) nodes with probability at least 1 - e - β n r n 2 for all n and for some positive constant β . We also obtain estimates on the diameter and number of the non-giant components of G .

Asymptotic behavior of a stochastic combustion growth process

Alejandro Ramírez, Vladas Sidoravicius (2004)

Journal of the European Mathematical Society

Similarity:

We study a continuous time growth process on the d -dimensional hypercubic lattice 𝒵 d , which admits a phenomenological interpretation as the combustion reaction A + B 2 A , where A represents heat particles and B inert particles. This process can be described as an interacting particle system in the following way: at time 0 a simple symmetric continuous time random walk of total jump rate one begins to move from the origin of the hypercubic lattice; then, as soon as any random walk visits a site...

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...

Positivity of integrated random walks

Vladislav Vysotsky (2014)

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

Similarity:

Take a centered random walk S n and consider the sequence of its partial sums A n : = i = 1 n S i . Suppose S 1 is in the domain of normal attraction of an α -stable law with 1 l t ; α 2 . Assuming that S 1 is either right-exponential (i.e. ( S 1 g t ; x | S 1 g t ; 0 ) = e - a x for some a g t ; 0 and all x g t ; 0 ) or right-continuous (skip free), we prove that { A 1 g t ; 0 , , A N g t ; 0 } C α N 1 / ( 2 α ) - 1 / 2 as N , where C α g t ; 0 depends on the distribution of the walk. We also consider a conditional version of this problem and study positivity of integrated discrete bridges.

Property ( 𝐰𝐋 ) and the reciprocal Dunford-Pettis property in projective tensor products

Ioana Ghenciu (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A Banach space X has the reciprocal Dunford-Pettis property ( R D P P ) if every completely continuous operator T from X to any Banach space Y is weakly compact. A Banach space X has the R D P P (resp. property ( w L ) ) if every L -subset of X * is relatively weakly compact (resp. weakly precompact). We prove that the projective tensor product X π Y has property ( w L ) when X has the R D P P , Y has property ( w L ) , and L ( X , Y * ) = K ( X , Y * ) .

Random ε-nets and embeddings in N

Y. Gordon, A. E. Litvak, A. Pajor, N. Tomczak-Jaegermann (2007)

Studia Mathematica

Similarity:

We show that, given an n-dimensional normed space X, a sequence of N = ( 8 / ε ) 2 n independent random vectors ( X i ) i = 1 N , uniformly distributed in the unit ball of X*, with high probability forms an ε-net for this unit ball. Thus the random linear map Γ : N defined by Γ x = ( x , X i ) i = 1 N embeds X in N with at most 1 + ε norm distortion. In the case X = ℓ₂ⁿ we obtain a random 1+ε-embedding into N with asymptotically best possible relation between N, n, and ε.

Factorizations of normality via generalizations of β -normality

Ananga Kumar Das, Pratibha Bhat, Ria Gupta (2016)

Mathematica Bohemica

Similarity:

The notion of β -normality was introduced and studied by Arhangel’skii, Ludwig in 2001. Recently, almost β -normal spaces, which is a simultaneous generalization of β -normal and almost normal spaces, were introduced by Das, Bhat and Tartir. We introduce a new generalization of normality, namely weak β -normality, in terms of θ -closed sets, which turns out to be a simultaneous generalization of β -normality and θ -normality. A space X is said to be weakly β -normal (w β -normal ) if for every...

Giant component and vacant set for random walk on a discrete torus

Itai Benjamini, Alain-Sol Sznitman (2008)

Journal of the European Mathematical Society

Similarity:

We consider random walk on a discrete torus E of side-length N , in sufficiently high dimension d . We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time u N d . We show that when u is chosen small, as N tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const log N . Moreover, this connected component occupies a...

Complete pairs of coanalytic sets

Jean Saint Raymond (2007)

Fundamenta Mathematicae

Similarity:

Let X be a Polish space, and let C₀ and C₁ be disjoint coanalytic subsets of X. The pair (C₀,C₁) is said to be complete if for every pair (D₀,D₁) of disjoint coanalytic subsets of ω ω there exists a continuous function f : ω ω X such that f - 1 ( C ) = D and f - 1 ( C ) = D . We give several explicit examples of complete pairs of coanalytic sets.

Generalized 3-edge-connectivity of Cartesian product graphs

Yuefang Sun (2015)

Czechoslovak Mathematical Journal

Similarity:

The generalized k -connectivity κ k ( G ) of a graph G was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k -edge-connectivity which is defined as λ k ( G ) = min { λ ( S ) : S V ( G ) and | S | = k } , where λ ( S ) denotes the maximum number of pairwise edge-disjoint trees T 1 , T 2 , ... , T in G such that S V ( T i ) for 1 i . In this paper we prove that for any two connected graphs G and H we have λ 3 ( G H ) λ 3 ( G ) + λ 3 ( H ) , where G H is the Cartesian product of G and H . Moreover, the bound is sharp. We also...

Persistence of iterated partial sums

Amir Dembo, Jian Ding, Fuchang Gao (2013)

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

Similarity:

Let S n ( 2 ) denote the iterated partial sums. That is, S n ( 2 ) = S 1 + S 2 + + S n , where S i = X 1 + X 2 + + X i . Assuming X 1 , X 2 , ... , X n are integrable, zero-mean, i.i.d. random variables, we show that the persistence probabilities p n ( 2 ) : = max 1 i n S i ( 2 ) l t ; 0 c 𝔼 | S n + 1 | ( n + 1 ) 𝔼 | X 1 | , with c 6 30 (and c = 2 whenever X 1 is symmetric). The converse inequality holds whenever the non-zero min ( - X 1 , 0 ) is bounded or when it has only finite third moment and in addition X 1 is squared integrable. Furthermore, p n ( 2 ) n - 1 / 4 for any non-degenerate squared integrable, i.i.d., zero-mean X i . In contrast, we show that for any 0 l t ; γ l t ; 1 / 4 there exist integrable,...

Soft local times and decoupling of random interlacements

Serguei Popov, Augusto Teixeira (2015)

Journal of the European Mathematical Society

Similarity:

In this paper we establish a decoupling feature of the random interlacement process u d at level u , d 3 . Roughly speaking, we show that observations of u restricted to two disjoint subsets A 1 and A 2 of d are approximately independent, once we add a sprinkling to the process u by slightly increasing the parameter u . Our results differ from previous ones in that we allow the mutual distance between the sets A 1 and A 2 to be much smaller than their diameters. We then provide an important application...

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 .

On Hattori spaces

A. Bouziad, E. Sukhacheva (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

For a subset A of the real line , Hattori space H ( A ) is a topological space whose underlying point set is the reals and whose topology is defined as follows: points from A are given the usual Euclidean neighborhoods while remaining points are given the neighborhoods of the Sorgenfrey line. In this paper, among other things, we give conditions on A which are sufficient and necessary for H ( A ) to be respectively almost Čech-complete, Čech-complete, quasicomplete, Čech-analytic and weakly separated...

The Turán number of the graph 3 P 4

Halina Bielak, Sebastian Kieliszek (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let e x ( n , G ) denote the maximum number of edges in a graph on n vertices which does not contain G as a subgraph. Let P i denote a path consisting of i vertices and let m P i denote m disjoint copies of P i . In this paper we count e x ( n , 3 P 4 ) .

Why Jordan algebras are natural in statistics: quadratic regression implies Wishart distributions

G. Letac, J. Wesołowski (2011)

Bulletin de la Société Mathématique de France

Similarity:

If the space 𝒬 of quadratic forms in n is splitted in a direct sum 𝒬 1 ... 𝒬 k and if X and Y are independent random variables of n , assume that there exist a real number a such that E ( X | X + Y ) = a ( X + Y ) and real distinct numbers b 1 , . . . , b k such that E ( q ( X ) | X + Y ) = b i q ( X + Y ) for any q in 𝒬 i . We prove that this happens only when k = 2 , when n can be structured in a Euclidean Jordan algebra and when X and Y have Wishart distributions corresponding to this structure.

On graceful colorings of trees

Sean English, Ping Zhang (2017)

Mathematica Bohemica

Similarity:

A proper coloring c : V ( G ) { 1 , 2 , ... , k } , k 2 of a graph G is called a graceful k -coloring if the induced edge coloring c ' : E ( G ) { 1 , 2 , ... , k - 1 } defined by c ' ( u v ) = | c ( u ) - c ( v ) | for each edge u v of G is also proper. The minimum integer k for which G has a graceful k -coloring is the graceful chromatic number χ g ( G ) . It is known that if T is a tree with maximum degree Δ , then χ g ( T ) 5 3 Δ and this bound is best possible. It is shown for each integer Δ 2 that there is an infinite class of trees T with maximum degree Δ such that χ g ( T ) = 5 3 Δ . In particular, we investigate for each...

The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths

Halina Bielak, Kinga Dąbrowska (2015)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

The Ramsey number R ( G , H ) for a pair of graphs G and H is defined as the smallest integer n such that, for any graph F on n vertices, either F contains G or F ¯ contains H as a subgraph, where F ¯ denotes the complement of F . We study Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths and determine these numbers for some cases. We extend many known results studied in [5, 14, 18, 19, 20]. In particular we count the numbers R ( K 1 + L n , P m ) and R ( K 1 + L n , C m ) for some integers m , n , where L n is...

On path-quasar Ramsey numbers

Binlong Li, Bo Ning (2014)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let G 1 and G 2 be two given graphs. The Ramsey number R ( G 1 , G 2 ) is the least integer r such that for every graph G on r vertices, either G contains a G 1 or G ¯ contains a G 2 . Parsons gave a recursive formula to determine the values of R ( P n , K 1 , m ) , where P n is a path on n vertices and K 1 , m is a star on m + 1 vertices. In this note, we study the Ramsey numbers R ( P n , K 1 F m ) , where F m is a linear forest on m vertices. We determine the exact values of R ( P n , K 1 F m ) for the cases m n and m 2 n , and for the case that F m has no odd component. Moreover, we...

The weak Gelfand-Phillips property in spaces of compact operators

Ioana Ghenciu (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

For Banach spaces X and Y , let K w * ( X * , Y ) denote the space of all w * - w continuous compact operators from X * to Y endowed with the operator norm. A Banach space X has the w G P property if every Grothendieck subset of X is relatively weakly compact. In this paper we study Banach spaces with property w G P . We investigate whether the spaces K w * ( X * , Y ) and X ϵ Y have the w G P property, when X and Y have the w G P property.