scholarly journals A STOCHASTIC ANALYSIS OF BIKE-SHARING SYSTEMS

Author(s):  
Shuang Tao ◽  
Jamol Pender

As more people move back into densely populated cities, bike sharing is emerging as an important mode of urban mobility. In a typical bike-sharing system (BSS), riders arrive at a station and take a bike if it is available. After retrieving a bike, they ride it for a while, then return it to a station near their final destinations. Since space is limited in cities, each station has a finite capacity of docks, which cannot hold more bikes than its capacity. In this paper, we study BSSs with stations having a finite capacity. By an appropriate scaling of our stochastic model, we prove a mean-field limit and a central limit theorem for an empirical process of the number of stations with k bikes. The mean-field limit and the central limit theorem provide insight on the mean, variance, and sample path dynamics of large-scale BSSs. We also leverage our results to estimate confidence intervals for various performance measures such as the proportion of empty stations, the proportion of full stations, and the number of bikes in circulation. These performance measures have the potential to inform the operations and design of future BSSs.

Author(s):  
Michael Fleermann ◽  
Werner Kirsch ◽  
Gabor Toth

AbstractWe study a multi-group version of the mean-field Ising model, also called Curie–Weiss model. It is known that, in the high-temperature regime of this model, a central limit theorem holds for the vector of suitably scaled group magnetisations, that is, for the sum of spins belonging to each group. In this article, we prove a local central limit theorem for the group magnetisations in the high-temperature regime.


2020 ◽  
Vol 31 (1) ◽  
Author(s):  
Hui Huang ◽  
Jinniao Qiu

AbstractIn this paper, we propose and study a stochastic aggregation–diffusion equation of the Keller–Segel (KS) type for modeling the chemotaxis in dimensions $$d=2,3$$ d = 2 , 3 . Unlike the classical deterministic KS system, which only allows for idiosyncratic noises, the stochastic KS equation is derived from an interacting particle system subject to both idiosyncratic and common noises. Both the unique existence of solutions to the stochastic KS equation and the mean-field limit result are addressed.


2021 ◽  
Vol 182 (3) ◽  
Author(s):  
Carina Geldhauser ◽  
Marco Romito

AbstractWe prove a mean field limit, a law of large numbers and a central limit theorem for a system of point vortices on the 2D torus at equilibrium with positive temperature. The point vortices are formal solutions of a class of equations generalising the Euler equations, and are also known in the literature as generalised inviscid SQG. The mean-field limit is a steady solution of the equations, the CLT limit is a stationary distribution of the equations.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Pierre Roux ◽  
Delphine Salort

<p style='text-indent:20px;'>The Nonlinear Noisy Leaky Integrate and Fire (NNLIF) model is widely used to describe the dynamics of neural networks after a diffusive approximation of the mean-field limit of a stochastic differential equation. In previous works, many qualitative results were obtained: global existence in the inhibitory case, finite-time blow-up in the excitatory case, convergence towards stationary states in the weak connectivity regime. In this article, we refine some of these results in order to foster the understanding of the model. We prove with deterministic tools that blow-up is systematic in highly connected excitatory networks. Then, we show that a relatively weak control on the firing rate suffices to obtain global-in-time existence of classical solutions.</p>


2008 ◽  
Vol 190 (3) ◽  
pp. 517-547 ◽  
Author(s):  
E. Caglioti ◽  
F. Rousset

2019 ◽  
Vol 51 (4) ◽  
pp. 1027-1066
Author(s):  
Thirupathaiah Vasantam ◽  
Arpan Mukhopadhyay ◽  
Ravi R. Mazumdar

AbstractIn this paper, we study a large multi-server loss model under the SQ(d) routeing scheme when the service time distributions are general with finite mean. Previous works have addressed the exponential service time case when the number of servers goes to infinity, giving rise to a mean field model. The fixed point of the limiting mean field equations (MFEs) was seen to be insensitive to the service time distribution in simulations, but no proof was available. While insensitivity is well known for loss systems, the models, even with state-dependent inputs, belong to the class of linear Markov models. In the context of SQ(d) routeing, the resulting model belongs to the class of nonlinear Markov processes (processes whose generator itself depends on the distribution) for which traditional arguments do not directly apply. Showing insensitivity to the general service time distributions has thus remained an open problem. Obtaining the MFEs in this case poses a challenge due to the resulting Markov description of the system being in positive orthant as opposed to a finite chain in the exponential case. In this paper, we first obtain the MFEs and then show that the MFEs have a unique fixed point that coincides with the fixed point in the exponential case, thus establishing insensitivity. The approach is via a measure-valued Markov process representation and the martingale problem to establish the mean field limit.


Sign in / Sign up

Export Citation Format

Share Document