Related papers: From weighted to unweighted graphs in Synchronizin…
A perfect $K_t$-matching in a graph $G$ is a spanning subgraph consisting of vertex disjoint copies of $K_t$. A classic theorem of Hajnal and Szemer\'edi states that if $G$ is a graph of order $n$ with minimum degree $\delta(G) \ge…
Given an undirected and connected graph $G$ on $T$ vertices, suppose each vertex $t$ has a latent signal $x_t \in \mathbb{R}^n$ associated to it. Given partial linear measurements of the signals, for a potentially small subset of the…
With the impressive growth of network models in practically every scientific and technological area, we are often faced with the need to compare graphs, i.e., to quantify their (dis)similarity using appropriate metrics. This is necessary,…
Given an undirected measurement graph $G = ([n], E)$, the classical angular synchronization problem consists of recovering unknown angles $\theta_1,\dots,\theta_n$ from a collection of noisy pairwise measurements of the form $(\theta_i -…
Designing high-performing networks requires optimizing for functionality while respecting physical, geometric, or budget constraints. Yet, mathematical and computational tools to design such systems remain limited, particularly for…
Given a graph $G$, a 2-coloring of the edges of $K_n$ is said to contain a balanced copy of $G$ if we can find a copy of $G$ such that half of its edges are in each color class. If, for every sufficiently large $n$, there exists an integer…
The Kuramoto model (KM) of coupled phase oscillators on complete, Paley, and Erdos-Renyi (ER) graphs is analyzed in this work. As quasirandom graphs, the complete, Paley, and ER graphs share many structural properties. For instance, they…
A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
In this work, a novel approach for the reliable and efficient numerical integration of the Kuramoto model on graphs is studied. For this purpose, the notion of order parameters is revisited for the classical Kuramoto model describing…
We propose a graphical notation by which certain spectral properties of complex systems can be rewritten concisely and interpreted topologically. Applying this notation to analyze the stability of a class of networks of coupled dynamical…
We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph $G=(V,E)$ on $n$ vertices and $k$…
We investigate algebraic and topological signatures of networks of coupled oscillators. Translating dynamics into a system of algebraic equations enables us to identify classes of network topologies that exhibit unexpected behaviors. Many…
A network of coupled dynamical systems is represented by a graph whose vertices represent individual cells and whose edges represent couplings between cells. Motivated by the impact of synchronization results of the Kuramoto networks, we…
We investigate synchronization in networks of Kuramoto oscillators with inertia. More specifically, we introduce a rewiring algorithm consisting basically in a {\em hill climb} scheme in which the edges of the network are swapped in order…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
The graph matching problem is a significant special case of the Quadratic Assignment Problem, with extensive applications in pattern recognition, computer vision, protein alignments and related fields. As the problem is NP-hard, relaxation…
We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…
Let $H$ be a graph allowing loops as well as vertex and edge weights. We prove that, for every triangle-free graph $G$ without isolated vertices, the weighted number of graph homomorphisms $\hom(G, H)$ satisfies the inequality \[ \hom(G, H…
An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-weight capacity-matching equals the value of a maximum-weight fractional capacity-matching. Stable graphs play a key role in characterizing the…