English
Related papers

Related papers: Uniform geometric estimates for sublevel sets

200 papers

Statistical inference from high-dimensional data with low-dimensional structures has recently attracted lots of attention. In machine learning, deep generative modeling approaches implicitly estimate distributions of complex objects by…

Statistics Theory · Mathematics 2022-02-21 Rong Tang , Yun Yang

We establish an uniform factorial decay estimate for the Taylor approximation of solutions to controlled differential equations. Its proof requires a factorial decay estimate for controlled paths which is interesting in its own right.

Classical Analysis and ODEs · Mathematics 2015-02-16 Horatio Boedihardjo , Danyu Yang , Terry Lyons

Preconditioned gradient iterations for very large eigenvalue problems are efficient solvers with growing popularity. However, only for the simplest preconditioned eigensolver, namely the preconditioned gradient iteration (or preconditioned…

Numerical Analysis · Mathematics 2011-08-12 Klaus Neymeyr

Corrector estimates constitute a key ingredient in the derivation of optimal convergence rates via two-scale expansion techniques in homogenization theory of random uniformly elliptic equations. The present work follows up - in terms of…

Analysis of PDEs · Mathematics 2020-12-10 Sebastian Hensel

Starting with the large deviation principle (LDP) for the Erd\H{o}s-R\'enyi binomial random graph $\mathcal{G}(n,p)$ (edge indicators are i.i.d.), due to Chatterjee and Varadhan (2011), we derive the LDP for the uniform random graph…

Probability · Mathematics 2018-05-01 Amir Dembo , Eyal Lubetzky

In this paper, estimates for norms of weighted summation operators (discrete Hardy-type operators) on a tree are obtained for $1<p<q<\infty$ and for arbitrary weights and trees.

Classical Analysis and ODEs · Mathematics 2015-09-24 A. A. Vasil'eva

After a historical discussion of classical uniformisation results for Riemann surfaces, of problems appearing in higher dimensions, and of uniformisation results for projective manifolds with trivial or ample canonical bundle, we introduce…

Algebraic Geometry · Mathematics 2019-02-22 Daniel Greb , Stefan Kebekus , Behrouz Taji

Surface-consistent deconvolution is a standard processing technique in land data to uniformize the wavelet across all sources and receivers. The required wavelet estimation step is generally done in the homomorphic domain since this is a…

Information Theory · Computer Science 2012-09-18 Roberto H. Herrera , Mirko van der Baan

This is the second part of a series of four articles on weighted norm inequalities, off-diagonal estimates and elliptic operators. We consider a substitute to the notion of pointwise bounds for kernels of operators which usually is a…

Classical Analysis and ODEs · Mathematics 2018-10-10 Pascal Auscher , José Maria Martell

In this article we prove a sharp decay estimate for certain multilinear oscillatory integral operators of a form inspired by the general framework of Christ, Li, Tao, and Thiele [6]. A key purpose of this work is to determine when such…

Classical Analysis and ODEs · Mathematics 2019-12-19 Philip T. Gressman , Ellen Urheim

Divergence-form operators with random coefficients homogenize over large scales. Over the last decade, an intensive research effort focused on turning this asymptotic statement into quantitative estimates. The goal of this note is to review…

Mathematical Physics · Physics 2019-05-01 Jean-Christophe Mourrat

Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is…

Spectral Theory · Mathematics 2025-03-17 Gonzalo Contreras-Aso , Cristian Pérez-Corral , Miguel Romance

In this manuscript a unified framework for conducting inference on complex aggregated data in high dimensional settings is proposed. The data are assumed to be a collection of multiple non-Gaussian realizations with underlying undirected…

Applications · Statistics 2013-10-14 Fang Han , Han Liu , Brian Caffo

We lift important results about universally typical sets, typically sampled sets, and empirical entropy estimation in the theory of samplings of discrete ergodic information sources from the usual one-dimensional discrete-time setting to a…

Information Theory · Computer Science 2013-11-13 Tyll Krueger , Guido Montufar , Ruedi Seiler , Rainer Siegmund-Schultze

We provide uniform convergence rates for kernel averages on $[0,1]$ under equally-spaced fixed design points of the form $x_{t,T}=t/T,\ t\in\{1,\dotsc, T\},\ T\in\mathbb{N}$. The rates of weak and strong uniform consistency are derived…

Statistics Theory · Mathematics 2026-03-06 Danilo Hiroshi Matsuoka , Hudson da Silva Torrent

We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…

Combinatorics · Mathematics 2021-01-22 Stefan Ehard , Felix Joos

We study the expected adjacency matrix of a uniformly random multigraph with fixed degree sequence $\mathbf{d} \in \mathbb{Z}_+^n$. This matrix arises in a variety of analyses of networked data sets, including modularity-maximization and…

Social and Information Networks · Computer Science 2020-02-10 Philip S. Chodrow

We develop a quantitative theory of stochastic homogenization for linear, uniformly parabolic equations with coefficients depending on space and time. Inspired by recent works in the elliptic setting, our analysis is focused on certain…

Analysis of PDEs · Mathematics 2018-06-13 Scott Armstrong , Alexandre Bordas , Jean-Christophe Mourrat

This paper considers universal Hilbert space operators in the sense of Rota, and gives criteria for universality of semigroups in the context of uniformly continuous semigroups and contraction semigroups. Specific examples are given.…

Functional Analysis · Mathematics 2018-05-09 B. Célariès , I. Chalendar , J. R. Partington

In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability $p$ and $q$, respectively…

Data Structures and Algorithms · Computer Science 2017-08-24 Sam Cole