Related papers: Sparse Network Optimization for Synchronization
Given a dynamic network, where edges appear and disappear over time, we are interested in finding sets of edges that have similar temporal behavior and form a dense subgraph. Formally, we define the problem as the enumeration of the maximal…
We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and a tool called vertex sparsification, which is a way to compress large graphs into small…
There are numerous examples of studied real-world systems that can be described as dynamical systems characterized by individual phases and coupled in a network like structure. Within the framework of oscillatory models, much attention has…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
Network alignment generalizes and unifies several approaches for forming a matching or alignment between the vertices of two graphs. We study a mathematical programming framework for network alignment problem and a sparse variation of it…
Structured sparse optimization is an important and challenging problem for analyzing high-dimensional data in a variety of applications such as bioinformatics, medical imaging, social networks, and astronomy. Although a number of structured…
This work deals with the generation of theoretical correlation matrices with specific sparsity patterns, associated to graph structures. We present a novel approach based on convex optimization, offering greater flexibility compared to…
Synchronizing phase frustrated Kuramoto oscillators, a challenge that has found applications from neuronal networks to the power grid, is an eluding problem, as even small phase-lags cause the oscillators to avoid synchronization. Here we…
Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost…
Pose graph optimization is a special case of the simultaneous localization and mapping problem where the only variables to be estimated are pose variables and the only measurements are inter-pose constraints. The vast majority of pose graph…
We present an analytical scheme to achieve optimal synchronization in multiplex networks of frustrated and non-frustrated phase oscillators. We derive a multiplex synchrony alignment function (MSAF) for that purpose, the expression of which…
We study the synchronisation properties of the Kuramoto model of coupled phase oscillators on a general network. Here we distinguish the ability of such a system to self-synchronise from the stability of this behaviour. While…
Hypergraph matching is a fundamental problem in computer vision. Mathematically speaking, it maximizes a polynomial objective function, subject to assignment constraints. In this paper, we reformulate the hypergraph matching problem as a…
We consider the problem of optimizing the interconnection graphs of complex networks to promote synchronization. When traditional optimization methods are inapplicable, due to uncertain or unknown node dynamics, we propose a data-driven…
In this paper, we aim to design sparse D-optimal (determinantoptimal) pose-graph SLAM problems through the synthesis of sparse graphs with the maximum weighted number of spanning trees. Characterizing graphs with the maximum number of…
We study the emergence of synchronization in scale-free networks by considering the Kuramoto model of coupled phase oscillators. The natural frequencies of oscillators are assumed to be correlated with their degrees and a time delay is…
In this study, we present a general framework for comparing two dynamical processes that describe the synchronization of oscillators coupled through networks of the same size. We introduce a measure of dissimilarity defined in terms of a…
We address the non-convex optimisation problem of finding a sparse matrix on the Stiefel manifold (matrices with mutually orthogonal columns of unit length) that maximises (or minimises) a quadratic objective function. Optimisation problems…
The homogeneous Kuramoto model on a graph $G = (V,E)$ is a network of $|V|$ identical oscillators, one at each vertex, where every oscillator is coupled bidirectionally (with unit strength) to its neighbors in the graph. A graph $G$ is said…
We propose a framework for achieving perfect synchronization in complex networks of Sakaguchi-Kuramoto oscillators in presence of higher order interactions (simplicial complexes) at a targeted point in the parameter space. It is achieved by…