Related papers: Dynamics of Jackson networks: perturbation theory
We present a systematic method to expand the quantum complexity of interacting theory in series of coupling constant. The complexity is evaluated by the operator approach in which the transformation matrix between the second quantization…
Reaction-diffusion systems with time-delay defined on complex networks have been studied in the framework of the emergence of Turing instabilities. The use of the Lambert W-function allowed us get explicit analytic conditions for the onset…
We introduce and solve a general model of dynamic response under external perturbations. This model captures a wide range of systems out of equilibrium including Ising models of physical systems, social opinions, and population genetics.…
Multipurpose batch processes become increasingly popular in manufacturing industries since they adapt to low-volume, high-value products and shifting demands. These processes often operate in a dynamic environment, which faces disturbances…
Our comments are in two parts. First, we make some observations regarding the methodology in Chambers et al. [arXiv:0708.0302]. Second, we briefly describe another interesting network monitoring problem that arises in the context of…
Researchers have typically concentrated on analyzing what happens internally in a complex network and using this to distinguish between nodes. However, there has been less effort towards comparing between different networks. In this paper,…
In a reaction-diffusion system, fluctuations in both diffusion and reaction events, have important effects on the steady-state statistics of the system. Here, we argue through extensive lattice simulations, mean-field type arguments, and…
We present a static framework for analysing quantum routing protocols that we call the \textit{cost-vector formalism}. Here, quantum networks are recast as multi-graphs where edges represent two-qubit entanglement resources that…
We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have…
We develop a phenomenological theory of critical phenomena in networks with an arbitrary distribution of connections $P(k)$. The theory shows that the critical behavior depends in a crucial way on the form of $P(k)$ and differs strongly…
Known by many names and arising in many settings, the forced linear diffusion model is central to the modeling of power and influence within social networks (while also serving as the mechanistic justification for the widely used…
Percolation theory characterizing the robustness of a network has applications ranging from biology, to epidemic spreading, and complex infrastructures. Percolation theory, however, only concern the typical response of a infinite network to…
The problem of real-time processing is one of the most challenging current issues in computer sciences. Because of the large amount of data to be treated in a limited period of time, parallel and distributed systems are required, whose…
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…
The characterization of the "most connected" nodes in static or slowly evolving complex networks has helped in understanding and predicting the behavior of social, biological, and technological networked systems, including their robustness…
We consider the problem of minimizing the delay of jobs moving through a directed graph of service nodes. In this problem, each node may have several links and is constrained to serve one link at a time. As jobs move through the network,…
Steady-state solutions for a variety of relevant queueing systems are known today, e.g., from queueing theory, effective bandwidths, and network calculus. The behavior during transient phases, on the other hand, is understood to a much…
This paper presents a unified framework for analyzing the input-output behavior of discrete time complex networks viewed as open systems. Importantly, we focus on systems that are inherently modeled in discrete time-such as opinion…
This article studies disruption tolerant networks (DTNs) where each node knows the probabilistic distribution of contacts with other nodes. It proposes a framework that allows one to formalize the behaviour of such a network. It generalizes…
This paper presents an unusual view of interference wireless networks based on complex system thinking. To proceed with this analysis, a literature review of the different applications of complex systems is firstly presented to illustrate…