activity
20052008
most citedDiffusion Limited Aggregation on a Cylinder

11 citations · 14 across the 5 of their papers we have counts for

collaborators
Showing math.PRShow all

6 papers · 1 filter

math.PR20082 cited

The Player's Effect

Ronen Gradwohl, Omer Reingold, Ariel Yadin +1

In a function that takes its inputs from various players, the effect of a player measures the variation he can cause in the expectation of that function. In this paper we prove a t…

math.PR2007

When Do Random Subsets Decompose a Finite Group?

Ariel Yadin

Let A,B be two random subsets of a finite group G. We consider the event that the products of elements from A and B span the whole group; i.e. (AB union BA) = G. The study of this…

math.PR20071 cited

Long Range Percolation Mixing Time

Itai Benjamini, Noam Berger, Ariel Yadin

We provide an estimate, sharp up to poly-logarithmic factors, of the asymptotically almost sure mixing time of the graph created by long-range percolation on the cycle of length N…

math.PR200711 cited

Diffusion Limited Aggregation on a Cylinder

Itai Benjamini, Ariel Yadin

We consider the DLA process on a cylinder G x N. It is shown that this process "grows arms", provided that the base graph G has small enough mixing time. Specifically, if the mixin…

math.PR2006

Random Graph-Homomorphisms and Logarithmic Degree

Itai Benjamini, Ariel Yadin, Amir Yehudayoff

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of…

math.PR2005

Rate of Escape of the Mixer Chain

Ariel Yadin

The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph,…