skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Polynomial control on stability, inversion and powers of matrices on simple graphs
Spatially distributed networks of large size arise in a variety of science and engineering problems, such as wireless sensor networks and smart power grids. Most of their features can be described by properties of their state-space matrices whose entries have indices in the vertex set of a graph. In this paper, we introduce novel algebras of Beurling type that contain matrices on a connected simple graph having polynomial off-diagonal decay, and we show that they are Banach subalgebras of the space of all bounded operators on the space of all p-summable sequences. The $$\ell^p$$-stability of state-space matrices is an essential hypothesis for the robustness of spatially distributed networks. In this paper, we establish the equivalence among -stabilities of matrices in Beurling algebras for different exponents $$p$$, with quantitative analysis for the lower stability bounds. Admission of norm-control inversion plays a crucial role in some engineering practice. In this paper, we prove that matrices in Beurling subalgebras of have norm-controlled inversion and we find a norm-controlled polynomial with close to optimal degree. Polynomial estimate to powers of matrices is important for numerical implementation of spatially distributed networks. In this paper, we apply our results on norm-controlled inversion to obtain a polynomial estimate to powers of matrices in Beurling algebras. The polynomial estimate is a noncommutative extension about convolution powers of a complex function and is applicable to estimate the probability of hopping from one agent to another agent in a stationary Markov chain on a spatially distributed network.  more » « less
Award ID(s):
1816313
PAR ID:
10131404
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of functional analysis
Volume:
276
Issue:
1
ISSN:
0022-1236
Page Range / eLocation ID:
148-182
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Journal of the London Mathematical Society)
    Abstract We describe a connection between the subjects of cluster algebras, polynomial identity algebras, and discriminants. For this, we define the notion of root of unity quantum cluster algebras and prove that they are polynomial identity algebras. Inside each such algebra we construct a (large) canonical central subalgebra, which can be viewed as a far reaching generalization of the central subalgebras of big quantum groups constructed by De Concini, Kac, and Procesi and used in representation theory. Each such central subalgebra is proved to be isomorphic to the underlying classical cluster algebra of geometric type. When the root of unity quantum cluster algebra is free over its central subalgebra, we prove that the discriminant of the pair is a product of powers of the frozen variables times an integer. An extension of this result is also proved for the discriminants of all subalgebras generated by the cluster variables of nerves in the exchange graph. These results can be used for the effective computation of discriminants. As an application we obtain an explicit formula for the discriminant of the integral form over of each quantum unipotent cell of De Concini, Kac, and Procesi for arbitrary symmetrizable Kac–Moody algebras, where is a root of unity. 
    more » « less
  2. ; ; ; (, Proceeding of SampTA 2019)
    In this paper, we consider the inverse graph filtering process when the original filter is a polynomial of some graph shift on a simple connected graph. The Chebyshev polynomial approximation of high order has been widely used to approximate the inverse filter. In this paper, we propose an iterative Chebyshev polynomial approximation (ICPA) algorithm to implement the inverse filtering procedure, which is feasible to eliminate the restoration error even using Chebyshev polynomial approximation of lower order. We also provide a detailed convergence analysis for the ICPA algorithm and a distributed implementation of the ICPA algorithm on a spatially distributed network. Numerical results are included to demonstrate the satisfactory performance of the ICPA algorithm in graph signal denoising. 
    more » « less
  3. ; (, Groups, Geometry, and Dynamics)
    We completely classify the Cartan subalgebras in all von Neumann algebras associated with graph product groups and their free ergodic measure preserving actions on probability spaces. 
    more » « less
  4. ; ; (, Applied and computational harmonic analysis)
    A spatially distributed network contains a large amount of agents with limited sensing, data processing, and communication capabilities. Recent technological advances have opened up possibilities to deploy spatially distributed networks for signal sampling and reconstruction. In this paper, we introduce a graph structure for a distributed sampling and reconstruction system by coupling agents in a spatially distributed network with innovative positions of signals. A fundamental problem in sampling theory is the robustness of signal reconstruction in the presence of sampling noises. For a distributed sampling and reconstruction system, the robustness could be reduced to the stability of its sensing matrix. In this paper, we split a distributed sampling and reconstruction system into a family of overlapping smaller subsystems, and we show that the stability of the sensing matrix holds if and only if its quasi-restrictions to those subsystems have uniform stability. This new stability criterion could be pivotal for the design of a robust distributed sampling and reconstruction system against supplement, replacement and impairment of agents, as we only need to check the uniform stability of affected subsystems. In this paper, we also propose an exponentially convergent distributed algorithm for signal reconstruction, that provides a suboptimal approximation to the original signal in the presence of bounded sampling noises. 
    more » « less
  5. ; ; ; ; ; (, Association for Women in Mathematics series)
    Miller, Claudia; Striuli, Janet; Witt, Emily (Ed.)
    We generalize Buchsbaum and Eisenbud’s resolutions for the powers of the maximal ideal of a polynomial ring to resolve powers of the homogeneous maximal ideal over graded Koszul algebras. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email