Search arXivSearch

arXiv · 2004.10008

The Impact of Smartphone Apps on Bike Sharing Systems

Abstract

Bike-sharing systems are exploding in cities around the world as more people are adopting sustainable transportation solutions for their everyday commutes. However, as more people use the system, riders often encounter that bikes or docks might not be available when they arrive to a station. As a result, many systems like CitiBike and Divvy provide riders with information about the network via smartphone apps so that riders can find stations with available bikes. However, not all customers have adopted the use of these smartphone apps for their station selection. By combining customer choice modeling and finite capacity queueing models, we explore the impact of the smartphone app technology to increase throughput and reduce blocking in bike sharing systems. To this end, we prove a mean-field limit and a central limit theorem for an empirical process of the number of stations with $k$ bikes. We also prove limit theorems for a new process called the ratio process, which characterizes the proportion of stations whose bike availability ratio lies within a particular partition of the interval [0,1]. For the mean field limit, we prove that the equilibrium exists, is unique, and that the stationary distribution of the empirical measure converges to a Dirac mass at the same equilibrium, thus showing an interchange of limits result ($\lim_{t\rightarrow \infty}\lim_{N\rightarrow \infty}=\lim_{N\rightarrow \infty}\lim_{t\rightarrow \infty}$). Our limit theorems provide insight on the mean, variance, and sample path dynamics of large scale bike-sharing systems. Our results illustrate that if we increase the proportion of customers that use smartphone app information, the entropy of the bike sharing network is reduced, and riders experience less blocking in the network.

Explore related subjects

Keep this discovery

BibTeXRIS

Shuang Tao, Jamol Pender. 2020-04-19. The Impact of Smartphone Apps on Bike Sharing Systems. https://arxiv.org/abs/2004.10008

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR