If You Must Choose Among Your Children, Pick the Right One

03/22/2021
by   Benjamin Holmgren, et al.
0

Given a simplicial complex K and an injective function f from the vertices of K to ℝ, we consider algorithms that extend f to a discrete Morse function on K. We show that an algorithm of King, Knudson and Mramor can be described on the directed Hasse diagram of K. Our description has a faster runtime for high dimensional data with no increase in space.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2021

A Sparse Structure Learning Algorithm for Bayesian Network Identification from Discrete High-Dimensional Data

This paper addresses the problem of learning a sparse structure Bayesian...
research
06/04/2008

High dimensional gaussian classification

High dimensional data analysis is known to be as a challenging problem. ...
research
10/30/2017

Distance-based classifier by data transformation for high-dimension, strongly spiked eigenvalue models

We consider classifiers for high-dimensional data under the strongly spi...
research
05/01/2020

Parallel subgroup analysis of high-dimensional data via M-regression

It becomes an interesting problem to identify subgroup structures in dat...
research
05/14/2018

The Maximum Likelihood Threshold of a Path Diagram

Linear structural equation models postulate noisy linear relationships b...

Please sign up or login with your details

Forgot password? Click here to reset