Laplacian U-Processes for Multiple Change-Point Detection in Dependent Text Networks: An Application to Historical Chinese Articles

📅 2026-09-16
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文提出一种双视图加权一致性算子框架,用于检测弱相关文本网络中的变化点,并应用于历史中文文章分析。
📝 Abstract
We propose a two-view weighted-concordance operator (WCO) framework for offline change-point detection in weakly dependent text networks. Weighted word-co-occurrence graphs yield first-order direct-co-occurrence and second-order shared-context views, projected into paired Euclidean observations using maps learned from an independent pilot corpus. A WCO scan detects changes in cross-view dependence. A dependent multiplier bootstrap tests for a change, while a segment-wise block bootstrap gives a descriptive stability interval for its location. We establish null weak convergence, bootstrap validity, asymptotic size control, consistent localization under a single identifiable change, and perturbation bounds for token-level errors. CUSUM and Gaussian-kernel MMD scans provide complementary benchmarks. In the 1915-1921 New Youth corpus, the method detects a change in November 1919, with a descriptive 95 percent stability interval from April 1919 to June 1920, consistent with the linguistic transition surrounding China's May Fourth and New Culture movements.
Problem

Research questions and friction points this paper is trying to address.

Change-Point Detection
Dependent Text Networks
Historical Chinese Articles
Innovation

Methods, ideas, or system contributions that make the work stand out.

weighted-concordance operator
dependent text networks
change-point detection
multiplier bootstrap
block bootstrap
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
F
Fanghua Chen
Department of Statistics, University of South Carolina
Y
Yizhou Cai
Department of Mathematics, Texas State University
L
Lu zhou
Department of Statistics, University of South Carolina
T
Ting Fung Ma
Department of Statistics, University of South Carolina