Arka P. Ghosh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Arka P. Ghosh has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Roitershtein
Department of Statistics Texas A&M University 77843 College Station TX USA
5 shared publications - Ananda Weerasinghe
Iowa State University
3 shared publications Alexander Roitershtein
Dept. of Statistics, Texas A&M University, College Station, TX
2 shared publications- Krishna B. Athreya
Iowa State University
2 shared publications - Sunder Sethuraman
Iowa State University
2 shared publications - Abdolghani Ebrahimi
Department of Industrial Engineering & Management Sciences, McCormick School of Engineering, Northwestern University, Evanston, IL 60208, USA
1 shared publication
Latest Publications
- 1 September 2021
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 501 (2)
Favorite sites of a persistent random walk
- 1 September 2021
- Published by Elsevier in Journal of Mathematical Analysis and Applications
- Vol. 501 (2)
Favorite sites of a persistent random walk
- 1 November 2020
- Published by Elsevier in Operations Research Letters
- Vol. 48 (6) , 737-743
Optimal control of a queue under a quality-of-service constraint with bounded and unbounded rates
- 1 November 2020
- Published by Elsevier in Operations Research Letters
- Vol. 48 (6) , 737-743
Optimal control of a queue under a quality-of-service constraint with bounded and unbounded rates
- 3 March 2017
- Published by Springer Nature in Queueing Systems
- Vol. 86 (1-2) , 35-60
Asymptotically optimal control of N-systems with $H_2^*$ H 2 ∗ service times under many-server heavy traffic- 3 March 2017
- Published by Springer Nature in Queueing Systems
- Vol. 86 (1-2) , 35-60
Asymptotically optimal control of N-systems with $H_2^*$ H 2 ∗ service times under many-server heavy traffic- 2 January 2016
- Published by Taru Publications in Journal of Interdisciplinary Mathematics
- Vol. 19 (1) , 1-35
Discrete-time Ornstein-Uhlenbeck process in a stationary dynamic environment
We study the stationary solution to the recursion Xn+1=γ Xn+ξn , where γ ∈ (0,1) is a constant and ξn are Gaussian variables with random parameters. Specifically, we assume that ξn=µn+σ nεn, where (εn)n∈ℤ is an i.i.d. sequence of standard normal variables and (µn, σn)n∈ℤ is a stationary and ergodic process independent of (εn)n∈ℤ, which serves as an exogenous dynamic environment for the model. We describe basic features of the stationary solution as a mixture of Gaussian random series, its asymptotic behavior when γ→1, and obtain limit theorems for its extreme values and partial sums.
- 2 January 2016
- Published by Taru Publications in Journal of Interdisciplinary Mathematics
- Vol. 19 (1) , 1-35
Discrete-time Ornstein-Uhlenbeck process in a stationary dynamic environment
We study the stationary solution to the recursion Xn+1=γ Xn+ξn , where γ ∈ (0,1) is a constant and ξn are Gaussian variables with random parameters. Specifically, we assume that ξn=µn+σ nεn, where (εn)n∈ℤ is an i.i.d. sequence of standard normal variables and (µn, σn)n∈ℤ is a stationary and ergodic process independent of (εn)n∈ℤ, which serves as an exogenous dynamic environment for the model. We describe basic features of the stationary solution as a mixture of Gaussian random series, its asymptotic behavior when γ→1, and obtain limit theorems for its extreme values and partial sums.
- Open Access
On the range of the transient frog model on Z
In this paper we observe the frog model, an infinite system of interacting random walks, on Z with an asymmetric underlying random walk. Under the assumption of transience with a fixed frog distribution, we construct an explicit formula for the moments of the lower bound of the model's long-run range, as well as their asymptotic limits as the drift of the underlying random walk vanishes. We also provide conditions in which the lower bound can be scaled to converge in probability to the degenerate distribution at 1 as the drift vanishes.
Open AccessOn the range of the transient frog model on Z
In this paper we observe the frog model, an infinite system of interacting random walks, on Z with an asymmetric underlying random walk. Under the assumption of transience with a fixed frog distribution, we construct an explicit formula for the moments of the lower bound of the model's long-run range, as well as their asymptotic limits as the drift of the underlying random walk vanishes. We also provide conditions in which the lower bound can be scaled to converge in probability to the degenerate distribution at 1 as the drift vanishes.
- 19 May 2014
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 142 (9) , 3269-3283
On a directionally reinforced random walk
We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizsäcker. Our main result is a stable limit theorem for the position of the random walk in higher dimensions. This extends a result of Horváth and Shao that was previously obtained in dimension one only (however, in a more stringent functional form).
- 19 May 2014
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 142 (9) , 3269-3283
On a directionally reinforced random walk
We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizsäcker. Our main result is a stable limit theorem for the position of the random walk in higher dimensions. This extends a result of Horváth and Shao that was previously obtained in dimension one only (however, in a more stringent functional form).
- 19 March 2014
- Published by Springer Nature in Queueing Systems
- Vol. 78 (1) , 57-97
Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic
- 19 March 2014
- Published by Springer Nature in Queueing Systems
- Vol. 78 (1) , 57-97
Scheduling control for Markov-modulated single-server multiclass queueing systems in heavy traffic
- 2 October 2013
- Published by Taylor & Francis in Stochastic Models
- Vol. 29 (4) , 497-517
Optimal Rate for a Queueing System in Heavy Traffic with Superimposed On-Off Arrivals
A rate control problem is addressed for a queueing system in heavy traffic. The arrival process is a stationary heavy-tailed On-Off process and service is done at a constant rate (controlled). With an infinite horizon discounted cost function, the main result shows the existence of an optimal rate and specifies a bound on this optimal rate. As a part of the analysis, we solve an approximating control problem driven by fractional Brownian motion. We also derive an asymptotic maximal bound on the second moment of the centered On-Off process, which is a key ingredient of the proof and is of independent interest.
- 2 October 2013
- Published by Taylor & Francis in Stochastic Models
- Vol. 29 (4) , 497-517
Optimal Rate for a Queueing System in Heavy Traffic with Superimposed On-Off Arrivals
A rate control problem is addressed for a queueing system in heavy traffic. The arrival process is a stationary heavy-tailed On-Off process and service is done at a constant rate (controlled). With an infinite horizon discounted cost function, the main result shows the existence of an optimal rate and specifies a bound on this optimal rate. As a part of the analysis, we solve an approximating control problem driven by fractional Brownian motion. We also derive an asymptotic maximal bound on the second moment of the centered On-Off process, which is a key ingredient of the proof and is of independent interest.
- 1 January 2012
- Published by Taylor & Francis in Stochastic Models
- Vol. 28 (1) , 63-108
Heavy Traffic Approximations of a Queue with Varying Service Rates and General Arrivals
Heavy traffic limit theorems are established for a class of single server queueing models including those with heavy-tailed or long-range dependent arrivals and time-varying service rates. The models are motivated by wireless queueing systems for which there is an increasing evidence of the presence of heavy-tailed or long-range dependent arrivals, and where the service rates vary with the changes in the wireless medium. The main focus of the paper is to obtain the different possible limit processes that can arise depending on the relationship between scalings for both the arrival and departure processes. The limit processes obtained here are driven by either Brownian motion (when the contribution from the departure process dominates the limit) or the limits of properly scaled arrivals (when the contribution from the arrival process dominates the limit), typical examples being stable Lévy motion or fractional Brownian motion. In particular, for the case where arrival process is given by the infinite source Poisson process, this relationship, which determines the type of the limiting queue-length process, is a simple condition involving the heavy tail exponent, arrival rate and channel variation parameter in the wireless medium model. To establish these limit results, two approaches are studied. In one approach, when the limit is driven by Brownian motion, the perturbed test function method is extended to incorporate reflection. In contrast, the second approach allows for non-Markovian and/or non-Gaussian driving processes in the limit. Both approaches involve averaging in the drift term arising from random service rates at the departures. In the second approach, this averaging is carried out directly and pathwise, thus sidestepping the assumption of driving Brownian motion used in the perturbed test function method.
- 1 January 2012
- Published by Taylor & Francis in Stochastic Models
- Vol. 28 (1) , 63-108
Heavy Traffic Approximations of a Queue with Varying Service Rates and General Arrivals
Heavy traffic limit theorems are established for a class of single server queueing models including those with heavy-tailed or long-range dependent arrivals and time-varying service rates. The models are motivated by wireless queueing systems for which there is an increasing evidence of the presence of heavy-tailed or long-range dependent arrivals, and where the service rates vary with the changes in the wireless medium. The main focus of the paper is to obtain the different possible limit processes that can arise depending on the relationship between scalings for both the arrival and departure processes. The limit processes obtained here are driven by either Brownian motion (when the contribution from the departure process dominates the limit) or the limits of properly scaled arrivals (when the contribution from the arrival process dominates the limit), typical examples being stable Lévy motion or fractional Brownian motion. In particular, for the case where arrival process is given by the infinite source Poisson process, this relationship, which determines the type of the limiting queue-length process, is a simple condition involving the heavy tail exponent, arrival rate and channel variation parameter in the wireless medium model. To establish these limit results, two approaches are studied. In one approach, when the limit is driven by Brownian motion, the perturbed test function method is extended to incorporate reflection. In contrast, the second approach allows for non-Markovian and/or non-Gaussian driving processes in the limit. Both approaches involve averaging in the drift term arising from random service rates at the departures. In the second approach, this averaging is carried out directly and pathwise, thus sidestepping the assumption of driving Brownian motion used in the perturbed test function method.
- Open Access
On a directionally reinforced random walk
We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizs\"{a}cker in \cite{drw}. Our main result is a stable limit theorem for the position of the random walk in higher dimensions. This extends a result of Horv\'{a}th and Shao \cite{limits} that was previously obtained in dimension one only (however, in a more stringent functional form).
Open AccessOn a directionally reinforced random walk
We consider a generalized version of a directionally reinforced random walk, which was originally introduced by Mauldin, Monticino, and von Weizs\"{a}cker in \cite{drw}. Our main result is a stable limit theorem for the position of the random walk in higher dimensions. This extends a result of Horv\'{a}th and Shao \cite{limits} that was previously obtained in dimension one only (however, in a more stringent functional form).