Related papers: Making Laplacians commute
Recently, much of the existing work in manifold learning has been done under the assumption that the data is sampled from a manifold without boundaries and singularities or that the functions of interest are evaluated away from such points.…
Multi-modal high throughput biological data presents a great scientific opportunity and a significant computational challenge. In multi-modal measurements, every sample is observed simultaneously by two or more sets of sensors. In such…
Alternating patterns of small and large amplitude oscillations occur in a wide variety of physical, chemical, biological and engineering systems. These mixed-mode oscillations (MMOs) are often found in systems with multiple time scales.…
We construct a dynamical decoupling protocol for accurately generating local and global symmetries in general many-body systems. Multiple commuting and non-commuting symmetries can be created by means of a self-similar-in-time…
A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting…
Reciprocity-based beamforming-most commonly employed in time-division duplexing-uses noisy, estimated (i.e., measured) channel state information (CSI) acquired on the uplink. While computationally efficient, reciprocity-based beamforming…
We propose a novel robust decentralized graph clustering algorithm that is provably equivalent to the popular spectral clustering approach. Our proposed method uses the existing wave equation clustering algorithm that is based on…
Whereas dedicated scene representations are required for each different task in conventional robotic systems, this paper demonstrates that a unified representation can be used directly for multiple key tasks. We propose the Log-Gaussian…
These are notes on the method of normalized graph cuts and its applications to graph clustering. I provide a fairly thorough treatment of this deeply original method due to Shi and Malik, including complete proofs. I include the necessary…
Complex real-world phenomena are often modeled as dynamical systems on networks. In many cases of interest, the spectrum of the underlying graph Laplacian sets the system stability and ultimately shapes the matter or information flow. This…
The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…
The convolution operation suffers from a limited receptive filed, while global modeling is fundamental to dense prediction tasks, such as semantic segmentation. In this paper, we apply graph convolution into the semantic segmentation task…
Spectral clustering has become one of the most popular algorithms in data clustering and community detection. We study the performance of classical two-step spectral clustering via the graph Laplacian to learn the stochastic block model.…
We use a conformal mapping technique to study the Laplacian transfer across a rough interface. Natural Dirichlet or Von Neumann boundary condition are simply read by the conformal map. Mixed boundary condition, albeit being more complex can…
We give $\operatorname{CMSO}$-transductions that, given a graph $G$, output its modular decomposition, its split decomposition and its bi-join decomposition. This improves results by Courcelle [Logical Methods in Computer Science, 2006] who…
Several algebro-geometric properties of commutative rings of partial differential operators as well as several geometric constructions are investigated. In particular, we show how to associate a geometric data by a commutative ring of…
Multi-Conjugate Adaptive Optics (MCAO) combines the advantages of standard adaptive optics, which provides high contrast and high spatial resolution, and of wide field ~1' imaging. Up to recently, MCAO for astronomy was limited to…
This is a tutorial and survey paper for nonlinear dimensionality and feature extraction methods which are based on the Laplacian of graph of data. We first introduce adjacency matrix, definition of Laplacian matrix, and the interpretation…
Recent developments in Multiple-Input-Multiple-Output (MIMO) technology include packing a large number of antenna elements in a compact array to access the bandwidth benefits provided by higher mutual coupling (MC). The resulting…
This work presents a distributed method for multi-vehicle coordination based on nonlinear model predictive control (NMPC) and dual decomposition. Our approach allows the vehicles to coordinate in tight spaces (e.g., busy highway lanes or…