CountryOfPapers CountryOfPapers
Journal list Promote
verified COP 2,0 · Q2 • database Scopus / SJR & Web of Science indexed
Annals of Applied Probability
United States · Institute of Mathematical St...
workspace_premium Q2 — Statistics, Probability and Uncertainty lock Subscription

Annals of Applied Probability

Annals of Applied Probability is a journal indexed in SJR in Statistics and Probability and Statistics, Probability and Uncertainty with an H index of 93. It has a COP Index of 2,0 (best band Q2). It is published in English. It has a COP Index of 2,0.

ISSN: 1050-5164
Publisher: Institute of Mathematical Statistics
Category: Statistics and Probability
Indexation: verifiedScopus / SJR verifiedWeb of Science
open_in_new Portal NPD menu_book Guidelines NPD
schedule CountryOfPapers database fields
COP Index trending_up
2,0 Q2

45 of 144 journals in Statistics, Probability and Uncertainty

H-index · SJR 93 · 1,574
Acceptance rate pie_chart
26% Selective
Source Acceptance_Rate
Time to publication hourglass_top
NPD
Field NPD
Publication cost (APC) payments
NPD Subscription
Non-OA path NPD

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

COP Index

2,0

Q2

SJR Impact

1,574

H-index

93

Docs (year)

147

Docs 3y

373

Total refs

6207

Cites 3y

716

Citable 3y

373

Cites/Doc 2y

1.87

Ref/Doc

42.22

Immediate OA

—

Embargoed OA

NPD

Non OA / Submission

—

shield Researcher voice

Name good journals. Call out predatory ones.

Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Asymptotic behavior of the Poisson-Dirichlet distribution for large mutation rate

View more

Width and mode of the profile for some random trees of logarithmic height

View more

Continuous first-passage percolation and continuous greedy paths model: Linear growth

View more

Complete corrected diffusion approximations for the maximum of a random walk

View more

Change point detection in network models: Preferential attachment and long range dependence

View more

Central limit theorem for the solution of the Kac equation

View more

Brownian moving averages have conditional full support

View more

Brownian models of open processing networks: canonical representation of workload

View more

Binomial approximations of shortfall risk for game options

View more

Aysmptotic Behavior of Absorbing Markov Chains Conditional on Nonabsorption for Applications in Conservation Biology

View more

Average optimality for continuous-time Markov decision processes in Polish spaces

View more

Atlas models of equity markets

View more
SHOW MORE ARTICLES

Asymptotically exact analysis of a loss network with channel continuity

View more

A CLT for information-theoretic statistics of Gram random matrices with a given variance profile

View more

Approximating geodesics via random points

View more

An explicit solution for an optimal stopping/optimal control problem which models an asset sale

View more

Almost sure central limit theorem for branching random walks in random environment

View more

Affine processes on positive semidefinite matrices

View more

Accuracy of state space collapse for earliest-deadline-first queues

View more

A transition function expansion for a diffusion model with selection

View more

A stochastically quasi-optimal search algorithm for the maximum of the simple random walk

View more

A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic

View more

A general framework for waves in random media with long-range correlations

View more

A functional central limit theorem for the M/GI/8 queue

View more

FAQs