Related papers: Selfconsistent Transfer Operators for Heterogeneou…
The problem of reservation in a large distributed system is analyzed via a new mathematical model. A typical application is a station-based car-sharing system which can be described as a closed stochastic network where the nodes are the…
The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are…
With high throughput networks acquiring a crucial role in supporting data-intensive applications, a variety of data center network topologies have been proposed to achieve high capacity at low cost. While this literature explores a large…
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a…
Graph neural ordinary differential equations (Graph ODEs) extend graph learning from discrete message-passing layers to continuous-time representation flows. While it supports adaptive long-range propagation, we show that Graph ODEs with…
We study fully synchronized (coherent) states in complex networks of chaotic oscillators, reviewing the analytical approach of determining the stability conditions for synchronizability and comparing them with numerical criteria. As an…
We study the urban-scale macroscopic traffic flow in city networks. Star graph is considered as traffic network. Star graphs with controlled traffic flow are transformed to various cell-transmission graphs by using the cell transmission…
In this paper we categorize dynamical regimes demonstrated by star-like networks with chaotic nodes. This analysis is done in view of further studying of chaotic scale-free networks, since a star-like structure is the main motif of them. We…
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings are dual to the notion of flow-continuous mappings and the…
We define a minimal model of traffic flows in complex networks containing the most relevant features of real routing schemes, i.e. a trade--off strategy between topological-based and traffic-based routing. The resulting collective behavior,…
In computer networks, participants may cooperate in processing tasks, so that loads are balanced among them. We present local distributed algorithms that (repeatedly) use local imbalance criteria to transfer loads concurrently across the…
We present a mean-field theory for the dynamics of driven flow with exclusion in graphenelike structures, and numerically check its predictions. We treat first a specific combination of bond transmissivity rates, where mean field predicts,…
In complex systems, information propagation can be defined as diffused or delocalized, weakly localized, and strongly localized. This study investigates the application of graph neural network models to learn the behavior of a linear…
In this short note we provide a proof of boundedness of solutions for a network system composed of heterogeneous nonlinear autonomous systems interconnected over a directed graph. The sole assumptions imposed are that the systems are…
This paper studies a basic model of a dynamical distribution network, where the network topology is given by a directed graph with storage variables corresponding to the vertices and flow inputs corresponding to the edges. We aim at…
Adaptive management of traffic congestion in the Internet is a complex problem that can gain useful insights from a dynamical approach. In this paper we propose and analyze a one-dimensional, discrete-time nonlinear model for Internet…
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…
We investigate the dynamics of an array of logistic maps coupled with random delay times. We report that for adequate coupling strength the array is able to synchronize, in spite of the random delays. Specifically, we find that the…
We study systems of globally coupled interval maps, where the identical individual maps have two expanding, fractional linear, onto branches, and where the coupling is introduced via a parameter - common to all individual maps - that…
We analyze networked heterogeneous nonlinear systems, with diffusive coupling and interconnected over a generic static directed graph. Due to the network's hetereogeneity, complete synchronization is impossible, in general, but an emergent…