Displaying similar documents to “Giant component and vacant set for random walk on a discrete torus”

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

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.

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

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 .

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

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

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

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 .

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

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.

Small and large time stability of the time taken for a Lévy process to cross curved boundaries

Philip S. Griffin, Ross A. Maller (2013)

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

Similarity:

This paper is concerned with the small time behaviour of a Lévy process X . In particular, we investigate theof the times, T ¯ b ( r ) and T b * ( r ) , at which X , started with X 0 = 0 , first leaves the space-time regions { ( t , y ) 2 : y r t b , t 0 } (one-sided exit), or { ( t , y ) 2 : | y | r t b , t 0 } (two-sided exit), 0 b l t ; 1 , as r 0 . Thus essentially we determine whether or not these passage times behave like deterministic functions in the sense of different modes of convergence; specifically convergence in probability, almost surely and in L p . In many instances these are...

Sum-product theorems and incidence geometry

Mei-Chu Chang, Jozsef Solymosi (2007)

Journal of the European Mathematical Society

Similarity:

In this paper we prove the following theorems in incidence geometry. 1. There is δ > 0 such that for any P 1 , , P 4 , and Q 1 , , Q n 2 , if there are n ( 1 + δ ) / 2 many distinct lines between P i and Q j for all i , j , then P 1 , , P 4 are collinear. If the number of the distinct lines is < c n 1 / 2 then the cross ratio of the four points is algebraic. 2. Given c > 0 , there is δ > 0 such that for any P 1 , P 2 , P 3 2 noncollinear, and Q 1 , , Q n 2 , if there are c n 1 / 2 many distinct lines between P i and Q j for all i , j , then for any P 2 { P 1 , P 2 , P 3 } , we have δ n distinct lines between P and Q j . 3. Given...

Three-space problems for the approximation property

A. Szankowski (2009)

Journal of the European Mathematical Society

Similarity:

It is shown that there is a subspace Z q of q for 1 < q < 2 which is isomorphic to q such that q / Z q does not have the approximation property. On the other hand, for 2 < p < there is a subspace Y p of p such that Y p does not have the approximation property (AP) but the quotient space p / Y p is isomorphic to p . The result is obtained by defining random “Enflo-Davie spaces” Y p which with full probability fail AP for all 2 < p and have AP for all 1 p 2 . For 1 < p 2 , Y p are isomorphic to p .

On compactness and connectedness of the paratingent

Wojciech Zygmunt (2016)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

In this note we shall prove that for a continuous function ϕ : Δ n , where Δ ,  the paratingent of ϕ at a Δ is a non-empty and compact set in n if and only if ϕ satisfies Lipschitz condition in a neighbourhood of a . Moreover, in this case the paratingent is a connected set.

The spread of a catalytic branching random walk

Philippe Carmona, Yueyun Hu (2014)

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

Similarity:

We consider a catalytic branching random walk on that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position M n : For some constant α , M n n α almost surely on the set of infinite number of visits of the origin. Then we determine all possible limiting laws for M n - α n as n goes to infinity.