Related papers: Interference Queueing Networks on Grids
We analyse the stability of linear dynamical systems defined on sparse, random graphs with predator-prey, competitive, and mutualistic interactions. These systems are aimed at modelling the stability of fixed points in large systems defined…
In the series of models with interacting particles in stochastic geometry, a new contribution presents the facet process which is defined in arbitrary Euclidean dimension. In 2D, 3D specially it is a process of interacting segments, flat…
A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of…
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…
We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\em unsaturated} -- each node receives…
We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…
We apply wave packet methods to study an ion-trap system in the strong excitation regime imposing neither the rotating wave nor the Lamb-Dicke approximations. By this approach we show the existence of states with restricted phase space…
This paper provides proofs of the rate stability, Harris recurrence, and epsilon-optimality of CSMA algorithms where the backoff parameter of each node is based on its backlog. These algorithms require only local information and are easy to…
A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there…
Consider the workload process for a single server queue with deterministic service times in which customers arrive according to a scheduled traffic process. A scheduled arrival sequence is one in which customers are scheduled to arrive at…
Quantum graphs model processes in complex systems represented as spatial networks in various fields of natural science and technology. An example is the oscillations of elastic string networks, the nodes of which, besides the continuity…
A class of distributed systems with a cyclic interconnection structure is considered. These systems arise in several biochemical applications and they can undergo diffusion driven instability which leads to a formation of spatially…
The quasi-coherent effects in two-dimensional incompressible turbulence are analyzed starting from the test particle trajectories. They can acquire coherent aspects when the stochastic potential has slow time variation and the motion is not…
In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…
A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…
We consider a basic model of a dynamical distribution network, 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…
We consider a novel, analytical queuing model for vehicle coordination at signal-free intersections. Vehicles arrive at an intersection according to Poisson processes, and the crossing times are constants dependent of vehicle types. We use…
We investigate the stability problem for discrete-time stochastic switched linear systems under the specific scenarios where information about the switching patterns and the probability of switches are not available. Our analysis focuses on…
We investigate the Schelling model of social segregation, formulated as an intrinsically non-equilibrium system, in which the agents occupy districts (or patches) rather than sites on a grid. We show that this allows the equations governing…
We consider large but finite systems of identical agents on the line with up to next nearest neighbor asymmetric coupling. Each agent is modelled by a linear second order differential equation, linearly coupled to up to four of its…