arXiv subjects

Xianyue Li

Publications and source records attributed to Xianyue Li.

4 recordsLinked to original sources

arXiv2026

Multi-Trigger Crypto CAT Bonds with On-Chain Settlement: Valuation and Optimal Design

Cryptocurrencies have experienced repeated large-scale losses from protocol exploits and exchange breaches, exposing insurers and investors to severe operational risks. This paper develops an equilibrium pricing framework for catastrophe bonds tailored to the cryptocurrency ecosystem. We introduce a double-trigger structure that jointly captures short-term catastrophic shocks and longer-term systemic deterioration. To model the multi-risk environment, we incorporate dual dependence, combining dependence across triggers with multivariate dependence among financial risk factors through vine copulas. Beyond expected prices, we characterize the full distribution of discounted cash flows and return rates, enabling risk-sensitive metrics such as Value-at-Risk and Tail Value-at-Risk. Furthermore, we propose an on-chain settlement architecture where calibrated payout functions are embedded directly into smart contracts. This design eliminates basis risk associated with settlement delays and minimizes the agency costs inherent in traditional intermediation. Our results demonstrate that multi-trigger crypto CAT bonds offer a statistically robust and economically efficient vehicle for transferring systemic digital asset risks to capital markets.

stat.AP↗

arXiv2026

GES-TSP: Graph Edge Sparsification for TSP

Solving large-scale instances of the Traveling Salesman Problem (TSP) exactly is computationally expensive. Researchers often employ graph sparsification methods to improve computational efficiency. Traditional sparsification methods typically rely on fixed heuristics and fail to fully exploit instance-specific structural information. In this paper, we propose Graph Edge Sparsification (GES), a learning-based sparsification approach for Euclidean TSP. By incorporating geometric structural information and combinatorial optimization technology, our proposed method adaptively generates a sparsification graph for different instances, significantly reducing the graph size and accelerating the solving process. Experimental results demonstrate that our sparsification method can prune up to 95% of edges on the MATILDA dataset, while keeping the solution gap within 1% of the optimal value. Moreover, our approach exhibits strong generalization capability on the TSPLIB benchmark.In some large-scale instances, the pruning rate exceeds 99%, while the optimality gap remains below 1%.

cs.AI↗

arXiv2023

On anti-Kekulé and $s$-restricted matching preclusion problems

The anti-Kekulé number of a connected graph $G$ is the smallest number of edges whose deletion results in a connected subgraph having no Kekulé structures (perfect matchings). As a common generalization of (conditional) matching preclusion number and anti-Kekulé number of a graph $G$, we introduce $s$-restricted matching preclusion number of $G$ as the smallest number of edges whose deletion results in a subgraph without perfect matchings such that each component has at least $s+1$ vertices. In this paper, we first show that conditional matching preclusion problem and anti-Kekulé problem are NP-complete, respectively, then generalize this result to $s$-restricted matching preclusion problem. Moreover, we give some sufficient conditions to compute $s$-restricted matching preclusion numbers of regular graphs. As applications, $s$-restricted matching preclusion numbers of complete graphs, hypercubes and hyper Petersen networks are determined.

math.CO↗

arXiv2019

The complexity of total edge domination and some related results on trees

For a graph $G = (V, E)$ with vertex set $V$ and edge set $E$, a subset $F$ of $E$ is called an $\emph{edge dominating set}$ (resp. a $\emph{total edge dominating set}$) if every edge in $E\backslash F$ (resp. in $E$) is adjacent to at least one edge in $F$, the minimum cardinality of an edge dominating set (resp. a total edge dominating set) of $G$ is the {\em edge domination number} (resp. {\em total edge domination number}) of $G$, denoted by $γ^{'}(G)$ (resp. $γ_t^{'}(G)$). In the present paper, we prove that the total edge domination problem is NP-complete for bipartite graphs with maximum degree 3. We also design a linear-time algorithm for solving this problem for trees. Finally, for a graph $G$, we give the inequality $γ^{'}(G)\leqslant γ^{'}_{t}(G)\leqslant 2γ^{'}(G)$ and characterize the trees $T$ which obtain the upper or lower bounds in the inequality.

math.CO↗