Corpus ID: 203593722

A Quotient Space Formulation for Statistical Analysis of Graphical Data

  title={A Quotient Space Formulation for Statistical Analysis of Graphical Data},
  author={X. Guo and Anuj Srivastava and Sudeep Sarkar},
Complex analyses involving multiple, dependent random quantities often lead to graphical models: a set of nodes denoting variables of interest, and corresponding edges denoting statistical interactions between nodes. To develop statistical analyses for graphical data, one needs mathematical representations and metrics for matching and comparing graphs, and other geometrical tools, such as geodesics, means, and covariances, on representation spaces of graphs. This paper utilizes a quotient… Expand
Representations, Metrics and Statistics for Shape Analysis of Elastic Graphs
  • X. Guo, A. Srivastava
  • Computer Science, Mathematics
  • 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)
  • 2020
A quotient structure is utilizes to develop efficient algorithms for computing these quantities, leading to useful statistical tools, including principal component analysis and analytical statistical testing and modeling of graphical shapes. Expand
Populations of Unlabeled Networks: Graph Space Geometry and Geodesic Principal Components
Statistical analysis for populations of networks is widely applicable, but challenging as networks have strongly non-Euclidean behavior. Graph Space is an exhaustive framework for studyingExpand
Advances in Geometrical Analysis of Topologically-Varying Shapes
This paper summarizes recent progress where geometrical approaches are beginning to handle topologically different objects – trees, graphs, etc – that exhibit arbitrary branching and connectivity patterns. Expand
Gromov-Wasserstein Averaging in a Riemannian Framework
  • Samir Chowdhury, Tom Needham
  • Mathematics, Computer Science
  • 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)
  • 2020
A theoretical framework for performing statistical tasks on the space of (possibly asymmetric) matrices with arbitrary entries and sizes under the lens of the Gromov-Wasserstein distance is introduced, and the Riemannian framework of GW distances developed by Sturm is translated into practical, implementable tools for network data analysis. Expand
Statistical shape analysis of brain arterial networks (BAN)
A mathematical representation, a Riemannian metric and other geometrical tools, such as computations of geodesics, means and covariances, and PCA for analyzing elastic graphs and BANs are developed and found an increased variance in BAN shapes as age increases. Expand
Sketching Merge Trees
A framework for sketching a set of merge trees is developed that combines the Gromov-Wasserstein framework of Chowdhury and Needham with techniques from matrix sketching. Expand
Multilevel Motion Planning: A Fiber Bundle Formulation
The terminology of fiber bundles is introduced, in particular the notion of restrictions and sections, which is used to develop novel multilevel motion planning algorithms, which are called QRRT and QMP and shown to be probabilistically complete and almost-surely asymptotically optimal. Expand
Network Recovery from Unlabeled Noisy Samples
This work identifies a specific regime in the noisy network literature for recovery that is asymptotically unbiased and computationally tractable based on a three-stage recovery procedure that aligns the networks via a sequential pairwise graph matching procedure. Expand


Manifold valued data analysis of samples of networks, with applications in corpus linguistics
Networks can be used in many applications, such as in the analysis of text documents, social interactions and brain activity. We develop a general framework for extrinsic statistical analysis ofExpand
Structure Spaces
It will turn out that a number of problems in structural pattern recognition such as central clustering or learning in structured output spaces can be formulated as optimization problems with cost functions that are locally Lipschitz, and methods from nonsmooth analysis are applicable to optimize those cost functions. Expand
Interactive Visualization of Gene Regulatory Networks with Associated Gene Expression Time Series Data
The case study shows that the application fills the gap between present biological interpretation of time series experiments, performed on a gene-by-gene basis, and analysis of global classes of genes whose expression is regulated by regulator proteins. Expand
Use of Graph Theory to Support Map Generalization
In the generalization of a concept, we seek to preserve the essential characteristics and behavior of objects. In map generalization, the appropriate selection and application of procedures (such asExpand
Generative Graph Prototypes from Information Theory
Empirical evaluations on real-world databases demonstrate the practical utility and effectiveness of the generative model for the tasks of graph classification, graph clustering and generating new sample graphs. Expand
An eigenspace projection clustering method for inexact graph matching
  • T. Caelli, S. Kosinov
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2004
This paper shows how inexact graph matching can be solved using the renormalization of projections of the vertices into the joint eigenspace of a pair of graphs and a form of relational clustering. Expand
A Graduated Assignment Algorithm for Graph Matching
A graduated assignment algorithm for graph matching is presented which is fast and accurate even in the presence of high noise, and not restricted to any special class of graph, is applied to subgraph isomorphism, weighted graph matching, and attributed relational graph matching. Expand
Fast Approximate Quadratic Programming for Graph Matching
This work presents its graph matching algorithm, the Fast Approximate Quadratic assignment algorithm, and empirically demonstrates that the algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Expand
LINE: Large-scale Information Network Embedding
A novel network embedding method called the ``LINE,'' which is suitable for arbitrary types of information networks: undirected, directed, and/or weighted, and optimizes a carefully designed objective function that preserves both the local and global network structures. Expand
The impacts of network topology on disease spread
Abstract Individuals in a population susceptible to a disease may be represented as vertices in a network, with the edges that connect vertices representing social and/or spatial contact betweenExpand