Related papers: Strong Consistency of Frechet Sample Mean Sets for…
We are interested in measures of central tendency for a population on a network, which is modeled by a metric tree. The location parameters that we study are generalized Fr\'echet means obtained by minimizing the objective function $\alpha…
Random spatial networks-that is, graphs whose connectivity is governed by geometric proximity-have emerged as fundamental models for systems constrained by an underlying spatial structure. A prototypical example is the random geometric…
We study the linear eigenvalue statistics of large random graphs in the regimes when the mean number of edges for each vertex tends to infinity. We prove that for a rather wide class of test functions the fluctuations of linear eigenvalue…
Endow the space $\mathcal{P}(\mathbb{R})$ of probability measures on $\mathbb{R}$ with a transportation cost $J(\mu, \nu)$ generated by a translation-invariant convex cost function. For a probability distribution on…
We prove a central limit theorem (CLT) for the Frechet mean of independent and identically distributed observations in a compact Riemannian manifold assuming that the population Frechet mean is unique. Previous general CLT results in this…
Sample compression schemes were defined by Littlestone and Warmuth (1986) as an abstraction of the structure underlying many learning algorithms. In a sample compression scheme, we are given a large sample of vertices of a fixed hypergraph…
In this article, we study the consistency of the template estimation with the Fr\'echet mean in quotient spaces. The Fr\'echet mean in quotient spaces is often used when the observations are deformed or transformed by a group action. We…
We consider a class of scale-free inhomogeneous random graphs, which includes some long-range percolation models. We study the maximum degree in such graphs in a growing observation window and show that its limiting distribution is Frechet.…
In this paper, a regularization of Wasserstein barycenters for random measures supported on $\mathbb{R}^{d}$ is introduced via convex penalization. The existence and uniqueness of such barycenters is first proved for a large class of…
The infinite-dimensional Hilbert sphere $S^\infty$ has been widely employed to model density functions and shapes, extending the finite-dimensional counterpart. We consider the Fr\'echet mean as an intrinsic summary of the central tendency…
Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$-factor in $G$ is a subgraph of $G$ composed of $n/r$ vertex-disjoint copies of $F$, if $r$ divides $n$. In other words, an $F$-factor yields a partition…
The Straightness is a measure designed to characterize a pair of vertices in a spatial graph. It is defined as the ratio of the Euclidean distance to the graph distance between these vertices. It is often used as an average, for instance to…
Random measures provide flexible parameters for Bayesian nonparametric models. Given two different priors for a random measure, we develop a natural framework to investigate the rate at which the corresponding posteriors merge, as the…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
This paper investigates the computational geometry relevant to calculations of the Frechet mean and variance for probability distributions on the phylogenetic tree space of Billera, Holmes and Vogtmann, using the theory of probability…
The sample mean is often used to aggregate different unbiased estimates of a parameter, producing a final estimate that is unbiased but possibly high-variance. This paper introduces the Bayesian median of means, an aggregation rule that…
This article develops nonparametric inference procedures for estimation and testing problems for means on manifolds. A central limit theorem for Frechet sample means is derived leading to an asymptotic distribution theory of intrinsic…
Local Fr\'echet regression is a nonparametric regression method for metric space valued responses and Euclidean predictors, which can be utilized to obtain estimates of smooth trajectories taking values in general metric spaces from noisy…
In a number of situations, collecting a function value for every data point may be prohibitively expensive, and random sampling ignores any structure in the underlying data. We introduce a scalable optimization algorithm with no correction…
We investigate structural properties of large, sparse random graphs through the lens of "sampling convergence" (Borgs et. al. (2017)). Sampling convergence generalizes left convergence to sparse graphs, and describes the limit in terms of a…