Displaying 341 – 360 of 590

Showing per page

On the norms of the random walks on planar graphs

Andrzej Żuk (1997)

Annales de l'institut Fourier

We consider the nearest neighbor random walk on planar graphs. For certain families of these graphs, we give explicit upper bounds on the norm of the random walk operator in terms of the minimal number of edges at each vertex. We show that for a wide range of planar graphs the spectral radius of the random walk is less than one.

On the number of representations of an element in a polygonal Cayley graph

Gabriella Kuhn, Paolo M. Soardi (1987)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

We compute explicitly the number of paths of given length joining two vertices of the Cayley graph of the free product of cyclic groups of order k.

On Weak Tail Domination of Random Vectors

Rafał Latała (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

Motivated by a question of Krzysztof Oleszkiewicz we study a notion of weak tail domination of random vectors. We show that if the dominating random variable is sufficiently regular then weak tail domination implies strong tail domination. In particular, a positive answer to Oleszkiewicz's question would follow from the so-called Bernoulli conjecture. We also prove that any unconditional logarithmically concave distribution is strongly dominated by a product symmetric exponential measure.

Ordered random walks.

Eichelsbacher, Peter, König, Wolfgang (2008)

Electronic Journal of Probability [electronic only]

Persistence of iterated partial sums

Amir Dembo, Jian Ding, Fuchang Gao (2013)

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

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

Phénomène de cutoff pour certaines marches aléatoires sur le groupe symétrique

Sandrine Roussel (2000)

Colloquium Mathematicae

The main purpose of this paper is to exhibit the cutoff phenomenon, studied by Aldous and Diaconis [AD]. Let Q * k denote a transition kernel after k steps and π be a stationary measure. We have to find a critical value k n for which the total variation norm between Q * k and π stays very close to 1 for k k n , and falls rapidly to a value close to 0 for k k n with a fall-off phase much shorter than k n . According to the work of Diaconis and Shahshahani [DS], one can naturally conjecture, for a conjugacy class with...

Currently displaying 341 – 360 of 590