17 citations · 17 across the 3 of their papers we have counts for
3 papers
How likely is a random graph shift-enabled?
Liyan Chen, Samuel Cheng, Vladimir Stankovic +1
The shift-enabled property of an underlying graph is essential in designing distributed filters. This article discusses when a random graph is shift-enabled. In particular, popular…
Undirected graphs: is the shift-enabled condition trivial or necessary?
Liyan Chen, Samuel Cheng, Kanghang He +2
It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) c…
Shift-enabled graphs: Graphs where shift-invariant filters are representable as polynomials of shift operations
Liyan Chen, Samuel Cheng, Vlandimir Stankovic +1
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to gr…