SearcharxivSearch

arXiv subjects

Shunzhe Zhang

Publications and source records attributed to Shunzhe Zhang.

5 recordsLinked to original sources

Compact Latent Manifold Translation: A Parameter-Efficient Foundation Model for Cross-Modal and Cross-Frequency Physiological Signal Synthesis

The analysis of physiological time series, such as electrocardiograms (ECG) and photoplethysmograms (PPG), is persistently hindered by modality and frequency gaps stemming from heterogeneous recording devices. Existing foundation models typically rely on continuous latent spaces, which frequently suffer from severe modality entanglement, lack high-fidelity cross-frequency generative capacity, and impose high computational costs that prohibit edge-device deployment. In this paper, we propose Compact Latent Manifold Translation (CLMT), a highly parameter-efficient (0.09B) unified framework that bridges these gaps through a novel two-stage discrete translation paradigm. First, we introduce a Universal Tokenizer utilizing Hierarchical Residual Vector Quantization (RVQ) to decouple heterogeneous signals into isolated, well-structured discrete latent manifolds, effectively preventing inter-modality interference. Second, a Context-Prompted Latent Translator maps these discrete tokens across modalities by integrating static physiological priors, reframing complex signal synthesis as a pure latent sequence translation task. Extensive evaluations demonstrate that our 0.09B model significantly outperforms massive baselines. In cross-modal PPG-to-ECG synthesis, it resolves temporal phase drift and dramatically improves the clinical R-peak detection F1-score from 0.37 (baseline) to 0.83. Furthermore, in extreme cross-frequency super-resolution (25Hz to 100Hz), it successfully recovers high-frequency diagnostic landmarks, achieving an unprecedented Pearson correlation of 0.9956. By learning a universal discrete language for biological signals with a fraction of the computational footprint, our approach sets a new trajectory for edge-deployable, multi-modal medical foundation models.

eess.SP

Chords of longest cycles in graphs with large circumferences

A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is a $2$-connected cubic graph, then any longest cycle must have a chord. He also showed that in any 3-connected graph with minimum degree at least four, some longest cycle must contain a chord. Harvey proved that every longest cycle has a chord for graphs with a large minimum degree. He also conjectured that any longest cycle in a 2-connected graph with minimum degree at least three has a chord. In this paper, we prove that both Thomassen's and Harvey's conjectures are true for graphs with large circumferences. We also prove a more general result for the existence of chords in longest cycles containing a linear forest.

math.CO

Chords of longest cycles passing through a specified small set

A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is $2$-connected and cubic, then any longest cycle must have a chord. He also showed that if $G$ is a $3$-connected graph with minimum degree at least $4$, then some of the longest cycles in $G$ must have a chord. Zhang (1987) proved that if $G$ is a $3$-connected simple planar graph which is 3-regular or has minimum degree at least $4$, then every longest cycle of $G$ must have a chord. Recently, Li and Liu showed that if $G$ is a $2$-connected cubic graph and $x, y$ are two distinct vertices of $G$, then every longest $(x,y)$-path of $G$ contains at least one internal vertex whose neighbors are all in the path. In this paper, we study chords of longest cycles passing through a specified small set and generalize Thomassen's and Zhang's above results by proving the following results. (i) Let $G$ be a $2$-connected cubic graph and $S$ be a specified set consisting of an edge plus a vertex. Then every longest cycle of $G$ containing $S$ must have a chord. (ii) Let $G$ be a $3$-connected graph with minimum degree at least $4$ and $e$ be a specified edge of $G$. Then some longest cycle of $G$ containing $e$ must have a chord. (iii) Let $G$ be a $3$-connected planar graph with minimum degree at least $4$. Suppose $S$ is a specified set consisting of either three vertices or an edge plus a vertex. Then every longest cycle of $G$ containing $S$ must have a chord. We also extend the above-mentioned result of Li and Liu for $2$-connected cubic graphs.

math.CO

Anti-Ramsey problems in the generalized Petersen graphs for cycles

The anti-Ramsey number $Ar(G,H)$ is the maximum number of colors in an edge-coloring of $G$ with no rainbow copy of $H$. In this paper, we determine the exact anti-Ramsey number in the generalized Petersen graph $P_{n,k}$ for cycles $C_d$, where $1\leq k\leq \lfloor \frac{n-1}{2} \rfloor$ and $5\le d \le 6$. We also give an algorithm to obtain the upper bound or lower bound of anti-Ramsey number.

math.CO

Fractional matching preclusion of fault Hamiltonian graphs

Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. As a generalization of matching preclusion, the fractional matching preclusion number (FMP number for short) of a graph is the minimum number of edges whose deletion results in a graph that has no fractional perfect matchings, and the fractional strong matching preclusion number (FSMP number for short) of a graph is the minimum number of edges and/or vertices whose deletion leaves a resulting graph with no fractional perfect matchings. A graph $G$ is said to be $f$-fault Hamiltonian if there exists a Hamiltonian cycle in $G-F$ for any set $F$ of vertices and/or edges with $|F|\leq f$. In this paper, we establish the FMP number and FSMP number of $(δ-2)$-fault Hamiltonian graphs with minimum degree $δ\geq 3$. As applications, the FMP number and FSMP number of some well-known networks are determined.

math.CO