Stability of the Nonwandering Set in the Region of Attraction Boundary under Perturbations with Application to Vulnerability Assessment
Bibliographic record
Abstract
Abstract. For many engineered systems it is important to assess vulnerability to potential disturbances in order to ensure reliable operation. Whether the system will recover from a particular finite-time disturbance to a desired stable equilibrium point depends on uncertain and time-varying system parameter values. Therefore, it is valuable to determine, for specific fixed disturbances, the margins for safe operation: the smallest change in parameter values that would cause the system to become vulnerable to the disturbance. The natural setting for this problem is a parameter-dependent vector field with a family of stable equilibria and a parameter-dependent initial condition representing the disturbance. The system recovers for a particular parameter value if its initial condition lies within the region of attraction of the desired stable equilibrium point. Prior work has developed algorithms for numerically computing the margins for safe operation. However, the theoretical guarantees provided for these methods require a very restrictive assumption: that the nonwandering set in the region of attraction boundary is stable under perturbations to the vector field. This assumption is generally intractable to verify, so feasibility of the above algorithms cannot be determined in advance, and even when these algorithms do converge their convergence to the correct values cannot be guaranteed. Thus, this assumption limits the effective application of these algorithms in practice. This work relaxes this restrictive assumption while still obtaining similar results under weaker assumptions, thereby guaranteeing effectiveness of these algorithms. For the setting under consideration, it is shown for vector fields on compact Riemannian manifolds that the restrictive assumption follows immediately and does not need to be independently verified. A motivating example shows that this is not the case for vector fields on Euclidean space, but in this setting it is shown that the restrictive assumption can still be relaxed provided there exist a neighborhood of infinity with suitable properties and some additional generic assumptions. These results are then used to provide theoretical guarantees for the numerical algorithms discussed above under far weaker assumptions.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".