SearcharxivSearch

arXiv subjects

Zongchao Li

Publications and source records attributed to Zongchao Li.

2 recordsLinked to original sources

Scenario-conditioned flow matching for probabilistic generation of three-component ground-motion waveforms

Performance-based seismic risk assessment requires three-component acceleration histories compatible with specified source, path, and site conditions. Conventional ground-motion prediction equations provide scalar intensity measures, while many generative waveform models learn amplitude and waveform shape within a single high-dimensional target. We present WaveFlowGMM, a two-stage probabilistic ground-motion model that uses peak ground acceleration (PGA) as an amplitude interface between scenario conditioning and waveform generation. The amplitude stage uses physics-informed symbolic learning to estimate component-wise PGA medians and a full cross-component covariance. The waveform stage uses few-step AlphaFlow in an invertible wavelet-packet coefficient space to generate normalised three-component histories that are rescaled by sampled PGA. Tests on an event-level NGA-West2 holdout set show that the generated motions recover the main magnitude, distance, and site scaling, keep peak and spectral residuals close to zero, preserve three-component amplitude dependence, and yield velocity and displacement histories without systematic drift after integration of the generated three-component acceleration histories. The framework provides an interpretable and computationally efficient candidate component for waveform-level seismic hazard and risk analysis.

physics.geo-ph

Graded isomorphisms of Leavitt path algebras and Leavitt inverse semigroups

Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the $\mathbb Z$-grading on Leavitt inverse semigroups. For connected finite graphs having vertices out-degree at most $1$, we give a combinatorial sufficient and necessary condition on graphs to classify the corresponding Leavitt path algebras and Leavitt inverse semigroups up to graded isomorphisms. More precisely, the combinatorial condition on two graphs coincides if and only if the Leavitt path algebras of the two graphs are $\mathbb Z$-graded isomorphic if and only if the Leavitt inverse semigroups of the two graphs are $\mathbb Z$-graded isomorphic.

math.RA