相关论文: Large deviations of a modified Jackson network: st…

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network…

A common property of many large networks, including the Internet, is that the connectivity of the various nodes follows a scale-free power-law distribution, P(k)=ck^-a. We study the stability of such networks with respect to crashes, such…

This paper proposes an adaptation of two network size estimation methods: random tour and gossip-based aggregation to suit master/slave mobile ad hoc networks. We show that it is feasible to accurately estimate the size of ad hoc networks…

This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…

Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…

We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from…

This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition…

The large deviation properties of equilibrium (reversible) lattice gases are mathematically reasonably well understood. Much less is known in non--equilibrium, namely for non reversible systems. In this paper we consider a simple example of…

Most real-world networks are embedded in latent geometries. If a node in a network is found in the vicinity of another node in the latent geometry, the two nodes have a disproportionately high probability of being connected by a link. The…

For a class of large closed Jackson networks submitted to capacity constraints, asymptotic independence of the nodes in normal traffic phase is proved at stationarity under mild assumptions, using a Local Limit Theorem. The limiting…

We study the tail asymptotic of the stationary joint queue length distribution for a generalized Jackson network (GJN for short), assuming its stability. For the two station case, this problem has been recently solved in the logarithmic…

Recently it was shown (I.A.Gruzberg, A. Kl\"umper, W. Nuding and A. Sedrakyan, Phys.Rev.B 95, 125414 (2017)) that taking into account random positions of scattering nodes in the network model with $U(1)$ phase disorder yields a localization…

Jackson queuing networks have a lot of practical applications, mainly in services and technologic devices. For the first case, an example are the healthcare networks and, for the second, the computation and telecommunications networks.…

It is becoming more and more clear that complex networks present remarkable large fluctuations. These fluctuations may manifest differently according to the given model. In this paper we re-consider hidden variable models which turn out to…

A network with local dynamics of logistic type is considered. We implement a mean-field multiplicative coupling among first-neighbor nodes. When the coupling parameter is small the dynamics is dissipated and there is no activity: the…

The paper studies a closed queueing network containing two types of node. The first type (server station) is an infinite server queueing system, and the second type (client station) is a single server queueing system with autonomous…

We study the design of dynamic scheduling controls in closed queueing networks with a fixed number of jobs. Each time a server becomes available, the controller has (limited) flexibility in choosing the buffer from which to serve a job. If…

The Join-the-Shortest-Queue routing policy is studied in an asymptotic regime where the number of processors $n$ scales with the arrival rate. A large deviation principle (LDP) for the occupancy process is established, as $n\to \infty$, in…

A broad class of parallel server systems is considered, for which we prove the steady-state asymptotic independence of server workloads, as the number of servers goes to infinity, while the system load remains sub-critical. Arriving jobs…

This paper is concerned with the estimation of time-varying networks for high-dimensional nonstationary time series. Two types of dynamic behaviors are considered: structural breaks (i.e., abrupt change points) and smooth changes. To…