21 citations · 57 across the 19 of their papers we have counts for
28 papers
Persistence and entropic repulsion of stationary Gaussian fields with spectral singularity at the origin
Naomi Feldheim, Ohad Feldheim, Stephen Muirhead
We compute the exact log-asymptotics of the persistence probability, and determine the entropic repulsion profile conditioned on persistence, for general -dimensional stationary…
Limiting Root Distribution of Random Log-concave Polynomials
Ohad Noy Feldheim, Arnab Sen
Log-concave polynomials arise naturally in combinatorics, geometry, and probability. We introduce a natural family of random log-concave polynomials and study their limiting root d…
The Containment Game in the plane: between the Firefighter Problem and Conway's Angel Problem
Ohad Noy Feldheim, Itamar Israeli
The containment game is a full information game for two players, initialised with a set of occupied vertices in an infinite connected graph . On the -th turn, the first playe…
A sharp transition in zero overcrowding and undercrowding probabilities for Stationary Gaussian Processes
Naomi Feldheim, Ohad Feldheim, Lakshmi Priya
We study the probability that a real stationary Gaussian process has at least zeros in (overcrowding), or at most this number (undercrowding). We show that if the spec…
Min-cost-flow preserving bijection between subgraphs and orientations
Izhak Elmaleh, Ohad N. Feldheim
Consider an undirected graph . A subgraph of is a subset of its edges, whilst an orientation of is an assignment of a direction to each edge. Provided with an inte…
Long-term balanced allocation via thinning
Ohad N. Feldheim, Ori Gurel-Gurevich, Jiange Li
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 ball…
The Power of Two Choices in Graphical Allocation
Nikhil Bansal, Ohad Feldheim
The graphical balls-into-bins process is a generalization of the classical 2-choice balls-into-bins process, where the bins correspond to vertices of an arbitrary underlying graph…
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…
The umpteen operator and its Lifshitz tails
Ohad N. Feldheim, Sasha Sodin
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ô…
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…
On the probability that a stationary Gaussian process with spectral gap remains non-negative on a long interval
Naomi Feldheim, Ohad Feldheim, Benjamin Jaye +2
Let be a zero-mean continuous stationary Gaussian process on whose spectral measure vanishes in a -neighborhood of the origin. Then the probability that st…
Persistence of Gaussian stationary processes: a spectral perspective
Naomi Feldheim, Ohad Feldheim, Shahaf Nitzan
We study the persistence probability of a centered stationary Gaussian process on or , that is, its probability to remain positive for a long time. We desc…
The growth constant of odd cutsets in high dimensions
Ohad Noy Feldheim, Yinon Spinka
A cutset is a non-empty finite subset of which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\math…
Mean and Minimum of Independent Random Variables
Naomi Dvora Feldheim, Ohad Noy Feldheim
We show that any pair of independent, non-compactly supported random variables on satisfies . We…
The power of online thinning in reducing discrepancy
Raaz Dwivedi, Ohad N. Feldheim, Ori Gurel-Gurevich +1
Consider an infinite sequence of independent, uniformly chosen points from . After looking at each point in the sequence, an overseer is allowed to either keep it or rejec…
Double roots of random polynomials with integer coefficients
Ohad N. Feldheim, Arnab Sen
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…
Long-range order in the 3-state antiferromagnetic Potts model in high dimensions
Ohad Feldheim, Yinon Spinka
We prove the existence of long-range order for the 3-state Potts antiferromagnet at low temperature on for sufficiently large . In particular, we show the existen…
Monotonicity of Avoidance Coupling on
Ohad Noy Feldheim
Answering a question by Angel, Holroyd, Martin, Wilson and Winkler, we show that the maximal number of non-colliding coupled simple random walks on the complete graph , which…
A note on general sliding window processes
Noga Alon, Ohad N. Feldheim
Let be a measurable function, and let be a sequence of i.i.d. random variables. Consider the random process $Z_i=f(U_{i},.…
Rigidity of 3-colorings of the discrete torus
Ohad N. Feldheim, Ron Peled
We prove that a uniformly chosen proper -coloring of the -dimensional discrete torus has a very rigid structure when the dimension is sufficiently high. We show that with…
Long gaps between sign-changes of Gaussian Stationary Processes
Naomi D. Feldheim, Ohad N. Feldheim
We study the probability of a real-valued stationary process to be positive on a large interval . We show that if in some neighborhood of the origin the spectral measure of…