相关论文: On weak $\epsilon$-nets and the Radon number

We give a new proof of a classical uniqueness theorem of Alexandrov using the weak uniqueness continuation theorem of Bers-Nirenberg. We prove a version of this theorem with the minimal regularity assumption: the spherical hessians of the…

The statistics of peaks in weak gravitational lensing maps is a promising technique to constrain cosmological parameters in present and future surveys. Here we investigate its power when using general extreme value statistics which is very…

We study a weakly disordered 2D electron gas with two bands and a spectral node within the weak-localization approach and compare its results with those of Gaussian fluctuations around the self-consistent Born approximation. The appearance…

We prove in this short report that for arbitrary weak converging sequence of sigma-finite Borelian measures in the separable Banach space there is a compact embedded separable subspace such that this measures not only are concentrated in…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

This paper argues that DNNs implement a computational Occam's razor -- finding the `simplest' algorithm that fits the data -- and that this could explain their incredible and wide-ranging success over more traditional statistical methods.…

The weak $k$-metric dimension of a graph is roughly understood as the cardinality of a smallest set of vertices $S$ of the graph with the property of uniquely recognizing all the vertices of the graph throughout summations of differences of…

The KC property, a separation axiom between weakly Hausdorff and Hausdorff, requires compact subsets to be closed. Various assumptions involving local conditions, dimension, connectivity, and homotopy show certain KC-spaces are in fact…

We give a probabilistic construction of a $3$-uniform hypergraph on $N$ vertices with independence number $O(\log N / \log \log N)$ in which there are at most two edges among any four vertices. This bound is tight and solves a longstanding…

The dependence of the localization length on the number of occupied subbands $N$ in low-dimensional semiconductors is investigated. The localization length is shown to be proportional to the number of occupied subbands in…

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R^d. We study the convergence of the shortest path distance in such graphs as the sample size…

Very sparse random graphs are known to typically be singular (i.e., have singular adjacency matrix), due to the presence of "low-degree dependencies'' such as isolated vertices and pairs of degree-1 vertices with the same neighbourhood. We…

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

We show that discrete singular Radon transforms along a certain class of polynomial mappings $P:\mathbb{Z}^d\to \mathbb{Z}^n$ satisfy sparse bounds. For $n=d=1$ we can handle all polynomials. In higher dimensions, we pose restrictions on…

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in…

Let $\Omega $ be a bounded ${\mathcal{C}}^{\infty}$-smoothly bounded domain in ${\mathbb{C}}^{n}.$ For such a domain we define a new notion between strict pseudo-convexity and pseudo-convexity: the size of the set $W$ of weakly…

A {\it weak (Berge) cycle} is an alternating sequence of vertices and (hyper)edges $C=(v_0, e_1, v_1, ..., v_{\ell-1}, e_\ell, v_{\ell}=v_0)$ such that the vertices $v_0, ..., v_{\ell-1}$ are distinct with $v_k, v_{k+1} \in e_{k}$ for each…

We study the distributions of the resilience of power flow models against transmission line failures via a so-called backup capacity. We consider three ensembles of random networks and in addition, the topology of the British transmission…

Weak gravitational lensing observations probe the spectrum and evolution of density fluctuations and the cosmological parameters which govern them but are currently limited to small fields and subject to selection biases. We show how the…

This review explains in a self-contained way the properties of random Boolean networks and their attractors, with a special focus on critical networks. Using small example networks, analytical calculations, phenomenological arguments, and…