Related papers: Asymptotics of a time bounded cylinder model
The recently measured yeast transcriptional network is analyzed in terms of simplified Boolean network models, with the aim of determining feasible rule structures, given the requirement of stable solutions of the generated Boolean…
Most existing works on transportation dynamics focus on networks of a fixed structure, but networks whose nodes are mobile have become widespread, such as cell-phone networks. We introduce a model to explore the basic physics of…
This paper introduces a statistical model for the arrival times of connection events in a computer network. Edges between nodes in a network can be interpreted and modelled as point processes where events in the process indicate information…
In communication networks structure and dynamics are tightly coupled. The structure controls the flow of information and is itself shaped by the dynamical process of information exchanged between nodes. In order to reconcile structure and…
This paper offers an overview of the mobile Boolean stochastic geometric model which is a time-dependent version of the ordinary Boolean model in a Euclidean space of dimension $d$. The main question asked is that of obtaining the law of…
This paper reviews a class of generic dissipative dynamical systems called N-K models. In these models, the dynamics of N elements, defined as Boolean variables, develop step by step, clocked by a discrete time variable. Each of the N…
Temporal social networks are characterized by {heterogeneous} duration of contacts, which can either follow a power-law distribution, such as in face-to-face interactions, or a Weibull distribution, such as in mobile-phone communication.…
This paper deals with the union set of a stationary Poisson process of cylinders in $\mathbb{R}^n$ having an $(n-m)$-dimensional base and an $m$-dimensional direction space, where $m\in\{0,1,\ldots,n-1\}$ and $n\geq 2$. The concept…
The volume and types of traffic data in mobile cellular networks have been increasing continuously. Meanwhile, traffic data change dynamically in several dimensions such as time and space. Thus, traffic modeling is essential for theoretical…
Routing in Delay Tolerant Networks (DTNs) benefits considerably if one can take advantage of knowledge concerning node mobility. The main contribution of this paper is the definition of a generic routing scheme for DTNs using a…
We consider a class of models describing the dynamics of $N$ Boolean variables, where the time evolution of each depends on the values of $K$ of the other variables. Previous work has considered models with dissipative dynamics. Here we…
Time-limited states characterise many dynamical processes on networks: disease infected individuals recover after some time, people forget news spreading on social networks, or passengers may not wait forever for a connection. These…
Dynamical systems theory and complexity science provide powerful tools for analysing artificial agents and robots. Furthermore, they have been recently proposed also as a source of design principles and guidelines. Boolean networks are a…
We prove that the fully asynchronous dynamics of a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$ without negative loop can be simulated, in a very specific way, by a monotone Boolean network with $2n$ components. We then use this result to…
Across all scales of the physical world, dynamical systems can often be usefully represented as abstract networks that encode the system's units and inter-unit interactions. Understanding how physical rules shape the topological structure…
Estimating the influence that individual nodes have on one another in a Boolean network is essential to predict and control the system's dynamical behavior, for example, detecting key therapeutic targets to control pathways in models of…
Flow networks are essential for both living organisms and enginneered systems. These networks often present complex dynamics controlled, at least in part, by their topology. Previous works have shown that topologically complex networks…
Boolean networks with canalizing functions are used to model gene regulatory networks. In order to learn how such networks may behave under evolutionary forces, we simulate the evolution of a single Boolean network by means of an adaptive…
The dynamics of Boolean networks (the N-K model) with scale-free topology are studied here. The existence of a phase transition governed by the value of the scale-free exponent of the network is shown analytically by analyzing the overlap…
A basic model of a dynamical distribution network is considered, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…