#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2005

2017

- This year (0)
- Last 5 years (4)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Itai Benjamini, Noam Berger, Ariel Yadin
- Combinatorics, Probability & Computing
- 2008

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 (Z/NZ). While it is… (More)

Abstract Let U (N) denote the maximal length of arithmetic progressions in a random uniform subset of {0, 1} . By an application of the Chen-Stein method, we show that U (N) − 2 log N/ log 2… (More)

- Ronen Gradwohl, Omer Reingold, Ariel Yadin, Amir Yehudayoff
- Math. Oper. Res.
- 2009

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 tight upper bound on… (More)

- Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin
- ArXiv
- 2009

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power… (More)

- Itai Benjamini, Hugo Duminil-Copin, Gady Kozma, Ariel Yadin
- 2015

We study harmonic functions on random environments with particular emphasis on the case of the infinite cluster of supercritical percolation on Z. We prove that the vector space of harmonic functions… (More)

Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on Z2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs… (More)

- Hugo Duminil-Copin, C. Lucas, Ariel Yadin, Amir Yehudayoff
- 2013

Internal Diffusion Limited Aggregation (IDLA) is a model that describes the growth of a random aggregate of particles from the inside out. Shellef proved that IDLA processes on supercritical… (More)

- Ron Peled, Ariel Yadin, Amir Yehudayoff
- Random Struct. Algorithms
- 2011

A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical… (More)

We consider the DLA process on a cylinder G × N. It is shown that this process “grows arms”, provided that the base graph G has small enough mixing time. Specifically, if the mixing time of G is at… (More)

- Ariel Yadin
- 2008

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 ∪ BA = G}. The study of this event gives rise to a… (More)