Related papers: Proving the Herman-Protocol Conjecture
In the field of distributed consensus and blockchains, the synchronous communication model assumes that all messages between honest parties are delayed at most by a known constant $\Delta$. Recent literature establishes that the…
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than strongly fair scheduler or for system topologies with maximum…
In this manuscript, we address open questions raised by Dieker \& Yakir (2014), who proposed a novel method of estimation of (discrete) Pickands constants $\mathcal{H}^\delta_\alpha$ using a family of estimators $\xi^\delta_\alpha(T), T>0$,…
In this paper, we propose a suboptimal moving horizon estimator for a general class of nonlinear systems. For the stability analysis, we transfer the "feasibility-implies-stability/robustness" paradigm from model predictive control to the…
Hamiltonian Monte Carlo (HMC) algorithms which combine numerical approximation of Hamiltonian dynamics on finite intervals with stochastic refreshment and Metropolis correction are popular sampling schemes, but it is known that they may…
The numerical approximation of an inverse problem subject to the convection--diffusion equation when diffusion dominates is studied. We derive Carleman estimates that are on a form suitable for use in numerical analysis and with explicit…
A long-standing problem in the foundations of quantum mechanics is to identify a physical principle that explains why algebraically maximal violations of Bell inequalities can generally not be achieved in Nature. One recently proposed…
Consider the problem of predicting the next symbol given a sample path of length n, whose joint distribution belongs to a distribution class that may have long-term memory. The goal is to compete with the conditional predictor that knows…
The problem of optimal stopping with finite horizon in discrete time is considered in view of maximizing the expected gain. The algorithm proposed in this paper is completely nonparametric in the sense that it uses observed data from the…
An optimal control for a dynamical system optimizes a certain objective function. Here we consider the construction of an optimal control for a stochastic dynamical system with a random structure, Poisson perturbations and random jumps,…
Population protocols are networks of finite-state agents, interacting randomly, and updating their states using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational…
We introduce an arbitrary order, stabilized finite element method for solving a unique continuation problem subject to the time-harmonic elastic wave equation with variable coefficients. Based on conditional stability estimates we prove…
Most experimental protocols for measuring scrambling require time evolution with a Hamiltonian and with the Hamiltonian's negative counterpart (backwards time evolution). Engineering controllable quantum many-body systems for which such…
The construction of confidence intervals for the mean of a bounded random variable is a classical problem in statistics with numerous applications in machine learning and virtually all scientific fields. In particular, obtaining the…
The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\Theta(n \log n)$ steps in the average case (with $n$ women and $n$ men). In 1976, Knuth…
While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer…
In these lectures notes, we review our recent works addressing various problems of finding the nearest stable system to an unstable one. After the introduction, we provide some preliminary background, namely, defining Port-Hamiltonian…
In this paper we consider the existence of Hamilton cycles in the random graph $G=G_{n,m}^{\delta\geq 3}$. This a random graph chosen uniformly from the set of graphs with vertex set $[n]$, $m$ edges and minimum degree at least 3. Our…
It is a common phenomenon in nature and technology that a system under perturbations exits a regime of its usual dynamics. Often it is possible to define a potential function whereby a potential well can be associated with a usual or…
This paper considers a disturbance attenuation problem for a linear discrete time invariant system under random disturbances with imprecisely known probability distributions. The statistical uncertainty is measured in terms of relative…