Related papers: Overdetermined ODEs and Rigid Periodic States in N…
We study a graph-theoretic property known as robustness, which plays a key role in certain classes of dynamics on networks (such as resilient consensus, contagion and bootstrap percolation). This property is stronger than other graph…
We explore a novel method to generate and characterize complex networks by means of their embedding on hyperbolic surfaces. Evolution through local elementary moves allows the exploration of the ensemble of networks which share common…
This is an introduction of a book called "strong regularity", to appear at Ast\'erisque, containing: 1) Yoccoz' proof of Jakobson theorem www.college-de-france.fr/media/jean-christophe-yoccoz/UPL7416254474776698194_Jakobson_jcy.pdf 2)…
In a generalized framework, where multi-state and inter-state linkages are allowed, we derive a sufficient condition for the stability of synchronization in a network of chaotic attractors. This condition explicitly relates the network…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
In this paper we prove the following result, useful and often needed in the study of the ergodic properties of hard ball systems: In any such system, for any phase point x with a non-singular forward trajectory and infinitely many connected…
Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely…
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong…
We extend a recent model of temporal random hyperbolic graphs by allowing connections and disconnections to persist across network snapshots with different probabilities, $\omega_1$ and $\omega_2$. This extension, while conceptually simple,…
Real networks are complex dynamical systems, evolving over time with the addition and deletion of nodes and links. Currently, there exists no principled mathematical theory for their dynamics -- a grand-challenge open problem. Here, we show…
We describe a new and robust method to prove rigidity results in complex dynamics. The new ingredient is the geometry of the critical puzzle pieces: under control of geometry and ``complex bounds'', two generalized polynomial-like maps…
Over the last decade, random hyperbolic graphs have proved successful in providing geometric explanations for many key properties of real-world networks, including strong clustering, high navigability, and heterogeneous degree…
For $i= 1,2$, let $G_i$ be cocompact groups of isometries of hyperbolic space $\Hyp^n$ of real dimension $n$, $n \geq 3$. Let $H_i \subset G_i$ be infinite index quasiconvex subgroups satisfying one of the following conditions: 1) limit set…
We prove ergodicity for random dynamics satisfying some expansion and irreducibility conditions. As a particular application, we show that if $R_1,R_2\in \mathrm{SO}(d+1)$, $d\ge 2$, generate a dense subgroup, then the random dynamics of…
We show that, near periodic orbits, a class of hybrid models can be reduced to or approximated by smooth continuous-time dynamical systems. Specifically, near an exponentially stable periodic orbit undergoing isolated transitions in a…
In a recent paper Hodgson and Kerckhoff prove a local rigidity theorem for finite volume, three dimensional hyperbolic cone-manifolds. In this paper we extend this result to geometrically finite cone-manifolds. Our methods also give a new…
The framework of joint typical periodic optimization, in which both the dynamical system and the potential function are allowed to vary simultaneously, was introduced in [HHJL25], in a direction motivated by the work of Yang, Hunt & Ott…
Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…
We consider and analyze a dynamic model of random hyperbolic graphs with link persistence. In the model, both connections and disconnections can be propagated from the current to the next snapshot with probability $\omega \in [0, 1)$.…
We introduce a large class of models exhibiting robust ergodicity breaking in quantum dynamics. Our work is inspired by recent discussions of "topologically robust Hilbert space fragmentation," but massively generalizes in two directions:…