大型车辆共享模型的系综等价性
Equivalence of ensembles for large vehicle-sharing models
摘要：
针对一类容量受限的大型闭Jackson网络，利用局部极限定理，在较弱的假设条件下，证明了网络节点在正常业务阶段的渐近独立性.队列的极限分布是显式的。在统计力学的术语，系综的等价性-典型的和巨典型的-被证明为特定的边缘。该框架包括两种类型的节点的网络的情况下：单服务器/有限容量的节点和无限服务器/无限容量的节点，可以作为基本模型的自行车共享系统。利用广义阻塞和重路由过程来模拟局部饱和效应，证明了系统的稳态具有乘积形式。然后可以使用巨正则近似来调整自行车的总数和站点的容量以满足预期需求。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
