Related papers: Graph topology determines coexistence in the rock-…
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…
Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs,…
The knowledge of real-life traffic pattern is crucial for good understanding and analysis of transportation systems. This data is quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
Dynamical mechanisms that can stabilize the coexistence or diversity in biology are generally of fundamental interest. In contrast to many two-strategy evolutionary games, games with three strategies and cyclic dominance like the…
The main objective of this article is to study the effect of spherical geometry on dynamic transitions and pattern formation for the Rayleigh-Benard convection. The study is mainly motivated by the importance of spherical geometry and…
We introduce a continuous-time random walk model on an infinite multilayer structure inspired by transportation networks. Each layer is a copy of $\mathbb{R}^d$, indexed by a non-negative integer. A walker moves within a layer by means of…
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers.…
In this paper, we propose a novel approach that employs kinetic equations to describe the collective dynamics emerging from graph-mediated pairwise interactions in multi-agent systems. We formally show that for large graphs and specific…
The theoretical and numerical understanding of the key concept of topological entropy is an important problem in dynamical systems. Most studies have been carried out on maps (discrete-time systems). We analyse a scenario of global changes…
As a quantification of the main bottleneck to flow over a graph, the network property of conductance plays an important role in the process of synchronization of network-coupled dynamical systems. Diffusive coupling terms serve not only to…
Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…
We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the interactions of which lead to a dynamic graph. The walkers of the…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
Amorphous systems have rapidly gained promise as novel platforms for topological matter. In this work we establish a scaling theory of amorphous topological phase transitions driven by the density of lattice points in two dimensions. By…
The co-authorship network of scientists represents a prototype of complex evolving networks. By mapping the electronic database containing all relevant journals in mathematics and neuro-science for an eight-year period (1991-98), we infer…
Persistent homology, a technique from computational topology, has recently shown strong empirical performance in the context of graph classification. Being able to capture long range graph properties via higher-order topological features,…
We investigate the stability of the topological phase of the toric code model in the presence of a uniform magnetic field by means of variational and high-order series expansion approaches. We find that when this perturbation is strong…
We investigate the formation of stable ecological networks where many species share the same resource. We show that such stable ecosystem naturally occurs as a result of extinctions. We obtain an analytical relation for the number of…