Groups with specific curvature have a regular language of geodesics.
problem Understanding the language of geodesics in non-positively curved triangle groups.
method Proving finitely many cone types and regularity of geodesic languages.
result The language of lexicographically first geodesics is regular and satisfies the fellow traveller property.
We study geodesics on the modular surface, comparing WP and hyperbolic metrics.
problem Comparing geodesics on the modular surface under different metrics.
method Lift WP geodesics to the universal cover, analyze geometric properties, and compare deviations.
result WP and hyperbolic geodesics fellow-travel in the thick part of the universal cover.
We review and organize some results describing the behavior of a Teichmüller geodesic and draw several applications: 1) We show that Teichmüller geodesics do not back track. 2) We show that a Teichmüller geodesic segment whose endpoints are in the thick part has the fellow travelling property. This fails when the endpo…
Given a measured geodesic lamination on a hyperbolic surface, grafting the surface along multiples of the lamination defines a path in Teichmuller space, called the grafting ray. We show that every grafting ray, after reparametrization, is a Teichmuller quasi-geodesic and stays in a bounded neighborhood of a Teichmulle…
We show that the Hausdorff distance between any forward and any backward surgery paths in the sphere graph is at most 2. From this it follows that the Hausdorff distance between any two surgery paths with the same initial sphere system and same target sphere system is at most 4. Our proof relies on understanding how su…
New proof for hyperbolic groups using contracting boundaries of cusped spaces.
problem Proving groups are hyperbolic relative to subgroups.
method Proving compact contracting boundary of cusped space implies hyperbolicity.
result If cusped space Gh has compact contracting boundary, then G is hyperbolic relative to subgroups H. Suppose G is a finitely generated group and H is a subgroup of G. Let ∂cFQG denote the contracting boundary of G with the topology of fellow travelling quasi-geodesics defined by Cashen-Mackay \cite{cashen2017}. In this article, we show that if the limit set Λ(H) of H in $…
Paper reconstructs compact Riemannian manifolds from travel time data.
problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of compact Riemannian manifolds from travel time data.
STAD improves travel time estimation by learning from real traffic data.
problem Travel time estimation using GPS traces is inaccurate and requires offline optimization.
method STAD uses machine learning and real-time trip data to adjust travel time estimates.
result STAD reduces median absolute errors by 14% in Doha and New York City, and 29% in Porto.
Social media systems rely on user feedback and rating mechanisms for personalization, ranking, and content filtering. However, when users evaluate content contributed by fellow users (e.g., by liking a post or voting on a comment), these evaluations create complex social feedback effects. This paper investigates how ra…
The Euclidean traveller explores various geometric spaces, seeing different places in each.
problem Understanding the Euclidean traveller's itinerary in different geometric spaces.
method Analyzing the geometric spaces and the traveller's paths.
result The traveller sees a variety of places in different geometric spaces, including tori, closed hyperbolic surfaces, and manifolds.
We explore the impact of learning paradigms on training deep neural networks for the Travelling Salesman Problem. We design controlled experiments to train supervised learning (SL) and reinforcement learning (RL) models on fixed graph sizes up to 100 nodes, and evaluate them on variable sized graphs up to 500 nodes. Be…
The emergence of data-driven demand analysis has led to the increased use of generative modelling to learn the probabilistic dependencies between random variables. Although their apparent use has mostly been limited to image recognition and classification in recent years, generative machine learning algorithms can be a…
Bayesian framework predicts post-disruption travel times in metro networks.
problem Uncertainty in post-disruption travel times in metro networks.
method Bayesian spatiotemporal modeling framework capturing train interactions and non-Gaussian distributional characteristics.
result The proposed models consistently outperform baseline specifications in point prediction and uncertainty quantification.
This study uses Twitter to analyze traveler behavior in Manhattan.
problem Analyzing traveler behavior using social media data.
method Systematic method to extract displacement information from geo-tagged tweets.
result Twitter reveals unique demographics and travel behavior patterns.
Travel decisions tend to exhibit sensitivity to uncertainty and information processing constraints. These behavioural conditions can be characterized by a generative learning process. We propose a data-driven generative model version of rational inattention theory to emulate these behavioural representations. We outlin…
Method estimates travel times on urban roads using Uber data.
problem Estimating travel times on urban roads where data is scarce.
method Graph representation, trip sampling, least-squares optimization.
result Estimates travel times on arterial roads using aggregated Uber data.
New proofs confirm travel time data determine simple metrics on a disc.
problem Determining a simple Riemannian metric from travel time data.
method Proofs based on Myers-Steenrod theorem, Lipschitz-type stability estimate.
result Travel time data determine a simple Riemannian metric on a disc up to natural gauge.
Method recovers obstacles from travel times on curved surfaces.
problem Recovering obstacles from travel times on curved surfaces.
method Extending Noakes and Stoyanov's method to Riemannian surfaces with curvature constraints.
result Obstacles can be recovered from travel times on Riemannian surfaces under certain curvature conditions.
Paper addresses travel time tomography stability and statistical inversion.
problem Determining conformal factors of metrics from geodesic lengths.
method Established forward and inverse stability estimates; applied to Bayesian statistical inversion.
result Consistency of statistical inversion technique for travel time tomography.
Study highlights fairness issues in travel behavior prediction models.
problem Ethical challenges in travel behavior analysis using machine learning.
method Operationalized computational fairness by equality of opportunity; compared DNN and DCM; introduced absolute correlation regularization.
result Both DNN and DCM predict disparities across social groups, with DNN outperforming DCM in prediction disparities.
Financial derivatives based on road travel times for hedging and pricing.
problem Market risk in crypto and banking sectors.
method Modeling travel time data with CARMA models and applying risk-neutral pricing.
result Derivatives pricing based on travel time and its volatility.
Over the last few years, traffic data has been exploding and the transportation discipline has entered the era of big data. It brings out new opportunities for doing data-driven analysis, but it also challenges traditional analytic methods. This paper proposes a new Divide and Combine based approach to do K means clust…
Recover simple irreversible Finsler geometry from travel time data
problem Stable recovery of a simple irreversible Finsler geometry
method Use a Gromov-Hausdorff distance adapted to irreversible metric spaces
result Unique and Lipschitz-stable recovery
Same travelling times imply identical obstacles in Riemannian manifolds.
problem Determining if two sets of obstacles are identical based on travel times.
method Analyzing curvature conditions and geodesic intersections.
result Disjoint convex obstacles with identical travel times are identical.
Billiard trajectories in curved spaces have predictable travel times.
problem Understanding travel times in billiard trajectories on curved surfaces.
method Analyzing geodesic flows and sectional curvature to prove time-preserving conjugacy.
result Billiard trajectories with almost identical obstacles have identical shapes.
Study uses neural networks to predict travel times for public transportation.
problem Inaccurate travel time predictions due to road traffic irregularities.
method Developed two neural network models (MLP and LSTM) using OD travel time matrix.
result Both models can make near-accurate predictions, but LSTM is more susceptible to noise.
In building intelligent transportation systems such as taxi or rideshare services, accurate prediction of travel time and distance is crucial for customer experience and resource management. Using the NYC taxi dataset, which contains taxi trips data collected from GPS-enabled taxis [23], this paper investigates the use…
To study users' travel behaviour and travel time between origin and destination, researchers employ travel surveys. Although there is consensus in the field about the potential, after over ten years of research and field experimentation, Smartphone-based travel surveys still did not take off to a large scale. Here, com…
Study shows stability of travel time data reconstruction from closed subsets.
problem Reconstruction of length spaces from travel time data on a closed subset.
method Lipschitz stability proof for certain types of length spaces.
result Reconstruction of length spaces is Lipschitz stable from travel time data on a closed subset.
TripDecoder recovers metro routes and travel times from smart card data.
problem Recover unknown routes and travel times in metro systems.
method Decouples two inference tasks: travel time and route preference.
result TripDecoder improves accuracy and efficiency compared to competitors.
Study travel time tomography for transversely isotropic media using modified pseudodifferential calculus.
problem Travel time tomography problem for transversely isotropic media.
method Modified scattering pseudodifferential calculus to solve the tomography problem.
result Construction and use of modified pseudodifferential calculus to solve the tomography problem.
Model predicts travel time under rare conditions using a vector-space model.
problem Predicting travel time under rare temporal conditions (e.g., holidays, school vacations) is challenging due to limited historical data and other temporal changes.
method Presented a vector-space model for encoding rare temporal conditions, allowing coherent representation learning across different conditions.
result Increased performance for travel time prediction over different baselines when using the vector-space encoding for representing the temporal setting.
If a document is about travel, we may expect that short snippets of the document should also be about travel. We introduce a general framework for incorporating these types of invariances into a discriminative classifier. The framework imagines data as being drawn from a slice of a Levy process. If we slice the Levy pr…
Bayesian calibration improves ABMs for predicting travel patterns.
problem Calibrating ABMs for accurate travel pattern predictions.
method Gaussian Process emulator with deep learning dimensionality reduction for high-dimensional, non-stationary data.
result Improved accuracy in predicting travel patterns using traffic flow data.
Recent years have witnessed an increased focus on interpretability and the use of machine learning to inform policy analysis and decision making. This paper applies machine learning to examine travel behavior and, in particular, on modeling changes in travel modes when individuals are presented with a novel (on-demand)…
ProbETA models travel time correlations between trips for better navigation.
problem Trip correlations not captured by existing methods.
method Deep hierarchical joint probabilistic model with learnable link representations.
result ProbETA outperforms state-of-the-art methods with 12.60% MAPE reduction.
Boosting algorithms improve delivery time prediction in postal services.
problem Challenges in long-term travel time prediction for postal services.
method Investigated linear regression models, tree-based ensembles (random forest, bagging, boosting), and compared their performance.
result Boosting algorithms, especially light gradient boosting and catboost, outperform other methods in accuracy and runtime efficiency.
Two novel models predict bus travel times with uncertainty, improving connection assurance.
problem Improving bus connection assurance by handling travel time uncertainty.
method Two novel approaches: Deep Quantile Regression (DQR) and Bayesian Recurrent Neural Networks (BRNN).
result DQR model performs best for 80%, 90%, and 95% prediction intervals, with small underestimation.
Study on travel time formulas in a lake with wind flow.
problem Travel time in a lake with wind flow.
method Geometric approach using Finsler metrics.
result Formulas for distances and travel times derived.
Dynamic linear models improve travel time prediction for congested freeways.
problem Accurate travel time prediction for congested freeways.
method Dynamic linear models (DLMs) with time-varying parameters.
result Significant improvements in travel time prediction accuracy, especially for short-term predictions.
A sufficient knowledge of the demographics of a commuting public is essential in formulating and implementing more targeted transportation policies, as commuters exhibit different ways of traveling. With the advent of the Automated Fare Collection system (AFC), probing the travel patterns of commuters has become less i…
Bayesian model identifies three types of travelers adapting to feedback.
problem Capturing adaptive, feedback-driven travel behavior in heterogeneous individuals.
method Latent Class Reinforcement Learning (LCRL) model with Variational Bayes estimation.
result Three distinct traveler classes identified: context-dependent, persistent exploitative, and exploratory.
Accurate and reliable travel time predictions in public transport networks are essential for delivering an attractive service that is able to compete with other modes of transport in urban areas. The traditional application of this information, where arrival and departure predictions are displayed on digital boards, is…
New model predicts travel demand uncertainty with high accuracy.
problem Uncertainty and sparsity in sparse travel demand prediction.
method Spatial-Temporal Zero-Inflated Negative Binomial Graph Neural Network (STZINB-GNN).
result STZINB-GNN outperforms benchmarks in predicting travel demand uncertainty.
We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming is the wide-spread use of Gaussian probability dens…
Simultaneously estimates travel times and route choice model parameters.
problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.
Alt-GNNs improve travel mode choice modeling by integrating graph neural networks with GEV models.
problem Capturing alternative dependence in discrete choice models with predefined, symmetric, and uniform dependence.
method Introducing Alternative Graph Neural Networks (Alt-GNNs) that embed alternative dependence within a unified framework.
result Alt-GNNs significantly improve predictive performance over benchmark models in travel mode choice datasets.