Related papers: Kuramoto Networks with Infinitely Many Stable Equi…
We study the energy function of the Kuramoto model in random geometric graphs defined in the unit circle as the number of nodes diverges. We prove the existence of at least one local minimum for each winding number $q \in \mathbb{Z}$ with…
Higher-order interactions fundamentally shape collective dynamics in oscillator networks. The topological Kuramoto model captures these effects by extending synchronization models to include interactions between cells of arbitrary dimension…
We prove that any non zero inertia, however small, is able to change the nature of the synchronization transition in Kuramoto-like models, either from continuous to discontinuous, or from discontinuous to continuous. This result is obtained…
We address the question how a given connection structure (directed graph) can be realised as a heteroclinic network that is complete in the sense that it contains all unstable manifolds of its equilibria. For a directed graph consisting of…
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…
In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…
A $k$-edge-coloured graph is colour-balanced if each colour appears equally often. Resolving a conjecture of Pardey and Rautenbach, we show that any colour-balanced $k$-edge-coloured complete graph $K_{2kt}$ contains a perfect matching that…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
In this paper we analyze the motion of a network of three planar curves with a speed proportional to the curvature of the arcs, having perpendicular intersections with the outer boundary and a common intersection at a triple junction. As a…
The stable envelopes of Okounkov et al. realize some representations of quantum algebras associated to quivers, using geometry. We relate these geometric considerations to quantum field theory. The main ingredients are the supersymmetric…
We propose a Kuramoto model of coupled oscillators on a time-varying graph, whose dynamics is dictated by a Markov process in the space of graphs. The simplest representative is considering a base graph and then the subgraph determined by…
Models of coupled oscillator networks play an important role in describing collective synchronization dynamics in biological and technological systems. The Kuramoto model describes oscillator's phase evolution and explains the transition…
The canonical double cover $\mathrm{D}(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(\Gamma))=\mathrm{Aut}(\Gamma)\times\mathbb{Z}_2$ then $\Gamma$ is called stable; otherwise $\Gamma$…
We prove that for every natural number k there are simply connected topological four-manifolds which have at leat k distinct smooth structures supporting Einstein metrics, and also have infinitely many distinct smooth structures not…
Recent studies suggest that unstable, non-chaotic solutions of the Navier-Stokes equation may provide deep insights into fluid turbulence. In this article, we present a combined experimental and numerical study exploring the dynamical role…
In this paper, we study the stability result of a well-known theorem of Bondy. We prove that for any 2-connected non-hamiltonian graph, if every vertex except for at most one vertex has degree at least $k$, then it contains a cycle of…
We prove that for every complete graph $K_t$, all graphs $G$ with no induced subgraph isomorphic to a subdivision of $K_t$ have a stable subset of size at least $|G|/{\rm polylog}|G|$. This is close to best possible, because for $t\ge 7$,…
In this paper, the connections between model theory and the theory of infinite permutation groups are used to study the n-existence and the n-uniqueness for n-amalgamation problems of stable theories. We show that, for any n>1, there exists…
The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n^2)$ of the maximal possible…
The incoherent state of the Kuramoto model of coupled oscillators exhibits marginal modes in mean field theory. We demonstrate that corrections due to finite size effects render these modes stable in the subcritical case, i.e. when the…