Drift of Spectrally Stable Shifted States on Star Graphs
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
When the coefficients of the cubic terms match the coefficients in the boundary conditions at a vertex of a star graph and satisfy a certain constraint, the nonlinear Schrödinger (NLS) equation on the star graph can be transformed to the NLS equation on a real line. Such balanced star graphs have appeared in the context of reflectionless transmission of solitary waves. Steady states on such balanced star graphs can be translated by an arbitrary distance along the edges and are referred to as the shifted states. When the star graph has exactly one incoming edge and several outgoing edges, the steady states are spectrally stable if their monotonic tails are located on the outgoing edges. These spectrally stable states are degenerate minimizers of the action functional with the degeneracy due to the translational symmetry. Nonlinear stability of these spectrally stable states has been an open problem up to now. In this paper, we prove that these spectrally stable states are nonlinearly unstable due to an irreversible drift along the incoming edge toward the vertex of the star graph. When the shifted states reach the vertex as a result of the drift, they become saddle points of the action functional, in which case the nonlinear instability leads to their destruction. In addition to rigorous mathematical results, we use numerical simulations to illustrate the drift instability and destruction of the shifted states on the balanced star graph.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.003 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.004 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it