Related papers: Strong Consistency of Frechet Sample Mean Sets for…
We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…
Fr\'echet means are indispensable for nonparametric statistics on non-Euclidean spaces. For suitable random variables, in some sense, they "sense" topological and geometric structure. In particular, smeariness seems to indicate the presence…
Fr\'echet regression extends classical regression methods to non-Euclidean metric spaces, enabling the analysis of data relationships on complex structures such as manifolds and graphs. This work establishes a rigorous theoretical analysis…
The law of large numbers extends to random sets by employing Minkowski addition. Above that, a central limit theorem is available for set-valued random variables. The existing results use abstract isometries to describe convergence of the…
The asymptotic concentration of the Fr{\'e}chet mean of IID random variables on a Rieman-nian manifold was established with a central limit theorem by Bhattacharya \& Patrangenaru (BP-CLT) [6]. This asymptotic result shows that the…
The Frechet mean is a useful description of location for a probability distribution on a metric space that is not necessarily a vector space. This article considers simultaneous estimation of multiple Frechet means from a decision-theoretic…
Advancements in data collection have led to increasingly common repeated observations with complex structures in biomedical studies. Treating these observations as random objects, rather than summarizing features as vectors, avoids feature…
In this paper we consider higher isoperimetric numbers of a (finite directed) graph. In this regard we focus on the $n$th mean isoperimetric constant of a directed graph as the minimum of the mean outgoing normalized flows from a given set…
The notion of barycentre graph is of crucial importance for machine learning algorithms that process graph-valued data. The barycentre graph is a "summary graph" that captures the mean topology and connectivity structure of a training…
This work resolves the following question in non-Euclidean statistics: Is it possible to consistently estimate the Fr\'echet mean set of an unknown population distribution, with respect to the Hausdorff metric, when given access to…
We study the relationship between different kinds of convergence of finite signed measures and discuss their metrizability. In particular, we study the concept of basic convergence recently introduced by Khartov [arXiv:2204.13667] and…
We consider (graph-)group-valued random element $\xi$, discuss the properties of a mean-set $\ME(\xi)$, and prove the generalization of the strong law of large numbers for graphs and groups. Furthermore, we prove an analogue of the…
In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…
In 1981, Karp and Sipser proved a law of large numbers for the matching number of a sparse Erd\H{o}s-R\'enyi random graph, in an influential paper pioneering the so-called differential equation method for analysis of random graph processes.…
We consider the problem of estimating the Fr\'echet and conditional Fr\'echet mean from data taking values in separable metric spaces. Unlike Euclidean spaces, where well-established methods are available, there is no practical estimator…
The Fr\'echet mean, a generalization to a metric space of the expectation of a random variable in a vector space, can exhibit unexpected behavior for a wide class of random variables. For instance, it can stick to a point (more generally to…
We study the normal approximation of functionals of Poisson measures having the form of a finite sum of multiple integrals. When the integrands are nonnegative, our results yield necessary and sufficient conditions for central limit…
We study the problem of estimating the barycenter of a distribution given i.i.d. data in a geodesic space. Assuming an upper curvature bound in Alexandrov's sense and a support condition ensuring the strong geodesic convexity of the…
This article introduces a new class of models for multiple networks. The core idea is to parametrize a distribution on labelled graphs in terms of a Fr\'{e}chet mean graph (which depends on a user-specified choice of metric or graph…
We consider two statistical problems at the intersection of functional and non-Euclidean data analysis: the determination of a Fr\'echet mean in the Wasserstein space of multivariate distributions; and the optimal registration of deformed…