Computing absorbing times via fluid approximations
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2017/09/01
-
Journal
-
Indian UGC (journal)
-
Refrences23
-
Citations2
-
Nicolas Gast
-
Bruno Gaujal
Abstract
Cite
Gast, Nicolas, and Bruno Gaujal. “Computing Absorbing Times via Fluid Approximations”. Advances in Applied Probability, vol. 49, no. 3, 2017, pp. 768-90, https://doi.org/10.1017/apr.2017.21.
Gast, N., & Gaujal, B. (2017). Computing absorbing times via fluid approximations. Advances in Applied Probability, 49(3), 768-790. https://doi.org/10.1017/apr.2017.21
Gast, Nicolas, and Bruno Gaujal. “Computing Absorbing Times via Fluid Approximations”. Advances in Applied Probability 49, no. 3 (2017): 768-90. https://doi.org/10.1017/apr.2017.21.
Gast N, Gaujal B. Computing absorbing times via fluid approximations. Advances in Applied Probability. 2017;49(3):768-90.
Journal Categories
Science
Mathematics
Science
Mathematics
Probabilities
Mathematical statistics
You May Also Like
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Affine processes and applications in finance
- The asymptotic elasticity of utility functions and optimal investment in incomplete markets
- The second-order analysis of stationary point processes
- On the genealogy of large populations
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
The age of gossip | ACM SIGMETRICS Performance Evaluation Review | 10 | 2009 | |
Coupon Collector Problem for Non-Uniform Coupons and Random Quotas | The Electronic Journal of Combinatorics |
| 6 | 2013 |
Coupon Collecting with Quotas | The Electronic Journal of Combinatorics |
| 5 | 2008 |
| On a classical problem of probability theory | 1961 | |||
| Markov Chains and Mixing Times | 2009 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
Voter and Majority Dynamics with Biased and Stubborn Agents | Journal of Statistical Physics |
| 10 | 2020 |
Ensuring Persistent Content in Opportunistic Networks via Stochastic Stability Analysis | ACM Transactions on Modeling and Performance Evaluation of Computing Systems |
| 3 | 2018 |
Citations Analysis
| Category | Category Repetition |
|---|---|
| Science: Mathematics | 1 |
| Science: Physics | 1 |
| Science: Science (General): Cybernetics: Information theory | 1 |
The category
Science: Mathematics 1
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Ensuring Persistent Content in Opportunistic Networks via Stochastic Stability Analysis and was published in 2018. The most recent citation comes from a 2020 study titled Voter and Majority Dynamics with Biased and Stubborn Agents. This article reached its peak citation in 2020, with 1 citations. It has been cited in 2 different journals. Among related journals, the Journal of Statistical Physics cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.