Correcting a nonparametric two-sample graph hypothesis test for graphs with different numbers of vertices with applications to connectomics.
Anton AlyakinJoshua AgterbergHayden S. HelmCarey E. PriebePublished in: Appl. Netw. Sci. (2024)
Keyphrases
- hypothesis test
- labeled graphs
- weighted graph
- adjacency matrix
- undirected graph
- random graphs
- edge weights
- likelihood ratio
- hypothesis testing
- connected graphs
- graph representation
- attributed graphs
- average degree
- planar graphs
- query graph
- graph structure
- connected subgraphs
- hamiltonian cycle
- graph theory
- vertex set
- graph partitioning
- directed graph
- maximum cardinality
- directed edges
- graph matching
- maximal cliques
- graph model
- graph construction
- graph structures
- graph theoretic
- bipartite graph
- graph mining
- subgraph isomorphism
- statistical tests
- graph properties
- graph search
- graph kernels
- graph clustering
- spanning tree
- graph databases
- densely connected
- graph patterns
- directed acyclic graph
- connected components
- hypothesis verification
- minimum weight
- probability model
- hypothesis tests
- minimum spanning tree
- sample size
- shortest path
- graph data
- complex networks
- graphical models
- dynamic graph
- graph mining algorithms