5 papers
Multi-layered planar firefighting
Arye Deutch, Ohad Noy Feldheim, Rani Hod
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 fi…
Load balancing under -thinning
Ohad N. Feldheim, Jiange Li
In the classical balls-and-bins model, balls are allocated into bins one by one uniformly at random. In this note, we consider the -thinning variant of this model, in wh…
Drawing outerplanar graphs using thirteen edge lengths
Ziv Bakhajian, Ohad N. Feldheim
We show that every outerplanar graph can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and…
Convergence of the Quantile Admission Process with Veto Power
Naomi Feldheim, Ohad Noy Feldheim
The quantile admission process with veto power is a stochastic processes suggested by Alon, Feldman, Mansour, Oren and Tennenholtz as a model for the evolution of an exclusive soci…
The power of thinning in balanced allocation
Ohad N. Feldheim, Ori Gurel-Gurevich
Balls are sequentially allocated into bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball…