Related papers: Scaling universalities of kth-nearest neighbor dis…
A mathematical smooth function means that the function has continuous derivatives to a certain degree C(k). We call it a k-smooth function or a smooth function if k can grow infinitively. Based on quantum physics, there is no such smooth…
We study the problem of robustly learning multi-dimensional histograms. A $d$-dimensional function $h: D \rightarrow \mathbb{R}$ is called a $k$-histogram if there exists a partition of the domain $D \subseteq \mathbb{R}^d$ into $k$…
We report direct numerical simulation (DNS) results of the rough-wall channel, focusing on roughness with high $k_{rms}/k_a$ statistics but small to negative $Sk$ statistics, and we study the implications of this new dataset on rough-wall…
Let $(M^{n},g_{0})$ be a $n=3,4,5$ dimensional, closed Riemannian manifold of positive Yamabe invariant. For a smooth function $K>0$ on $M$ we consider a scalar curvature flow, that tends to prescribe $K$ as the scalar curvature of a metric…
We prove that scaling limits of random planar maps which are uniformly distributed over the set of all rooted 2k-angulations are a.s. homeomorphic to the two-dimensional sphere. Our methods rely on the study of certain random geodesic…
We introduce $(k,l)$-regular maps, which generalize two previously studied classes of maps: affinely $k$-regular maps and totally skew embeddings. We exhibit some explicit examples and obtain bounds on the least dimension of a Euclidean…
Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and $k$-means++ can take $\Omega(ndk)$ time when clustering $n$ points in…
Nearest neighbor cells in $R^d,d\in\mathbb{N}$, are used to define coefficients of divergence ($\phi$-divergences) between continuous multivariate samples. For large sample sizes, such distances are shown to be asymptotically normal with a…
This paper establishes rates of universal approximation for the shallow neural tangent kernel (NTK): network weights are only allowed microscopic changes from random initialization, which entails that activations are mostly unchanged, and…
We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…
We establish the equivalence between the regularity (rectifiability) of sets and suitable estimates on the oscillation of the gradient for smooth non-local distance functions. A prototypical example of such a distance was introduced, as…
In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the…
Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…
Our main result in this article is a compactness result which states that a noncollapsed sequence of asymptotically locally Euclidean (ALE) scalar-flat K\"ahler metrics on a minimal K\"ahler surface whose K\"ahler classes stay in a compact…
Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…
Equilibrium crystal surfaces, constrained to equilibrate by means of dissociative dimer deposition and evaporation, have anomalous global surface roughness. We generalize earlier results for one dimensional interfaces to two dimensions. The…
The scaling properties of one-dimensional deconstructed surfaces are studied by numerical simulations of a disaggregation model. The model presented here for the disaggregation process takes into account the possibility of having quenched…
A random walk starts from the origin of a d-dimensional lattice. The occupation number n(x,t) equals unity if after t steps site x has been visited by the walk, and zero otherwise. We study translationally invariant sums M(t) of observables…
The statistics of transmission through random 1D media are generally presumed to be universal and to depend only upon a single dimensionless parameter-the ratio of the sample length and the mean free path, s = L/l. Here, we show in…
Various real-life networks of current interest are simultaneously scale-free and modular. Here we study analytically the average distance in a class of deterministically growing scale-free modular networks. By virtue of the recursive…