Equivalence of ensembles for large vehicle-sharing models

DOI10.1214/16-AAP1219zbMATH Open1370.60166arXiv1507.07792OpenAlexW2207621404MaRDI QIDQ2013572FDOQ2013572

Danielle Tibi, Christine Fricker

Publication date: 8 August 2017

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: 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 distributions of the queues are explicit. In the Statistical Mechanics terminology, the equivalence of ensembles - canonical and grand canonical - is proved for specific marginals. The framework includes the case of networks with two types of nodes: single server/finite capacity nodes and infinite servers/infinite capacity nodes, that can be taken as basic models for bike-sharing systems. The effect of local saturation is modeled by generalized blocking and rerouting procedures, under which the stationary state is proved to have product-form. The grand canonical approximation can then be used for adjusting the total number of bikes and the capacities of the stations to the expected demand.

Full work available at URL: https://arxiv.org/abs/1507.07792

Recommendations

• Fluid and diffusion limits for bike sharing systems
• Mean field analysis for inhomogeneous bike sharing systems
• A unified framework for analyzing closed queueing networks in bike sharing systems
• Two-choice regulation in heterogeneous closed networks
• Fleet-sizing and service availability for a vehicle rental system via closed queueing networks

zbMATH Keywords

asymptotic independencelocal limit theoremclosed Jackson networksfinite capacity queuesproduct form distributionequivalent ensembles

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Traffic problems in operations research (90B20)

Cited In (3)

• An incentive algorithm for a closed stochastic network: data and mean-field analysis
• A Unified Framework for Analyzing Closed Queueing Networks in Bike Sharing Systems
• A mean-field matrix-analytic method for bike sharing systems under Markovian environment

This page was built for publication: Equivalence of ensembles for large vehicle-sharing models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013572)