Toward a Data Processing Pipeline for Mobile-Phone Tracking Data

Marcin Jurek; Catherine A. Calder; Corwin Zigler; Bethany Boettner; Christopher R. Browning

Home/Archive/arXiv

arXiv · 2507.00952

Toward a Data Processing Pipeline for Mobile-Phone Tracking Data

Marcin Jurek·Catherine A. Calder·Corwin Zigler·Bethany Boettner·Christopher R. Browning

View original source ↗Read source document ↗Export metadata ↓

Abstract

As mobile phones become ubiquitous, high-frequency smartphone positioning data are increasingly being used by researchers studying the mobility patterns of individuals as they go about their daily routines and the consequences of these patterns for health, behavioral, and other outcomes. A complex data pipeline underlies empirical research leveraging mobile phone tracking data. A key component of this pipeline is transforming raw, time-stamped positions into analysis-ready data objects, typically space-time "trajectories." In this paper, we break down a key portion of the data analysis pipeline underlying the Adolescent Health and Development in Context (AHDC) Study, a large-scale, longitudinal study of youth residing in the Columbus, OH metropolitan area. Recognizing that the bespoke "binning algorithm" used by AHDC researchers resembles a time-series filtering algorithm, we propose a statistical framework - a formal probability model and computational approach to inference - inspired by the binning algorithm for transforming noisy, time-stamped geographic positioning observations into mobility trajectories that capture periods of travel and stability. Our framework, unlike the binning algorithm, allows for formal smoothing via a particle Gibbs algorithm, improving estimation of trajectories as compared to the original binning algorithm. We argue that our framework can be used as a default data processing tool for future mobile-phone tracking studies.

Explore related subjects

stat.CO stat.AP

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Marcin Jurek, Catherine A. Calder, Corwin Zigler, Bethany Boettner, Christopher R. Browning. 2025-07-01. Toward a Data Processing Pipeline for Mobile-Phone Tracking Data. https://arxiv.org/abs/2507.00952

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↗