Search Results for author:
Found 5 papers, 1 papers with code
Sharp Threshold for the Frechet Mean (or Median) of Inhomogeneous Erdos-Renyi Random Graphs
We show that the result also holds for the sample mean (or median) when the population expected adjacency matrix is replaced with the sample mean adjacency matrix.
Theoretical analysis and computation of the sample Frechet mean for sets of large graphs based on spectral information
To characterize the location (mean, median) of a set of graphs, one needs a notion of centrality that is adapted to metric spaces, since graph sets are not Euclidean spaces.
On the Number of Edges of the Frechet Mean and Median Graphs
The availability of large datasets composed of graphs creates an unprecedented need to invent novel tools in statistical learning for graph-valued random variables.
Inverting Nonlinear Dimensionality Reduction with Scale-Free Radial Basis Function Interpolation
Nonlinear dimensionality reduction embeddings computed from datasets do not provide a mechanism to compute the inverse map.
Non-Asymptotic Analysis of Tangent Space Perturbation
To process noisy data samples from a nonlinear manifold, PCA must be applied locally, at a scale small enough such that the manifold is approximately linear, but at a scale large enough such that structure may be discerned from noise.
