Zobrazeno 1 - 10
of 1 787
pro vyhledávání: '"Ohad, N."'
Autor:
Elmaleh, Izhak, Feldheim, Ohad N.
Consider an undirected graph $G=(V,E)$. A subgraph of $G$ is a subset of its edges, whilst an orientation of $G$ is an assignment of a direction to each edge. Provided with an integer circulation-demand $d:V\to \mathbb{Z}$, we show an explicit and ef
Externí odkaz:
http://arxiv.org/abs/2112.09250
Publikováno v:
Ann. Appl. Probab, 34 (1A), 795-850, 2024
We study the long-term behavior of the two-thinning variant of the classical balls-and-bins model. In this model, an overseer is provided with uniform random allocation of $m$ balls into $n$ bins in an on-line fashion. For each ball, the overseer cou
Externí odkaz:
http://arxiv.org/abs/2110.05009
Autor:
Feldheim, Ohad N., Sodin, Sasha
As put forth by Kerov in the early 1990s and elucidated in subsequent works, numerous properties of Wigner random matrices are shared by certain linear maps playing an important r\^ole in the representation theory of the symmetric group. We introduce
Externí odkaz:
http://arxiv.org/abs/2010.01552
Autor:
Feldheim, Ohad N., Li, Jiange
Publikováno v:
Electron. Commun. Probab. 25 (2020), no. 1, 1-13
In the classical balls-and-bins model, $m$ balls are allocated into $n$ bins one by one uniformly at random. In this note, we consider the $d$-thinning variant of this model, in which the process is regulated in an on-line fashion as follows. For eac
Externí odkaz:
http://arxiv.org/abs/1908.10278
Autor:
Bakhajian, Ziv, Feldheim, Ohad N.
We show that every outerplanar graph $G$ can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and that of an
Externí odkaz:
http://arxiv.org/abs/1907.13104
Autor:
Feldheim, Ohad N., Gurel-Gurevich, Ori
Balls are sequentially allocated into $n$ bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new independent unifo
Externí odkaz:
http://arxiv.org/abs/1807.01132
Consider an infinite sequence of independent, uniformly chosen points from $[0,1]^d$. After looking at each point in the sequence, an overseer is allowed to either keep it or reject it, and this choice may depend on the locations of all previously ke
Externí odkaz:
http://arxiv.org/abs/1608.02895
Autor:
Feldheim, Ohad N., Sen, Arnab
Publikováno v:
Electronic Jounral of Probability 22 (2017), paper No. 10
We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most $\tfrac12$, t
Externí odkaz:
http://arxiv.org/abs/1603.03811
Autor:
Alon, Noga, Feldheim, Ohad N.
Publikováno v:
Electron. Commun. Probab 19 (2014): 1-7
Let $f:\mathbb{R}^k\to \mathbb{R}$ be a measurable function, and let $\{U_i\}_{i\in\mathbb{N}}$ be a sequence of i.i.d. random variables. Consider the random process $Z_i=f(U_{i},...,U_{i+k-1})$. We show that for all $\ell$, there is a positive proba
Externí odkaz:
http://arxiv.org/abs/1402.1975
Autor:
Feldheim, Ohad N., Peled, Ron
We prove that a uniformly chosen proper $3$-coloring of the $d$-dimensional discrete torus has a very rigid structure when the dimension $d$ is sufficiently high. We show that with high probability the coloring takes just one color on almost all of e
Externí odkaz:
http://arxiv.org/abs/1309.2340