Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 81 tok/s
Gemini 2.5 Pro 45 tok/s Pro
GPT-5 Medium 14 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 145 tok/s Pro
GPT OSS 120B 446 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

A priori bounds for rough differential equations with a non-linear damping term (2011.06645v4)

Published 12 Nov 2020 in math.PR

Abstract: We consider a rough differential equation with a non-linear damping drift term: \begin{align*} dY(t) = - |Y|{m-1} Y(t) dt + \sigma(Y(t)) dX(t), \end{align*} where $X$ is a branched rough path of arbitrary regularity $\alpha >0$, $m>1$ and where $\sigma$ is smooth and satisfies an $m$ and $\alpha$-dependent growth property. We show a strong a priori bound for $Y$, which includes the "coming down from infinity" property, i.e. the bound on $Y(t)$ for a fixed $t>0$ holds uniformly over all choices of initial datum $Y(0)$. The method of proof builds on recent work by Chandra, Moinat and Weber on a priori bounds for the $\phi4$ SPDE in arbitrary subcritical dimension. A key new ingredient is an extension of the algebraic framework which permits to derive an estimate on higher order conditions of a coherent controlled rough path in terms of the regularity condition at lowest level.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.