1.5k citations
- Tel Aviv UniversityIL8 papers
- University of California, BerkeleyUS4 papers
- Bar-Ilan UniversityIL3 papers
- Harvard UniversityUS3 papers
- Karlsruhe Institute of TechnologyDE3 papers
- Microsoft (United States)US3 papers
- Ben-Gurion University of the NegevIL2 papers
- Institute for Advanced StudyUS2 papers
- Pennsylvania State UniversityUS2 papers
- University of TorontoCA2 papers
- University of WashingtonUS2 papers
- Yale UniversityUS2 papers
17 papers · 1 filter
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…
Pursuit-Evasion Games with Incomplete Information in Discrete Time
Ori Gurel-Gurevich
Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show tha…
Excited random walk against a wall
Gideon Amir, Itai Benjamini, Gady Kozma
We analyze random walk in the upper half of a three dimensional lattice which goes down whenever it encounters a new vertex, a.k.a. excited random walk. We show that it is recurren…
The scaling limit of loop-erased random walk in three dimensions
Gady Kozma
We show that the scaling limit exists and is invariant to dilations and rotations. We give some tools that might be useful to show universality.
On a role of predictor in the filtering stability
P. Chigansky, R. Liptser
When is a nonlinear filter stable with respect to its initial condition? In spite of the recent progress, this question still lacks a complete answer in general. Currently availabl…
Stability of the nonlinear filter for slowly switching Markov chains
P. Chigansky
Exponential stability of the nonlinear filtering equation is revisited, when the signal is a finite state Markov chain. An asymptotic upper bound for the filtering error due to inc…