Related papers: Graph topology determines coexistence in the rock-…
In this letter, we investigate the population dynamics in a May-Leonard formulation of the rock-paper-scissors game in which one or two species, which we shall refer to as "weak", have a reduced predation or reproduction probability. We…
Solids with spatial variations in the crystalline axes naturally evolve into cells or grains separated by sharp walls. Such variations are mathematically described using the Nye dislocation density tensor. At high temperatures,…
Markovian evolving graphs are dynamic-graph models where the links among a fixed set of nodes change during time according to an arbitrary Markovian rule. They are extremely general and they can well describe important dynamic-network…
We investigate the role of topological methods in the analysis of canard-type periodic and chaotic trajectories. In the first part of the paper, we apply topological degree to the analysis of multi-dimensional canards. The second part is…
The quest for efficient sorting is ongoing, and we will explore a graph-based stable sorting strategy, in particular employing comparison graphs. We use the topological sort to map the comparison graph to a linear domain, and we can…
We study the Karp--Sipser core of a random graph made of a configuration model with vertices of degree $1,2$ and $3$. This core is obtained by recursively removing the leaves as well as their unique neighbors in the graph. We settle a…
This paper is second in the series, following Pranav et al. (2019), focused on the characterization of geometric and topological properties of 3D Gaussian random fields. We focus on the formalism of persistent homology, the mainstay of…
A finite range interacting particle system on a transitive graph is considered. Assuming that the dynamics and the initial measure are invariant, the normalized empirical distribution process converges in distribution to a centered…
Treewidth is arguably the most important structural graph parameter leading to algorithmically beneficial graph decompositions. Triggered by a strongly growing interest in temporal networks (graphs where edge sets change over time), we…
The Lotka-Volterra system is a set of ordinary differential equations describing growth of interacting ecological species. This model has gained renewed interest in the context of random interaction networks. One of the debated questions is…
We provide a well-posedness theory for a class of nonlocal continuity equations on co-evolving graphs. We describe the connection among vertices through an edge weight function and we let it evolve in time, coupling its dynamics with the…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
We consider the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. First a number of foundational results on…
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications, however, the graph that defines which vertex sets are…
Graph filters are a staple tool for processing signals over graphs in a multitude of downstream tasks. However, they are commonly designed for graphs with a fixed number of nodes, despite real-world networks typically grow over time. This…
Conformational transitions are ubiquitous in biomolecular systems, have significant functional roles and are subject to evolutionary pressures. Here we provide a first theoretical framework for topological transition, i.e. conformational…
We consider the interacting particle system on the homogeneous tree of degree $(d + 1)$, known as frog model. In this model, active particles perform independent random walks, awakening all sleeping particles they encounter, and dying after…
A unifying graph theoretic framework for the modelling of metro transportation networks is proposed. This is achieved by first introducing a basic graph framework for the modelling of the London underground system from a diffusion law point…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
In the communication systems domain, constructing and maintaining network topologies via topology control (TC) algorithms is an important cross-cutting research area. Network topologies are usually modeled using attributed graphs whose…