Title: Node-Differentially Private Estimation of the Number of Connected Components
Award ID(s):
2120667 2232694
PAR ID:
10492419
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
Proceedings of the 42nd {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems, {PODS} 2023, Seattle, WA, USA, June 18-23, 2023
Date Published:
ISBN:
9798400701276
Page Range / eLocation ID:
183 to 194
Format(s):
Medium: X
Location:
Seattle WA USA
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
  2. null (Ed.)
  3. null (Ed.)
  4. null (Ed.)
    A unified approach to the determination of eigenvalues and eigenvectors of specific matrices associated with directed graphs is presented. Matrices studied include the new distance matrix, with natural extensions to the distance Laplacian and distance signless Laplacian, in addition to the new adjacency matrix, with natural extensions to the Laplacian and signless Laplacian. Various sums of Kronecker products of nonnegative matrices are introduced to model the Cartesian and lexicographic products of digraphs. The Jordan canonical form is applied extensively to the analysis of spectra and eigenvectors. The analysis shows that Cartesian products provide a method for building infinite families of transmission regular digraphs with few distinct distance eigenvalues. 
    more » « less