Related papers: A Cheeger Inequality for the Graph Connection Lapl…
This paper gives sufficient conditions for having complete synchronization of oscillators in connected undirected networks. The considered oscillators are not necessarily identical and the synchronization terms can be nonlinear. An…
This thesis studies the graph alignment problem, the noisy version of the graph isomorphism problem, which aims to find a matching between the nodes of two graphs which preserves most of the edges. Focusing on the planted version where the…
We study optimal synchronization in networks of heterogeneous phase oscillators. Our main result is the derivation of a synchrony alignment function that encodes the interplay between network structure and oscillators' frequencies and can…
Laplacian Eigenvectors of the graph constructed from a data set are used in many spectral manifold learning algorithms such as diffusion maps and spectral clustering. Given a graph constructed from a random sample of a $d$-dimensional…
In this article we study the Schr\"odinger equation associated with Harmonic oscillator in the form of Strichartz type inequality. We give simple proofs for Strichartz type inequalities using purely the $L^2 \to L^p$ operator norm estimates…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…
Synchronization is studied in an array of identical oscillators undergoing small vibrations. The overall coupling is described by a pair of matrix-weighted Laplacian matrices; one representing the dissipative, the other the restorative…
Our goal in this paper is to find an estimate for the spectral gap of the Laplacian on a 2-simplicial complex consisting on a triangulation of a complete graph. An upper estimate is given by generalizing the Cheeger constant. The lower…
We study the optimal design of a conductance network as a means for synchronizing a given set of oscillators. Synchronization is achieved when all oscillator voltages reach consensus, and performance is quantified by the mean-square…
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can…
The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing…
Given a pair of graphs with the same number of vertices, the inexact graph matching problem consists in finding a correspondence between the vertices of these graphs that minimizes the total number of induced edge disagreements. We study…
We study a well known noisy model of the graph isomorphism problem. In this model, the goal is to perfectly recover the vertex correspondence between two edge-correlated Erd\H{o}s-R\'{e}nyi random graphs, with an initial seed set of…
We give a quasipolynomial time algorithm for the graph matching problem (also known as noisy or robust graph isomorphism) on correlated random graphs. Specifically, for every $\gamma>0$, we give a $n^{O(\log n)}$ time algorithm that given a…
For magnetic graphs satisfying connection curvature dimension inequality $CD^\sigma(n,\kappa)$, we prove a Harnack-type inequality for eigenfunctions of the graph magnetic Laplace operator in the manner of work done by Chung, Lin, Yau in…
Networks of coupled LC oscillators that do not share a common ground node are studied. Both resistive coupling and inductive coupling are considered. For networks under resistive coupling, it is shown that the oscillator-coupler…
Spectral partitioning is a simple, nearly-linear time, algorithm to find sparse cuts, and the Cheeger inequalities provide a worst-case guarantee for the quality of the approximation found by the algorithm. Local graph partitioning…
We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…
In principle, while coupled limit cycle oscillators can overcome mismatch in intrinsic rates and match their frequencies, but zero phase lag synchronization is just achievable in the limit of zero mismatch, i.e., with identical oscillators.…
Transitive consistency is an intrinsic property for collections of linear invertible transformations between Euclidean coordinate frames. In practice, when the transformations are estimated from data, this property is lacking. This work…