Introduction Let \Gamma be a group generated by a finite set S which is symmetric (s 2 S () s \Gamma1 2 S) and which does not contain the unit element. Let X = Cay(\Gamma; S) be the Cayley graph with vertex set X 0 = \Gamma and, for x; y 2 \Gamma; with fx; yg an edge if x \Gamma1 y 2 S: The corresponding Markov operator MX is defined on functions on X 0 by (MX f) (x) = 1 k X y¸x f(y) f : \Gamma ! C x 2 \Gamma where k = jSj<
AbstractA finite group G is partitioned into nonempty disjoint subsets C0, C1,…,Cm such that for eve...
Abstract. Let G be a nite group. Choose a set S of size k uniformly from G and consider a lazy rando...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Empha...
This paper announces results which have been later developped in three articles: 1. "Random walks on...
This work is mainly concerned with discrete random walks on graphs and an interesting application of...
The study of random walks demonstrates connections between their algebraic, combinatorial, geometric...
The study of random walks demonstrates connections between their algebraic, combinatorial, geometric...
AbstractIn this paper we study some properties of the convolution powers K(n)=K∗K∗⋯∗K of a probabili...
In this work, we interpret right multiplication operators Rw: l2(G) → l2(G) , w∈ ℂ[G] as random walk...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
Abstract. We investigate various features of a quite new family of graphs, introduced as a possible ...
We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotient...
We provide a unified framework to compute the stationary distribution of any finite irreducible Mark...
International audienceWe prove a general large sieve statement in the context of random walks on sub...
AbstractA finite group G is partitioned into nonempty disjoint subsets C0, C1,…,Cm such that for eve...
Abstract. Let G be a nite group. Choose a set S of size k uniformly from G and consider a lazy rando...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...
Numerical estimates are given for the spectral radius of simple random walks on Cayley graphs. Empha...
This paper announces results which have been later developped in three articles: 1. "Random walks on...
This work is mainly concerned with discrete random walks on graphs and an interesting application of...
The study of random walks demonstrates connections between their algebraic, combinatorial, geometric...
The study of random walks demonstrates connections between their algebraic, combinatorial, geometric...
AbstractIn this paper we study some properties of the convolution powers K(n)=K∗K∗⋯∗K of a probabili...
In this work, we interpret right multiplication operators Rw: l2(G) → l2(G) , w∈ ℂ[G] as random walk...
with random walk on a distance-regular graph, which roughly corresponds to nearest-neighbor isotropi...
Abstract. We investigate various features of a quite new family of graphs, introduced as a possible ...
We construct new examples of expander Cayley graphs of finite groups, arising as congruence quotient...
We provide a unified framework to compute the stationary distribution of any finite irreducible Mark...
International audienceWe prove a general large sieve statement in the context of random walks on sub...
AbstractA finite group G is partitioned into nonempty disjoint subsets C0, C1,…,Cm such that for eve...
Abstract. Let G be a nite group. Choose a set S of size k uniformly from G and consider a lazy rando...
An accessible and panoramic account of the theory of random walks on groups and graphs, stressing th...