SearcharxivSearch

arXiv · 2511.12476

Performance and Risk Analytics of Asian Exchange-Traded Funds

Abstract

Investing in Asian markets through exchange-traded funds (ETFs) provides investors with access to rapidly expanding economies and valuable diversification opportunities. This study examines the advantages and challenges of investing in Asian ETFs by conducting comprehensive risk assessments, portfolio analyses, and performance comparisons. The dataset comprises 29 ETFs offering exposure across a wide spectrum of Asian markets, including broad regional funds, country-specific ETFs, as well as sector-focused funds, dividend-oriented ETFs, small-cap portfolios, and emerging market bond ETFs. To evaluate risk and return dynamics, the study employs Markowitz's efficient frontier to identify optimal portfolios for given levels of risk, and conditional value-at-risk (CVaR) to capture potential extreme losses for a more comprehensive risk assessment. Multiple portfolio configurations are analyzed under long-only and long-short investment strategies to assess adaptability across varying market conditions. Furthermore, key performance risk measures, including the Sharpe ratio, Rachev ratio, and stable tail-adjusted return ratio (STARR), are calculated to provide an in-depth evaluation of reward-to-risk efficiency, with particular emphasis on the role of tail behavior in portfolio performance. This research aims to deliver deeper insights into the risk-return trade-offs, tail-risk behavior, and efficiency of Asian ETFs, offering investors a practical foundation for constructing robust and well-diversified portfolios across both emerging and developed Asian markets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bhathiya Divelgama, Nancy Asare Nyarko, Naa Sackley Dromo Aryee, Abootaleb Shirvani, Svetlozar T. Rachev. 2025-11-16. Performance and Risk Analytics of Asian Exchange-Traded Funds. https://arxiv.org/abs/2511.12476

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC