Mathematics
Display Method:
2024,
54(8):
0801.
doi: 10.52396/JUSTC-2023-0136
Abstract:
In this note, we study the Yang–Mills bar connection\begin{document}$ A $\end{document} ![]()
![]()
, i.e., the curvature of \begin{document}$ A $\end{document} ![]()
![]()
obeys \begin{document}$ \bar{\partial}_{A}^{\ast}F_{A}^{0,2} = 0 $\end{document} ![]()
![]()
, on a principal \begin{document}$ G $\end{document} ![]()
![]()
-bundle \begin{document}$ P $\end{document} ![]()
![]()
over a compact complex manifold \begin{document}$ X $\end{document} ![]()
![]()
. According to the Koszul–Malgrange criterion, any holomorphic structure on \begin{document}$ P $\end{document} ![]()
![]()
can be seen as a solution to this equation. Suppose that \begin{document}$ G = SU(2) $\end{document} ![]()
![]()
or \begin{document}$ SO(3) $\end{document} ![]()
![]()
and \begin{document}$ X $\end{document} ![]()
![]()
is a complex surface with \begin{document}$ H^{1}(X,\mathbb{Z}_{2}) = 0 $\end{document} ![]()
![]()
. We then prove that the \begin{document}$ (0,2) $\end{document} ![]()
![]()
-part curvature of an irreducible Yang–Mills bar connection vanishes, i.e., \begin{document}$ (P,\bar{\partial}_{A}) $\end{document} ![]()
![]()
is holomorphic.
In this note, we study the Yang–Mills bar connection
2024,
54(8):
0802.
doi: 10.52396/JUSTC-2023-0036
Abstract:
A special class of cubic polynomials possessing decay of geometry property is studied. This class of cubic bimodal maps has generalized Fibonacci combinatorics. For maps with bounded combinatorics, we show that they have an absolutely continuous invariant measure.
A special class of cubic polynomials possessing decay of geometry property is studied. This class of cubic bimodal maps has generalized Fibonacci combinatorics. For maps with bounded combinatorics, we show that they have an absolutely continuous invariant measure.
2024,
54(8):
0803.
doi: 10.52396/JUSTC-2023-0163
Abstract:
This paper considers an\begin{document}$ n $\end{document} ![]()
![]()
-particle jump-diffusion system with mean filed interaction, where the coefficients are locally Lipschitz continuous. We address the convergence as \begin{document}$ n\to\infty $\end{document} ![]()
![]()
of the empirical measure of the jump-diffusions to the solution of a deterministic McKean–Vlasov equation. The strong well-posedness of the associated McKean–Vlasov equation and a corresponding propagation of chaos result are proven. In particular, we also provide precise estimates of the convergence speed with respect to a Wasserstein-like metric.
This paper considers an
2024,
54(3):
0305.
doi: 10.52396/JUSTC-2022-0111
Abstract:
Bowley reinsurance with asymmetric information means that the insurer and reinsurer are both presented with distortion risk measures but there is asymmetric information on the distortion risk measure of the insurer. Motivated by predecessors research, we study Bowley reinsurance with asymmetric information under the reinsurer’s default risk. We call this solution the Bowley solution under default risk. We provide Bowley solutions under default risk in a closed form under general assumptions. Finally, some numerical examples are provided to illustrate our main conclusions.
Bowley reinsurance with asymmetric information means that the insurer and reinsurer are both presented with distortion risk measures but there is asymmetric information on the distortion risk measure of the insurer. Motivated by predecessors research, we study Bowley reinsurance with asymmetric information under the reinsurer’s default risk. We call this solution the Bowley solution under default risk. We provide Bowley solutions under default risk in a closed form under general assumptions. Finally, some numerical examples are provided to illustrate our main conclusions.
2023,
53(12):
1208.
doi: 10.52396/JUSTC-2023-0019
Abstract:
Galois dual codes are a generalization of Euclidean dual codes and Hermitian dual codes. We show that the\begin{document}$ h $\end{document} ![]()
![]()
-Galois dual code of an algebraic geometry code \begin{document}$ C_{ {\cal{L}},F}(D,G) $\end{document} ![]()
![]()
from function field \begin{document}$ F/ \mathbb{F}_{p^e} $\end{document} ![]()
![]()
can be represented as an algebraic geometry code \begin{document}$ C_{\varOmega,F'}(\phi_{h}(D),\phi_{h}(G)) $\end{document} ![]()
![]()
from an associated function field \begin{document}$ F'/ \mathbb{F}_{p^e} $\end{document} ![]()
![]()
with an isomorphism \begin{document}$\phi_{h}:F\rightarrow F'$\end{document} ![]()
![]()
satisfying \begin{document}$ \phi_{h}(a) = a^{p^{e-h}} $\end{document} ![]()
![]()
for all \begin{document}$ a\in \mathbb{F}_{p^e} $\end{document} ![]()
![]()
. As an application of this result, we construct a family of h-Galois linear complementary dual maximum distance separable codes (h-Galois LCD MDS codes).
Galois dual codes are a generalization of Euclidean dual codes and Hermitian dual codes. We show that the
2023,
53(11):
1101.
doi: 10.52396/JUSTC-2023-0014
Abstract:
Accurate measurements of the tail risk of financial assets are major interest in financial markets. The main objective of our paper is to measure and forecast the value-at-risk (VaR) and the conditional value-at-risk (CoVaR) of financial assets using a new bivariate time series model. The proposed model can simultaneously capture serial dependence and cross-sectional dependence that exist in bivariate time series to improve the accuracy of estimation and prediction. In the process of model inference, we provide the parameter estimators of our bivariate time series model and give the estimators of VaR and CoVaR via the plug-in principle. We also establish the asymptotic properties of the Dvine model estimators. Real applications for financial stock price show that our model performs well in risk measurement and prediction.
Accurate measurements of the tail risk of financial assets are major interest in financial markets. The main objective of our paper is to measure and forecast the value-at-risk (VaR) and the conditional value-at-risk (CoVaR) of financial assets using a new bivariate time series model. The proposed model can simultaneously capture serial dependence and cross-sectional dependence that exist in bivariate time series to improve the accuracy of estimation and prediction. In the process of model inference, we provide the parameter estimators of our bivariate time series model and give the estimators of VaR and CoVaR via the plug-in principle. We also establish the asymptotic properties of the Dvine model estimators. Real applications for financial stock price show that our model performs well in risk measurement and prediction.
2023,
53(11):
1102.
doi: 10.52396/JUSTC-2022-0054
Abstract:
Exploring heterogeneity in causal effects has wide applications in the field of policy evaluation and decision-making. In recent years, researchers have begun employing machine learning methods to study causality, among which the most popular methods generally estimate heterogeneous treatment effects at the individual level. However, we argue that in large sample cases, identifying heterogeneity at the subgroup level is more intuitive and intelligble from a decision-making perspective. In this paper, we provide a tree-based method, called the generic causal tree (GCT), to identify the subgroup-level treatment effects in observational studies. The tree is designed to split by maximizing the disparity of treatment effects between subgroups, embedding a semiparametric framework for the improvement of treatment effect estimation. To accomplish valid statistical inference of the tree-based estimators of treatment effects, we adopt honest estimation to separate tree-building process and inference process. In the simulation, we show that the GCT algorithm has distinct advantages in subgroup identification and gives estimation with higher accuracy compared with the other two benchmark methods. Additionally, we verify the effectiveness of statistical inference by GCT.
Exploring heterogeneity in causal effects has wide applications in the field of policy evaluation and decision-making. In recent years, researchers have begun employing machine learning methods to study causality, among which the most popular methods generally estimate heterogeneous treatment effects at the individual level. However, we argue that in large sample cases, identifying heterogeneity at the subgroup level is more intuitive and intelligble from a decision-making perspective. In this paper, we provide a tree-based method, called the generic causal tree (GCT), to identify the subgroup-level treatment effects in observational studies. The tree is designed to split by maximizing the disparity of treatment effects between subgroups, embedding a semiparametric framework for the improvement of treatment effect estimation. To accomplish valid statistical inference of the tree-based estimators of treatment effects, we adopt honest estimation to separate tree-building process and inference process. In the simulation, we show that the GCT algorithm has distinct advantages in subgroup identification and gives estimation with higher accuracy compared with the other two benchmark methods. Additionally, we verify the effectiveness of statistical inference by GCT.
2023,
53(11):
1103.
doi: 10.52396/JUSTC-2022-0179
Abstract:
From a statistical viewpoint, it is essential to perform statistical inference in federated learning to understand the underlying data distribution. Due to the heterogeneity in the number of local iterations and in local datasets, traditional statistical inference methods are not competent in federated learning. This paper studies how to construct confidence intervals for federated heterogeneous optimization problems. We introduce the rescaled federated averaging estimate and prove the consistency of the estimate. Focusing on confidence interval estimation, we establish the asymptotic normality of the parameter estimate produced by our algorithm and show that the asymptotic covariance is inversely proportional to the client participation rate. We propose an online confidence interval estimation method called separated plug-in via rescaled federated averaging. This method can construct valid confidence intervals online when the number of local iterations is different across clients. Since there are variations in clients and local datasets, the heterogeneity in the number of local iterations is common. Consequently, confidence interval estimation for federated heterogeneous optimization problems is of great significance.
From a statistical viewpoint, it is essential to perform statistical inference in federated learning to understand the underlying data distribution. Due to the heterogeneity in the number of local iterations and in local datasets, traditional statistical inference methods are not competent in federated learning. This paper studies how to construct confidence intervals for federated heterogeneous optimization problems. We introduce the rescaled federated averaging estimate and prove the consistency of the estimate. Focusing on confidence interval estimation, we establish the asymptotic normality of the parameter estimate produced by our algorithm and show that the asymptotic covariance is inversely proportional to the client participation rate. We propose an online confidence interval estimation method called separated plug-in via rescaled federated averaging. This method can construct valid confidence intervals online when the number of local iterations is different across clients. Since there are variations in clients and local datasets, the heterogeneity in the number of local iterations is common. Consequently, confidence interval estimation for federated heterogeneous optimization problems is of great significance.
2023,
53(11):
1104.
doi: 10.52396/JUSTC-2023-0082
Abstract:
Distances between nodes are one of the most essential subjects in the study of complex networks. In this paper, we investigate the asymptotic behaviors of two types of distances in a model of geographic attachment networks (GANs): the typical distance and the flooding time. By generating an auxiliary tree and using a continuous-time branching process, we demonstrate that in this model the typical distance is asymptotically normal, and the flooding time converges to a given constant in probability as well.
Distances between nodes are one of the most essential subjects in the study of complex networks. In this paper, we investigate the asymptotic behaviors of two types of distances in a model of geographic attachment networks (GANs): the typical distance and the flooding time. By generating an auxiliary tree and using a continuous-time branching process, we demonstrate that in this model the typical distance is asymptotically normal, and the flooding time converges to a given constant in probability as well.
2023,
53(11):
1105.
doi: 10.52396/JUSTC-2022-0108
Abstract:
It is well known that regression methods designed for clean data will lead to erroneous results if directly applied to corrupted data. Despite the recent methodological and algorithmic advances in Gaussian graphical model estimation, how to achieve efficient and scalable estimation under contaminated covariates is unclear. Here a new methodology called convex conditioned innovative scalable efficient estimation (COCOISEE) for Gaussian graphical models under both additive and multiplicative measurement errors is developed. It combines the strengths of the innovative scalable efficient estimation in the Gaussian graphical model and the nearest positive semidefinite matrix projection, thus enjoying stepwise convexity and scalability. Comprehensive theoretical guarantees are provided and the effectiveness of the proposed methodology is demonstrated through numerical studies.
It is well known that regression methods designed for clean data will lead to erroneous results if directly applied to corrupted data. Despite the recent methodological and algorithmic advances in Gaussian graphical model estimation, how to achieve efficient and scalable estimation under contaminated covariates is unclear. Here a new methodology called convex conditioned innovative scalable efficient estimation (COCOISEE) for Gaussian graphical models under both additive and multiplicative measurement errors is developed. It combines the strengths of the innovative scalable efficient estimation in the Gaussian graphical model and the nearest positive semidefinite matrix projection, thus enjoying stepwise convexity and scalability. Comprehensive theoretical guarantees are provided and the effectiveness of the proposed methodology is demonstrated through numerical studies.
- First
- Prev
- 1
- 2
- 3
- 4
- 5
- Next
- Last
- Total:6
- To
- Go