Related papers: Branch points and stability
We study formation control problems. Our approach is to let a group of systems maximize their pairwise distances whilst bringing them all to a given submanifold, determining the shape of the formation. The algorithm we propose allows to…
We extend the pre-image representation of exposed points of the numerical range of a matrix to all extreme points. With that we characterize extreme points which are multiply generated, having at least two linearly independent pre-images,…
The first part of the paper studies a class of optimal control problems in Bolza form, where the dynamics is linear w.r.t.~the control function. A necessary condition is derived, for the optimality of a trajectory which starts at a…
We consider the directed Hausdorff distance between point sets in the plane, where one or both point sets consist of imprecise points. An imprecise point is modelled by a disc given by its centre and a radius. The actual position of an…
We consider the problem of succinctly encoding a static map to support approximate queries. We derive upper and lower bounds on the space requirements in terms of the error rate and the entropy of the distribution of values over keys: our…
This paper introduces some tools from graph theory and distributed consensus algorithms to construct an optimal, yet robust, hierarchical information sharing structure for large-scale decision making and control problems. The proposed…
We present new stochastic geometry theorems that give bounds on the probability that $m$ random data classes all contain a point in common in their convex hulls. We apply these stochastic separation theorems to obtain bounds on the…
This paper is concerned with Bayesian inferential methods for data from controlled branching processes that account for model robustness through the use of disparities. Under regularity conditions, we establish that estimators built on…
The Switch Point Algorithm is a new approach for solving optimal control problems whose solutions are either singular or bang-bang or both singular and bang-bang, and which possess a finite number of jump discontinuities in an optimal…
Our work explores fusions, the multidimensional counterparts of mean-preserving contractions and their extreme and exposed points. We reveal an elegant geometric/combinatorial structure for these objects. Of particular note is the…
Bayesian change-point detection, together with latent variable models, allows to perform segmentation over high-dimensional time-series. We assume that change-points lie on a lower-dimensional manifold where we aim to infer subsets of…
The paper is concerned with an optimal control problem on $\mathbb{R}^n$, where the dynamics is linear w.r.t.~the control functions. For a terminal cost $\psi$ in a $mathcal{G}_\delta$ set of $\mathcal{C}^4(\mathbb{R}^n)$ (i.e., in a…
Given two orthornormal bases A and B, the basic form of the entropic uncertainty principle is stated in terms of the sum of the Shannon entropies of the probabilities of measuring A and B onto a given quantum state. State independent lower…
The concept of equilibrium is a general tool to fill the gap between macroscopic and mesoscopic information, both within kinetic systems and kinetic schemes. This work explores the use of equilibria to devise numerical boundary conditions…
There are some papers which describe the use of bootstrap techniques in point process statistics. The aim of the present paper is to show that the form in which bootstrap is used there is dubious. In case of variance estimation of pair…
We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…
While branching network structures abound in nature, their objective analysis is more difficult than expected because existing quantitative methods often rely on the subjective judgment of branch structures. This problem is particularly…
Network-theoretic tools contribute to understanding real-world system dynamics, e.g., in wildlife conservation, epidemics, and power outages. Network visualization helps illustrate structural heterogeneity; however, details about…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
For Gamma a finite, connected metric graph, we consider the space of configurations of n points in Gamma with a restraint parameter r dictating the minimum distance allowed between each pair of points. These restricted configuration spaces…