Related papers: The intersection of algorithmically random closed …
The concentration of measure phenomena were discovered as the mathematical background of statistical mechanics at the end of the XIX - beginning of the XX century and were then explored in mathematics of the XX-XXI centuries. At the…
This article introduces innovative classes of open sets in \(\mathbb{R}^{N}\), where \(N=2, 3\), characterized by a geometric property associated with the inward normal. The focus lies on proving compactness results for the Hausdorff…
In this paper, we propose an approximate projected consensus algorithm for a network to cooperatively compute the intersection of convex sets. Instead of assuming the exact convex projection proposed in the literature, we allow each node to…
In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a sum of two terms: one is nonconvex and smooth, and another is convex but simple and its structure is known.…
Statistical properties of non--symmetric real random matrices of size $M$, obtained as truncations of random orthogonal $N\times N$ matrices are investigated. We derive an exact formula for the density of eigenvalues which consists of two…
Interactions between several features sometimes play an important role in prediction tasks. But taking all the interactions into consideration will lead to an extremely heavy computational burden. For categorical features, the situation is…
The Hausdorff dimension of the set of points that are covered infinitely many times by a sequence of randomly distributed balls in the unit cube can be expressed in terms of the sizes of the balls. This note presents a new proof of the…
In this note we prove a large deviation result for the intersection of the ranges of two independent random walks in dimension two. This complements the study of Phetpradap from 2011, where the intersection in dimension three and above was…
We present a positive solution to the so-called Bernoulli Conjecture concerning the characterization of sample boundedness of Bernoulli processes. We also discuss some applications and related open problems.
In this article we consider the graph alignment problem from the perspective of high-dimensional statistics: we aim to estimate an unknown permutation $\pi^*$ from the observation of two correlated random adjacency matrices $A_1$, $A_2$. We…
This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…
We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation rho the experimenter can determine, given…
Let $A$ and $B$ be Borel subsets of the Euclidean $n$-space with $\dim A + \dim B > n$. This is a survey on the question: what can we say about the Hausdorff dimension of the intersections $A\cap (g(B)+z)$ for generic orthogonal…
The determination of the Hausdorff dimension of the scaling limit of loop-erased random walk is closely related to the study of the one-point function of loop-erased random walk, i.e., the probability a loop-erased random walk passes…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
Hausdorff dimension results are a classical topic in the study of path properties of random fields. This article presents an alternative approach to Hausdorff dimension results for the sample functions of a large class of self-affine random…
Many machine learning algorithms used for dimensional reduction and manifold learning leverage on the computation of the nearest neighbours to each point of a dataset to perform their tasks. These proximity relations define a so-called…
Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…
Given a compact basic semi-algebraic set we provide a numerical scheme to approximate as closely as desired, any finite number of moments of the Hausdorff measure on the boundary of this set. This also allows one to approximate interesting…
In this paper we have studied the notion of rough convergence of sequences in a partial metric space. We have also investigated how far several relevant results on boundedness, rough limit sets etc. which are valid in a metric space are…