Related papers: Proving the Herman-Protocol Conjecture
This paper presents a safe stabilization of the Stefan PDE model with a moving boundary governed by a high-order dynamics. We consider a parabolic PDE with a time-varying domain governed by a second-order response with respect to the…
We study lower bounds for Locality Sensitive Hashing (LSH) in the strongest setting: point sets in {0,1}^d under the Hamming distance. Recall that here H is said to be an (r, cr, p, q)-sensitive hash family if all pairs x, y in {0,1}^d with…
This paper presents a randomized self-stabilizing algorithm that elects a leader $r$ in a general $n$-node undirected graph and constructs a spanning tree $T$ rooted at $r$. The algorithm works under the synchronous message passing network…
This article is concerned with stability and performance of controlled stochastic processes under receding horizon policies. We carry out a systematic study of methods to guarantee stability under receding horizon policies via appropriate…
In this paper, we introduce regularized stochastic team problems. Under mild assumptions, we prove that there exists an unique fixed point of the best response operator, where this unique fixed point is the optimal regularized team decision…
In this paper, we address the efficient implementation of moving horizon state estimation of constrained discrete-time linear systems. We propose a novel iteration scheme which employs a proximity-based formulation of the underlying…
In this paper, a linear second order numerical scheme is developed and investigated for the Allen-Cahn equation with a general positive mobility. In particular, our fully discrete scheme is mainly constructed based on the Crank-Nicolson…
In the Contention Resolution problem $n$ parties each wish to have exclusive use of a shared resource for one unit of time. The problem has been studied since the early 1970s, under a variety of assumptions on feedback given to the parties,…
We introduce a novel framework for the stability analysis of discrete-time linear switching systems with switching sequences constrained by an automaton. The key element of the framework is the algebraic concept of multinorm, which…
Metzler matrices play a crucial role in positive linear dynamical systems. Finding the closest stable Metzler matrix to an unstable one (and vice versa) is an important issue with many applications. The stability considered here is in the…
The paper addresses state estimation for linear discrete-time systems with binary (threshold) measurements. A Moving Horizon Estimation (MHE) approach is followed and different estimators, characterized by two different choices of the cost…
In this paper we study the inefficiency ratio of stable equilibria in load balancing games introduced by Asadpour and Saberi [3]. We prove tighter lower and upper bounds of 7/6 and 4/3, respectively. This improves over the best known bounds…
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…
Optimal error estimates of stable and stabilized Lagrange-Galerkin (LG) schemes for natural convection problems are proved under a mild condition on time increment and mesh size. The schemes maintain the common advantages of the LG method,…
The sharpest known high probability generalization bounds for uniformly stable algorithms (Feldman, Vondr\'{a}k, 2018, 2019), (Bousquet, Klochkov, Zhivotovskiy, 2020) contain a generally inevitable sampling error term of order…
In this work, we summarize the linearization method to study the Heisenberg Uncertainty Principles, and explain that the same approach can be used to handle the stability problem. As examples of application, combining with spherical…
In this work, we show that for all statistical estimation problems, a natural MMSE instability (discontinuity) condition implies the failure of stable algorithms, serving as a version of OGP for estimation tasks. Using this criterion, we…
In this work we propose a novel Hybrid High-Order method for the incompressible Navier--Stokes equations based on a formulation of the convective term including Temam's device for stability. The proposed method has several advantageous…
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine…
The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case…