A boundary local time for super-Brownian motion and new path properties for superprocess densities
Bibliographic record
Abstract
We establish new fractal properties for superprocess densities. Consider the density of super-Brownian motion in one dimension at a fixed time. We construct a random measure supported on the boundary of the zero set of the density, which we call the boundary local time, and prove that it is locally non-degenerate, in the sense that it almost surely has positive mass on every neighbourhood of the boundary of the support. We then use the boundary local time to give an almost sure lower bound on the Hausdorff dimension of the boundary of the zero set, confirming a conjecture of Mueller et al. [69], whose work on this problem motivated ours. The Hausdorff dimension is characterized in terms of the lead eigenvalue of a certain killed Ornstein-Uhlenbeck operator which also appears in the construction of the boundary local time. The proof of local non-degeneracy includes a novel analysis of the density near the right endpoint of its support, including a new bound on the expected mass in a neighbourhood of the endpoint. We then consider the density of (α, β)-superprocess in dimension d with α ∈ (0, 2), β ∈ (0, 1], and βd < α. A classical result called instantaneous propagation asserts that, at a fixed time, the density has positive mass on any open set almost surely when conditioned on survival. We give general conditions under which the integral the density against a measure μ is positive almost surely when conditioned on survival. In particular, we show that this is determined by the relationship between the dimension of the measure, which we define in two ways, and a critical parameter determined by α, β and d. When the density does not charge μ almost surely, we obtain upper and lower bounds on the probability that it does so. In both cases our results correspond to new existence and non-existence results for solutions to the partial differential equation which is dual to the process. In the regime where the density is continuous and positive at a fixed point almost surely, we prove that the density function is strictly positive.
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.003 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.006 | 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".