相关论文: On some properties of contracting matrices

It is proved recently by Benamara-Nikolski that a contraction having finite defects and spectrum not filling in the closed unit disc, is similar to a normal operator if and only if it has the so-called linear resolvent growth property. We…

With the growth of magnitude of multi-agent networks, distributed optimization holds considerable significance within complex systems. Convergence, a pivotal goal in this domain, is contingent upon the analysis of infinite products of…

The self-concordant-like property of a smooth convex function is a new analytical structure that generalizes the self-concordant notion. While a wide variety of important applications feature the self-concordant-like property, this concept…

Sequential quadratic optimization algorithms are proposed for solving smooth nonlinear optimization problems with equality constraints. The main focus is an algorithm proposed for the case when the constraint functions are deterministic,…

For topological dynamical systems defined by continuous self-maps of compact metric spaces, we consider the contractive shadowing property, i.e., the Lipschitz shadowing property such that the Lipschitz constant is less than 1. We prove…

Networks with nodes embedded in a metric space have gained increasing interest in recent years. The effects of spatial embedding on the networks' structural characteristics, however, are rarely taken into account when studying their…

In this paper we develop and apply methods for the spectral analysis of non-self-adjoint tridiagonal infinite and finite random matrices, and for the spectral analysis of analogous deterministic matrices which are pseudo-ergodic in the…

In this work we study symmetric random matrices with variance profile satisfying certain conditions. We establish the convergence of the operator norm of these matrices to the largest element of the support of the limiting empirical…

In this article, we focus on extending the notion of lattice linearity to self-stabilizing programs. Lattice linearity allows a node to execute its actions with old information about the state of other nodes and still preserve correctness.…

This paper studies linear stochastic approximation (SA) algorithms and their application to multi-agent systems in engineering and sociology. As main contribution, we provide necessary and sufficient conditions for convergence of linear SA…

We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…

Matrix sketching is a recently developed data compression technique. An input matrix A is efficiently approximated with a smaller matrix B, so that B preserves most of the properties of A up to some guaranteed approximation ratio. In so…

Stochastic models share many characteristics with generic parametric models. In some ways they can be regarded as a special case. But for stochastic models there is a notion of weak distribution or generalised random variable, and the same…

A popular approach to semi-supervised learning proceeds by endowing the input data with a graph structure in order to extract geometric information and incorporate it into a Bayesian framework. We introduce new theory that gives appropriate…

The synchronization behavior of delay coupled chaotic smooth unimodal maps over a ring network with stochastic switching of links at every time step is reported in this paper. It is observed that spatiotemporal synchronization never appears…

The paper presents advancement of the matrix structural analysis technique (MSA) for stiffness modeling of robotic manipulators. In contrast to the classical MSA, it can be applied to both parallel and serial manipulators composed of…

Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…

We develop a pseudo-differential approach to the N=2 supersymmetric unconstrained matrix (k|n,m)-Generalized Nonlinear Schroedinger hierarchies and prove consistency of the corresponding Lax-pair representation (nlin.SI/0201026).…

This paper presents a framework for the study of convergence when the nodes' dynamics may be both piecewise smooth and/or nonidentical across the network. Specifically, we derive sufficient conditions for global convergence of all node…

In this thesis we study synchronization phenomena in natural and artificial coupled multi-component systems, applicable to the scalability of parallel discrete-event simulation for systems with asynchronous dynamics. We analyze the…