相关论文: Finite random coverings of one-complexes and the E…
In a closed manifold of positive dimension $n$, we estimate the expected volume and Euler characteristic for random submanifolds of codimension $r\in \{1,...,n\}$ in two different settings. On one hand, we consider a closed Riemannian…
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…
We consider random n-covers $X_n$ of an arbitrary compact hyperbolic surface $X$. We show that in the large n regime and small window limit, the variance of the smooth spectral statistics of the Laplacian twisted by a unitary abelian…
In a large, possibly infinite population, each subject is colored red with probability $p$, independently of the others. Then, a finite sub-population is selected, possibly as a function of the coloring. The imbalance in the sub-population…
In this paper, we introduce a notion called "Approximate Ultrametricity" which encapsulates the phenomenology of a sequence of random probability measures having supports that behave like ultrametric spaces insofar as they decompose into…
We describe a framework for estimating Hilbert-Samuel multiplicities $e_XY$ for pairs of projective varieties $X \subset Y$ from finite point samples rather than defining equations. The first step involves proving that this multiplicity…
We propose a finite volume stochastic collocation method for the random Euler system. We rigorously prove the convergence of random finite volume solutions under the assumption that the discrete differential quotients remain bounded in…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
This paper primarily concerns the variance estimate of zeros of systems of random holomorphic sections associated with a sequence of smooth Hermitian holomorphic line bundles on a compact Kahler manifold X. The probability measures taken…
An important problem in statistics is the construction of confidence regions for unknown parameters. In most cases, asymptotic distribution theory is used to construct confidence regions, so any coverage probability claims only hold…
Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. This paper studies deterministic conditions for completion. An…
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
A doubling covering $\U$ of a complex $n$-dimensional manifold $Y$ consists of analytic functions $\psi_j:B_1\to Y$, each function being analytically extendable, as a mapping to $Y$, to a four times larger concentric ball $B_4$. Main result…
We provide a general framework for constructing probability distributions on Riemannian manifolds, taking advantage of area-preserving maps and isometries. Control over distributions' properties, such as parameters, symmetry and modality…
Given $N$ geodesic caps on the unit sphere in $\mathbb{R}^d$, and whose total normalized surface area sums to one, what is the maximal surface area their union can cover? In this work, we provide an asymptotically sharp upper bound for an…
We give conditions in order to approximate locally uniformly holomorphic covering mappings of the unit ball of $\mathbb{C}^n$ with respect to an arbitrary norm, with entire holomorphic covering mappings. The results rely on a generalization…
In the present paper we focus on the coherence properties of general random Euclidean distance matrices, which are very closely related to the respective matrix completion problem. This problem is of great interest in several applications…
In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global…
A randomized scheme that succeeds with probability $1-\delta$ (for any $\delta>0$) has been devised to construct (1) an equidistributed $\epsilon$-cover of a compact Riemannian symmetric space $\mathbb M$ of dimension $d_{\mathbb M}$ and…
In this short note, we provide a calculation of the Euler characteristic of a finite homotopy colimit of finite cell complexes, which depends only on the Euler characteristics of each space and resembles Mobius inversion. Versions of the…