Related papers: A Cheeger Inequality for the Graph Connection Lapl…
The $\mu$-conductance measure proposed by Lov\'asz and Simonovits is a size-specific conductance score that identifies the set with smallest conductance while disregarding those sets with volume smaller than a $\mu$ fraction of the whole…
The discrete Cheeger inequality, due to Alon and Milman (J. Comb. Theory Series B 1985), is an indispensable tool for converting the combinatorial condition of graph expansion to an algebraic condition on the eigenvalues of the graph…
Graph matching aims to find correspondences between two graphs. It is a fundamental task in pattern recognition. The classical spectral matching algorithm has time complexity $\mathcal{O}(n^4)$ and space complexity $\mathcal{O}(n^4)$, where…
We provide a theoretical framework for quantifying the expected level of synchronization in a network of noisy oscillators. Through linearization around the synchronized state, we derive the following quantities as functions of the…
We study the performance of the spectral method for the phase synchronization problem with additive Gaussian noises and incomplete data. The spectral method utilizes the leading eigenvector of the data matrix followed by a normalization…
On a smooth, closed Riemannian manifold, we study the question of proportionality of components, also called synchronization, of vector-valued solutions to nonlinear elliptic Schr\"odinger systems with constant coefficients. In particular,…
Subgraph isomorphism compares two graphs (sets of nodes joined by edges) to determine whether they contain a common subgraph. Many applications require identifying the subgraph, not just deciding its existence. A particularly common use…
We propose new mathematical optimization models for generating sparse dynamical graphs, or networks, that can achieve synchronization. The synchronization phenomenon is studied using the Kuramoto model, defined in terms of the adjacency…
Synchronization of identical harmonic oscillators interconnected via position, velocity, and acceleration couplings is studied. How to construct a complex Laplacian matrix representing the overall coupling is presented. It is shown that the…
We experimentally demonstrate and numerically simulate a new adaptive method to maintain synchronization between coupled nonlinear chaotic oscillators, when the coupling between the systems is unknown and time-varying (e.g., due to…
We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we…
Finding the symmetric and orthogonal decomposition (SOD) of a tensor is a recurring problem in signal processing, machine learning and statistics. In this paper, we review, establish and compare the perturbation bounds for two natural types…
We present an adaptive algorithm that guarantees synchronization in diffusively coupled systems. We first consider compartmental systems of ODEs, where each compartment represents a spatial domain of components interconnected through…
Synchronization of coupled oscillators on a $d$-dimensional lattice with the power-law coupling $G(r) = g_0/r^\alpha$ and randomly distributed intrinsic frequency is analyzed. A systematic perturbation theory is developed to calculate the…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
Consider a pair of plane straight-line graphs, whose edges are colored red and blue, respectively, and let n be the total complexity of both graphs. We present a O(n log n)-time O(n)-space technique to preprocess such pair of graphs, that…
There are three key factors of a system of coupled oscillators that characterize the interaction among them: coupling (how to affect), delay (when to affect) and topology (whom to affect). For each of them, the existing work has mainly…
We extend the definition of boundary expansion to CW complexes and prove a Cheeger-Buser-type relation between the spectral gap of the Laplacian and the boundary expansion of an orientable CW complex.
Given an open and bounded set $\Omega\subset\mathbb{R}^N$, we consider the problem of minimizing the ratio between the $s-$perimeter and the $N-$dimensional Lebesgue measure among subsets of $\Omega$. This is the nonlocal version of the…
The detection of phase synchronization of coupled chaotic oscillators which are not phase-coherent is known to be a challenging task. In this work a method to detect and measure phase synchronization is presented. The procedure uses symbol…