Related papers: A fixed-point approximation for a routing model in…
In this paper, we consider a network capacity expansion problem in the context of telecommunication networks, where there is uncertainty associated with the expected traffic demand. We employ a distributionally robust stochastic…
In this paper, the downlink file transmission within a finite lifetime is optimized with the assistance of wireless cache nodes. Specifically, the number of requests within the lifetime of one file is modeled as a Poisson point process. The…
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains…
Mobile wireless network research focuses on scenarios at the extremes of the network connectivity continuum where the probability of all nodes being connected is either close to unity, assuming connected paths between all nodes (mobile ad…
This study develops a fixed-time convergent saddle point dynamical system for solving min-max problems under a relaxation of standard convexity-concavity assumption. In particular, it is shown that by leveraging the dynamical systems…
For entropy driven balanced processes we obtain final states with Poisson, Bernoulli, negative binomial and P\'olya distributions. We apply this both for complex networks and particle production. For random networks we follow the evolution…
We study molecular dynamics within populations of diffusively coupled cells under the assumption of fast diffusive exchange. As a technical tool, we propose conditions on boundedness and ultimate boundedness for systems with a singular…
A multiclass queue with many servers is considered, where customers make a join-or-leave decision upon arrival based on queue length information, without knowing the scheduling policy or the state of other queues. A game theoretic…
We have generalized the semi-analytic approach of special flow to the description of flows of passive particles taking into account internal noise. The model is represented by a series of recurrence relations. The recurrence relations are…
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue…
The quantitative convergence to equilibrium for reaction-diffusion systems arising from complex balanced chemical reaction networks with mass action kinetics is studied by using the so-called entropy method. In the first part of the paper,…
Self consistent transfer operators arise naturally in the study of mean-field coupled dynamical systems and are closely related to kinetic PDEs such as the Vlasov equation. Despite substantial progress on existence and uniqueness of fixed…
This paper investigates a partially observable queueing system with $N$ nodes in which each node has a dedicated arrival stream. There is an extra arrival stream to balance the load of the system by routing its customers to the shortest…
The expected level of linkage disequilibrium (LD) in a finite ideal population at equilibrium is of relevance for many applications in population and quantitative genetics. Several recursion formulae have been proposed during the last…
We consider a network equilibrium model (i.e. a combined model), which was proposed as an alternative to the classic four-step approach for travel forecasting in transportation networks. This model can be formulated as a convex minimization…
The objective of this paper is to initiate a qualitative analysis of dynamic flow in traffic networks by using the competitive equilibrium model of multiple market systems. A network is modeled as a dynamic graph where routes (edges) are…
Strong resilience properties of dynamical flow networks are analyzed for distributed routing policies. The latter are characterized by the property that the way the inflow at a non-destination node gets split among its outgoing links is…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
The random connection model is a random graph whose vertices are given by the points of a Poisson process and whose edges are obtained by randomly connecting pairs of Poisson points in a position dependent but independent way. We study…
In this paper, Lyapunov-Razumikhin technique, design of state-dependent switching laws, a fixed point theorem and variational methods are employed to derive the existence and the unique existence results of globally exponentially stable…