English
Related papers

Related papers: Sparse domination and the strong maximal function

200 papers

We study a two-dimensional stochastic differential equation that has a unique weak solution but no strong solution. We show that this SDE shares notable properties with Tsirelson's example of a one-dimensional SDE with no strong solution.…

Probability · Mathematics 2025-06-10 Alexander M. G. Cox , Benjamin A. Robinson

We show that the dynamical degree of an (i.i.d) random sequence of dominant, rational self-maps on projective space is almost surely constant. We then apply this result to height growth and height counting problems in random orbits.

Number Theory · Mathematics 2019-04-10 Wade Hindes

In this paper we initiate the study of whether or not sparse estimation tasks can be performed efficiently in high dimensions, in the robust setting where an $\eps$-fraction of samples are corrupted adversarially. We study the natural…

Machine Learning · Computer Science 2017-03-02 Jerry Li

We consider an inviscid stochastically forced dyadic model, where the additive noise acts only on the first component. We prove that a strong solution for this problem exists and is unique by means of uniform energy estimates. Moreover, we…

Probability · Mathematics 2015-11-09 Luisa Andreis , David Barbato , Francesca Collet , Marco Formentin , Luigi Provenzano

We construct a new type of convergent asymptotic representations, dyadic factorial expansions. Their convergence is geometric and the region of convergence can include Stokes rays, and often extends down to 0^+. For special functions such…

Classical Analysis and ODEs · Mathematics 2016-08-16 O. Costin , R. D. Costin

We introduce the rigorous limit process connecting finite dimensional sparse optimal control problems with ODE constraints, modeling parsimonious interventions on the dynamics of a moving population divided into leaders and followers, to an…

Optimization and Control · Mathematics 2015-06-18 Massimo Fornasier , Benedetto Piccoli , Francesco Rossi

A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…

Combinatorics · Mathematics 2016-02-29 Markus Dod

We present a continuum formulation of a (d+1)-dimensional directed line interacting with sparse potentials (i.e. d-dimensional potentials defined only at discrete longitudinal locations.) An iterative solution for the partition function is…

Condensed Matter · Physics 2009-10-28 T. J. Newman , A. J. McKane

Signal processing is rich in inherently continuous and often nonlinear applications, such as spectral estimation, optical imaging, and super-resolution microscopy, in which sparsity plays a key role in obtaining state-of-the-art results.…

Machine Learning · Computer Science 2020-03-23 Luiz F. O. Chamon , Yonina C. Eldar , Alejandro Ribeiro

This paper aims to study the relationship between the maximum principle and the dynamic programming principle for recursive optimal control problem of stochastic evolution equations, where the control domain is not necessarily convex and…

Optimization and Control · Mathematics 2025-12-19 Ying Hu , Guomin Liu , Shanjian Tang

By means of appropriate sparse bounds, we deduce compactness on weighted $L^p(w)$ spaces, $1<p<\infty$, for all Calder\'on-Zygmund operators having compact extensions on $L^2(\mathbb{R}^n)$. Similar methods lead to new results on…

Classical Analysis and ODEs · Mathematics 2024-07-23 Cody B. Stockdale , Paco Villarroya , Brett D. Wick

We present a version of the stochastic maximum principle (SMP) for ergodic control problems. In particular we give necessary (and sufficient) conditions for optimality for controlled dissipative systems in finite dimensions. The strategy we…

Probability · Mathematics 2019-08-05 Carlo Orrieri , Gianmario Tessitore , Petr Veverka

In this paper, we study diagonal dominance of the stiffness matrix resulted from the piecewise linear finite element discretisation of the integral fractional Laplacian under global homogeneous Dirichlet boundary condition in one spatial…

Numerical Analysis · Mathematics 2020-07-17 Hongyan Liu , Changtao Sheng , Li-Lian Wang , Huifang Yuan

We show that the problem k-Dominating Set and its several variants including k-Connected Dominating Set, k-Independent Dominating Set, and k-Dominating Clique, when parameterized by the solution size k, are W[1]-hard in either…

Computational Complexity · Computer Science 2015-03-19 Minghui Jiang , Yong Zhang

In this work, we establish, for a strong Feller process, the large deviation principle for the occupation measure conditioned not to exit a given subregion. The rate function vanishes only at a unique measure, which is the so-called…

Probability · Mathematics 2024-11-27 Arnaud Guillin , Boris Nectoux , Liming Wu

A function f: V \rightarrow \{-1,0,1\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The weight of f is the sum of f(x) over all vertices x \in V. The…

Discrete Mathematics · Computer Science 2013-08-26 Luérbio Faria , Wing-Kai Hon , Ton Kloks , Hsiang-Hsuan Liu , Tao-Ming Wang , Yue-Li Wang

We describe the large deviations above its typical value of the maximal energy of a spin glass with +/-1 spins. Thanks to the relatively explicit description of the rate function we identify, we then show that the latter is asymptotically…

We consider control-constrained linear-quadratic optimal control problems on evolving surfaces. In order to formulate well-posed problems, we prove existence and uniqueness of weak solutions for the state equation, in the sense of…

Optimization and Control · Mathematics 2015-03-19 Morten Vierling

We study the density of the supremum of a strictly stable L\'evy process. As was proved recently in F. Hubalek and A. Kuznetsov "A convergent series representation for the density of the supremum of a stable process" (Elect. Comm. in…

Probability · Mathematics 2011-12-20 Alexey Kuznetsov

Let $G=(V(G),E(G))$ be a simple graph. A set $D\subseteq V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V(G)\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

Combinatorics · Mathematics 2022-10-21 Saeid Alikhani , Nima Ghanbari , Hassan Zaherifar