Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Hod, Rani"'
Consider a model of fire spreading through a graph; initially some vertices are burning, and at every given time-step fire spreads from burning vertices to their neighbours. The firefighter problem is a solitaire game in which a player is allowed, at
Externí odkaz:
http://arxiv.org/abs/2105.03759
In the $\left(1:b\right)$ component game played on a graph $G$, two players, Maker and Breaker, alternately claim~$1$ and~$b$ previously unclaimed edges of $G$, respectively. Maker's aim is to maximise the size of a largest connected component in her
Externí odkaz:
http://arxiv.org/abs/2012.08821
Publikováno v:
In Discrete Mathematics December 2022 345(12)
Autor:
Hod, Rani
Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this representation: the en
Externí odkaz:
http://arxiv.org/abs/1711.00762
Autor:
Bar-On, Achiya, Dinur, Itai, Dunkelman, Orr, Hod, Rani, Keller, Nathan, Ronen, Eyal, Shamir, Adi
The problem of online checkpointing is a classical problem with numerous applications which had been studied in various forms for almost 50 years. In the simplest version of this problem, a user has to maintain $k$ memorized checkpoints during a long
Externí odkaz:
http://arxiv.org/abs/1704.02659
We study novel variations of Voronoi games and associated random processes that we call Voronoi choice games. These games provide a rich framework for studying questions regarding the power of small numbers of choices in multi-player, competitive sce
Externí odkaz:
http://arxiv.org/abs/1604.07084
Publikováno v:
Combinator. Probab. Comp. 25 (2016) 1-20
Given a property of Boolean functions, what is the minimum number of queries required to determine with high probability if an input function satisfies this property or is "far" from satisfying it? This is a fundamental question in Property Testing,
Externí odkaz:
http://arxiv.org/abs/1307.7364
Let $n$, $k$, and $t$ be integers satisfying $n>k>t\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An outstanding prob
Externí odkaz:
http://arxiv.org/abs/1303.4065
Autor:
Hod, Rani, Naor, Alon
We study the (1:b) Maker-Breaker component game, played on the edge set of a d-regular graph. Maker's aim in this game is to build a large connected component, while Breaker's aim is to not let him do so. For all values of Breaker's bias b, we determ
Externí odkaz:
http://arxiv.org/abs/1301.0282
Autor:
Hod, Rani, Krzywkowski, Marcin
Publikováno v:
Electronic J. Combinatorics 19 (2012) P30
A team of players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his or her own hat color by looking at the hat
Externí odkaz:
http://arxiv.org/abs/1006.1587