The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Bayesian Inference on Network Traffic Using Link Count Data
Abstract
We study Bayesian models and methods for analysing network traffic counts in problems of inference about the traffic intensity between directed pairs of origins and destinations in networks. This is a class of problems very recently discussed by Vardi in a 1996 JASA article and is of interest in both communication and transportation network studies. The current article develops the theoretical framework of variants of the origin-destination flow problem and introduces Bayesian approaches to analysis and inference. In the first, the so-called fixed routing problem, traffic or messages pass between nodes in a network, with each message originating at a specific source node, and ultimately moving through the network to a predetermined destination node. All nodes are candidate origin and destination points. The framework assumes no travel time complications, considering only the number of messages passing between pairs of nodes in a specified time interval. The route count, or route flow, problem is to infer the set of actual number of messages passed between each directed origin-destination pair in the time interval, based on the observed counts flowing between all directed pairs of adjacent nodes. Based on some development of the theoretical structure of the problem and assumptions about prior distributional forms, we develop posterior distributions for inference on actual origin-destination counts and associated flow rates. This involves iterative simulation methods, or Markov chain Monte Carlo (MCMC), that combine Metropolis–Hastings steps within an overall Gibbs sampling framework. We discuss issues of convergence and related practical matters, and illustrate the approach in a network previously studied in Vardi's article. We explore both methodological and applied aspects much further in a concrete problem of a road network in North Carolina, studied in transportation flow assessment contexts by civil engineers. This investigation generates critical insight into limitations of statistical analysis, and particularly of non-Bayesian approaches, due to inherent structural features of the problem. A truly Bayesian approach, imposing partial stochastic constraints through informed prior distributions, offers a way of resolving these problems and is consistent with prevailing trends in updating traffic flow intensities in this field. Following this, we explore a second version of the problem that introduces elements of uncertainty about routes taken by individual messages in terms of Markov selection of outgoing links for messages at any given node. For specified route choice probabilities, we introduce the concept of a super-network—namely, a fixed routing problem in which the stochastic problem may be embedded. This leads to solution of the stochastic version of the problem using the methods developed for the original formulation of the fixed routing problem. This is also illustrated. Finally, we discuss various related issues and model extensions, including inference on stochastic route choice selection probabilities, questions of missing data and partially observed link counts, and relationships with current research on road traffic network problems in which travel times within links are nonnegligible and may be estimated from additional data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
Urban transportation networks: Equilibrium analysis with mathematical programming methods
(1986) · Transportation Research Part A: General · doi:10.1016/0191-2607(86)90023-3 · Cited by 2,349
Markov Chain Monte Carlo in Practice.
Kass, R. E., Gilks, W. R., Richardson, S., & Spiegelhalter, D. J. (1997) · Journal of the American Statistical Association · doi:10.2307/2965438 · Cited by 1,380
Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
Vardi, Y. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476697 · Cited by 794
The most likely trip matrix estimated from traffic counts
van Zuylen, H. J., & Willumsen, L. G. (1980) · Transportation Research Part B Methodological · doi:10.1016/0191-2615(80)90008-9 · Cited by 623
Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach
Maher, M. J. (1983) · Transportation Research Part B: Methodological · doi:10.1016/0191-2615(83)90030-9 · Cited by 376
MAXIMUM LIKELIHOOD ESTIMATION OF GRAVITY MODEL PARAMETERS
Sen, A. (1986) · Journal of Regional Science · doi:10.1111/j.1467-9787.1986.tb01054.x · Cited by 39
Cited by
BART: Bayesian additive regression trees
Chipman, H. A., George, E. I., & McCulloch, R. E. (2010) · The Annals of Applied Statistics · doi:10.1214/09-aoas285 · Cited by 1,542
Deep learning for short-term traffic flow prediction
Polson, N. G., & Sokolov, V. O. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.02.024 · Cited by 1,015
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766
Coates, A., Hero III, A. O., Nowak, R., & Yu, B. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.998081 · Cited by 529
Development of origin–destination matrices using mobile phone call data
Iqbal, M. S., Choudhury, C. F., Wang, P., & González, M. C. (2014) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2014.01.002 · Cited by 507
Metadata
- Authors
- Tebaldi, C., & West, M.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 1998-06
- Volume
- 93
- Issue
- 442
- Pages
- 557-573
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W1970202913
- Cited by
- 333
- References
- 9
- FWCI
- 3.07
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bayesian Inference on Network Traffic Using Link Count Data. https://app.cochat.ai/papers/10.1080/01621459.1998.10473707
- The paper
- Tebaldi, C., & West, M. (1998). Bayesian Inference on Network Traffic Using Link Count Data. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.1998.10473707
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.