Related papers: Online minimum search for a Brownian bridge
We derive general results on the small deviation behavior for some classes of iterated processes. This allows us, in particular, to calculate the rate of the small deviations for $n$-iterated Brownian motions and, more generally, for the…
We verify a recent conjecture of Sehrawat, Kumar and Ahlawat on the minimum bisection width (a notion that was rediscovered in 2020 by Acharya and Kureethara under the name of rna number) of powers of cycles.
The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…
Let \ell be the projected intersection local time of two independent Brownian paths in R^d for d=2,3. We determine the lower tail of the random variable \ell(U), where U is the unit ball. The answer is given in terms of intersection…
We continue to study the squared Frobenius norm of a submatrix of a $n \times n$ random unitary matrix. When the choice of the submatrix is deterministic and its size is $[ns] \times [nt]$, we proved in a previous paper that, after…
We propose and test a method to interpolate sparsely sampled signals by a stochastic process with a broad range of spatial and/or temporal scales. To this end, we extend the notion of a fractional Brownian bridge, defined as fractional…
Minimum Bayes risk (MBR) decoding is a decision rule of text generation tasks that outperforms conventional maximum a posterior (MAP) decoding using beam search by selecting high-quality outputs based on a utility function rather than those…
In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.
We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
In this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min-$k$-planar if, for every crossing in the drawing, at least one of the two crossing edges involves at…
We consider a fractional Brownian motion with unknown linear drift such that the drift coefficient has a prior normal distribution and construct a sequential test for the hypothesis that the drift is positive versus the alternative that it…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a neighbor in the other set. We are interested in giving…
Experimental data from Dunfield et al using random grid diagrams suggests that the genus of a knot grows linearly with respect to the crossing number. Using billiard table diagrams of Chebyshev knots developed by Koseleff and Pecker and a…
We give the bridge indices for 11-crossing prime knots and give a minimal bridge projection for each of these knots. The results on the indices may be easily summarized: all of these knots that are not rational knots or Montesinos knots…
We show that in Euclidean field theories that have bounce solutions, the bounce with the least action is the global minimum of the action in an open space of field configurations. A rigorous upper bound on the minimal bounce action can…
Motivated by modern machine learning applications where we only have access to empirical measures constructed from finite samples, we relax the marginal constraints of the classical Schr\"odinger bridge problem by penalizing the transport…
We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…
A collection of graphs is called bridge-alterable if, for each graph G with a bridge e, G is in the class if and only if G-e is. For example the class of forests is bridge-alterable. For a random forest $F_n$ sampled uniformly from the set…
Effective bounds on the union probability are well known to be beneficial in the analysis of stochastic problems in many areas, including probability theory, information theory, statistical communications, computing and operations research.…