Estimating Censored Spatial-Temporal Demand with Applications to Shared Micromobility

Alice Paul; Kyran Flynn; Cassandra Overney

Home/Archive/arXiv

arXiv · 2303.09971

Estimating Censored Spatial-Temporal Demand with Applications to Shared Micromobility

Alice Paul·Kyran Flynn·Cassandra Overney

View original source ↗Read source document ↗Export metadata ↓

Abstract

In shared micromobility networks, such as bike-share and scooter-share networks, using trip data to accurately estimate demand in docked and dockless systems is critical to analyzing how the system is operating, such as identifying the number of dissatisfied users, operational costs, and equity in access, especially for city officials. However, the distribution of available bikes affects the distribution of observed trips. Users may walk from an unobserved cell location to an available bike masking the true location of user demand, and users may look for a bike and not find one, which is unobserved user demand. In collaboration with city planners from Providence, R.I., we present a flexible and interpretable framework to estimate spatial-temporal demand as a spatial non-homogeneous Poisson process that explicitly models how users choose a bike, bridging the gap between the docked and dockless methodology. Further, we present computational experiments highlighting that our method provides more accurate estimates of demand when there is incomplete availability compared to previous methods, and we comment on the results of our algorithm on data from Providence's dockless scooter-share network. Our estimation algorithm is publicly available through an efficient and user-friendly application designed for other city planners and organizations to help inform system planning.

Explore related subjects

stat.CO

Keep this discovery

BibTeX RIS

Alice Paul, Kyran Flynn, Cassandra Overney. 2023-03-17. Estimating Censored Spatial-Temporal Demand with Applications to Shared Micromobility. https://arxiv.org/abs/2303.09971

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

KEEP EXPLORING

Related papers

arXiv2026

Extended One-Liners for the Gamma, Poisson, and Binomial Distributions

We demonstrate explicit transformations of three independent uniforms with exact Gamma$(a,1)$, $a>0$, Poisson$(\lambda)$, $\lambda>0$, and Binomial$(N,p)$, $N\geq 1$, $0\leq p \leq 1$ laws using only elementary operations.

stat.CO↗

arXiv2026

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO↗

arXiv2026

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO↗