Obliquely reflecting Brownian motion in nonpolyhedral, piecewise smooth cones, with an example of application to diffusion approximation of bandwidth-sharing queues

This work gives sufficient conditions for uniqueness in distribution of semimartingale, obliquely reflecting Brownian motion in a nonpolyhedral, piecewise $$\mathcal {C}^2$$ cone, with radially constant, Lipschitz continuous direction of reflection on each face. The conditions are shown to be verified by the conjectured diffusion approximation to the workload in a class of bandwidth-sharing networks, thus ensuring that the conjectured limit is uniquely characterized. This is an essential step in proving the diffusion approximation. This uniqueness result is made possible by replacing the Krein–Rutman theorem used by Kwon and Williams (1993) in a smooth cone with the recent reverse ergodic theorem for inhomogeneous, killed Markov chains of Costantini and Kurtz (Ann Appl Probab, 2024. https://doi.org/10.1214/23-AAP2047 ; Stoch Process Appl 170:104295, 2024. https://doi.org/10.1016/j.spa.2024.104295 ).

Authors

Publication Details

Journal
Queueing Systems
Published
2024-12-04
DOI
https://doi.org/10.1007/s11134-024-09930-1
Primary Topic
Stochastic processes and statistical mechanics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Obliquely reflecting Brownian motion in nonpolyhedral, piecewise smooth cones, with an example of application to diffusion approximation of bandwidth-sharing queues

Cristina Costantini
Queueing Systems
Stochastic processes and statistical mechanics
article

Obliquely reflecting Brownian motion in nonpolyhedral, piecewise smooth cones, with an example of application to diffusion approximation of bandwidth-sharing queues

Cristina Costantini
article en

Abstract

This work gives sufficient conditions for uniqueness in distribution of semimartingale, obliquely reflecting Brownian motion in a nonpolyhedral, piecewise $$\mathcal {C}^2$$ cone, with radially constant, Lipschitz continuous direction of reflection on each face. The conditions are shown to be verified by the conjectured diffusion approximation to the workload in a class of bandwidth-sharing networks, thus ensuring that the conjectured limit is uniquely characterized. This is an essential step in proving the diffusion approximation. This uniqueness result is made possible by replacing the Krein–Rutman theorem used by Kwon and Williams (1993) in a smooth cone with the recent reverse ergodic theorem for inhomogeneous, killed Markov chains of Costantini and Kurtz (Ann Appl Probab, 2024. https://doi.org/10.1214/23-AAP2047 ; Stoch Process Appl 170:104295, 2024. https://doi.org/10.1016/j.spa.2024.104295 ).

Queueing SystemsVol. 109(1)
Università degli Studi G. d'Annunzio Chieti - Pescara
Openalex Percentile: Top 63%
Stochastic processes and statistical mechanics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.