Related papers: Sparse Network Optimization for Synchronization
Sparse codes in neuroscience have been suggested to offer certain computational advantages over other neural representations of sensory data. To explore this viewpoint, a sparse code is used to represent natural images in an optimal control…
We analyze populations of Kuramoto oscillators with a particular distribution of natural frequencies. Inspired by networks where there are two groups of nodes with opposite behaviors, as for instance in power-grids where energy is either…
In this paper, we study the synchronization problem of nonuniform second-order Kuramoto model with homogeneous dampings and frustration effects on an asymmetric network. More precisely, we focus on the second order model defined on an…
In this paper we study the inference of the kinetic Ising model on sparse graphs by the decimation method. The decimation method, which was first proposed in [Phys. Rev. Lett. 112, 070603] for the static inverse Ising problem, tries to…
In a large variety of systems (biological, physical, social etc.), synchronization occurs when different oscillating objects tune their rhythm when they interact with each other. The different underlying network defining the connectivity…
Spectral graph sparsification aims to find ultra-sparse subgraphs whose Laplacian matrix can well approximate the original Laplacian eigenvalues and eigenvectors. In recent years, spectral sparsification techniques have been extensively…
We study the synchronized behavior of the inertial Kuramoto oscillators with frustration effect under a symmetric and connected network. Due to the lack of second-order gradient flow structure and singularity of second-order derivative of…
We study deterministic algorithms for computing graph cuts, with focus on two fundamental problems: balanced sparse cut and $k$-vertex connectivity for small $k$ ($k=O(\polylog n)$). Both problems can be solved in near-linear time with…
In this paper we address two questions about the synchronization of coupled oscillators in the Kuramoto model with all-to-all coupling. In the first part we use some classical results in convex geometry to prove bounds on the size of the…
We discuss the aspects of synchronization on inhomogeneous star-like graphs with long rays in Kuramoto model framework. We assume the positive correlation between internal frequencies and degrees for all nodes which supports the abrupt…
The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is…
We consider the Backup Placement problem in networks in the $\mathcal{CONGEST}$ distributed setting. Given a network graph $G = (V,E)$, the goal of each vertex $v \in V$ is selecting a neighbor, such that the maximum number of vertices in…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…
Synchronization in the networks of coupled oscillators is a widely studied topic in different areas. It is well-known that synchronization occurs if the connectivity of the network dominates heterogeneity of the oscillators. Despite…
The synchronization of human networks is essential for our civilization, and understanding the motivations, behavior, and basic parameters that govern the dynamics of human networks is important in many aspects of our lives. Human ensembles…
For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among…
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…
Based on recent advances in fibration symmetry theory, we investigate how structural symmetries influence synchronization in systems with higher-order interactions (HOI). Using bipartite graph representations, we identify a node partition…
The integration of renewable energy sources in the course of the energy transition is accompanied by grid decentralization and fluctuating power feed-in characteristics. This raises new challenges for power system stability and design. We…
Generative graph models struggle to scale due to the need to predict the existence or type of edges between all node pairs. To address the resulting quadratic complexity, existing scalable models often impose restrictive assumptions such as…