This paper deals with the design and analysis of dynamical systems on directed graphs (digraphs) that achieve weight-balanced and doubly stochastic assignments. Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of coordination problems, including formation control, agreement, and distributed optimization. We refer to a digraph as...

Motivated by the applications in routing in data centers, we study the problem of expressing an n × n doubly stochastic matrix as a linear combination using the smallest number of (sub)permutation matrices. The Birkhoff-von Neumann decomposition theorem proves that there exists such a decomposition, but does not give a representation with the smallest number of permutation matrices. In particul...

Correspondence of features between two or more images obtained from different views of the same object is still a challenging problem in vision. In many applications, these two views are part of a larger video sequence. The aim of this paper is to show that the original video data contains enough information (referred to as prior information) to design a robust correspondence algorithm. A doubl...

Data association is one of the fundamental problems in multi-sensor systems. Most current techniques rely on pairwise data associations which can be spurious even after the employment of outlier rejection schemes. Considering multiple pairwise associations at once significantly increases accuracy and leads to consistency. In this work, we propose two fully decentralized methods for consistent g...

‎In this paper, we study some kinds of majorizations on $textbf{M}_{n}$ and their linear or strong linear preservers. Also, we find the structure of linear or strong linear preservers which are multiplicative, i.e.  linear or strong linear preservers like $Phi $ with the property $Phi (AB)=Phi (A)Phi (B)$ for every $A,Bin textbf{M}_{n}$.

Finite simple, unipotent Bol loops have recently been identified and constructed using group theory. However, the purely group-theoretical constructions of the actual loops are indirect, somewhat arbitrary in places, and rely on computer calculations to a certain extent. In the spirit of revisionism, this paper is intended to give a more explicit combinatorial specification of the smallest simp...

Let p be a homogeneous polynomial of degree n in n variables, p(z1, . . . , zn) = p(Z), Z ∈ C. We call such a polynomial p H-Stable if p(z1, . . . , zn) 6= 0 provided the real parts Re(zi) > 0, 1 ≤ i ≤ n. This notion from Control Theory is closely related to the notion of Hyperbolicity used intensively in the PDE theory. The main theorem in this paper states that if p(x1, . . . , xn) is a homog...

The characteristic functional (c.fl.) of a doubly stochastic Poisson process (DSPP) is studied and it provides us the finite dimensional distributions of the process and so its moments. It is also studied the case of a DSPP which intensity is a narrow-band process. The Karhunen–Loève expansion of its intensity is used to obtain the probability distribution function and a decomposition of this P...

To address different uncertainties associated with patient recruitment in multicentre clinical trials a mixed Poisson model is elaborated (patients arrive at different clinical centres according to delayed doubly stochastic Poisson processes with gamma distributed rates). Analytic approach to modeling and predicting the recruitment at the initial and ongoing stages is suggested. A Bayesian appr...