Spread spectrum (SS) or known-host-statistics technique has shown the best performance in terms of both rate of reliable communications and bit error probability at the low waterm...
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
It is well-known that the eigenvalue spectrum of the Laplacian matrix of a network contains valuable information about the network structure and the behavior of many dynamical proc...
Victor M. Preciado, Michael M. Zavlanos, Ali Jadba...