CaltechAUTHORS
  A Caltech Library Service

Node-Asynchronous Spectral Clustering On Directed Graphs

Teke, Oguzhan and Vaidyanathan, P. P. (2020) Node-Asynchronous Spectral Clustering On Directed Graphs. In: 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE , Piscataway, NJ, pp. 5325-5329. ISBN 9781509066315. https://resolver.caltech.edu/CaltechAUTHORS:20200417-140311291

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20200417-140311291

Abstract

In recent years the convergence behavior of random node asynchronous graph communications have been studied for the case of undirected graphs. This paper extends these results to the case of graphs having arbitrary directed edges possibly with a nondiagonalizable adjacency matrix. Assuming that the graph operator has eigenvalue 1 and the input signal satisfies a certain condition (which ensures the existence of fixed points), this study presents the necessary and sufficient condition for the mean-squared convergence of the graph signal. The presented condition depends on the graph operator as well as the update probabilities, and the convergence of the randomized asynchronous updates may be achieved even when the underlying operator is not stable in the synchronous setting. As an application, the node-asynchronous updates are combined with polynomial filtering in order to obtain a spectral clustering for directed networks. The convergence is also verified with numerical simulations.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ICASSP40776.2020.9054241DOIArticle
ORCID:
AuthorORCID
Teke, Oguzhan0000-0002-1131-5206
Vaidyanathan, P. P.0000-0003-3003-7042
Additional Information:© 2020 IEEE. This work was supported in parts by the ONR grant N00014-18-1-2390, the NSF grant CCF-1712633, and the Electrical Engineering Carver Mead Research Seed Fund of the California Institute of Technology.
Funders:
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-18-1-2390
NSFCCF-1712633
Carver Mead Seed FundUNSPECIFIED
Subject Keywords:Graph signal processing, node-asynchronous iterations, autonomous clustering, directed graphs
Record Number:CaltechAUTHORS:20200417-140311291
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20200417-140311291
Official Citation:O. Teke and P. P. Vaidyanathan, "Node-Asynchronous Spectral Clustering On Directed Graphs," ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Barcelona, Spain, 2020, pp. 5325-5329; doi: 10.1109/ICASSP40776.2020.9054241
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:102612
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:17 Apr 2020 21:07
Last Modified:17 Apr 2020 21:07

Repository Staff Only: item control page