4 papers
Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
Harvey Diamond, Mark Kon, Louise Raphael
Given a directed graph, the Minimum Feedback Arc Set (FAS) problem asks for a minimum (size) set of arcs in a directed graph, which, when removed, results in an acyclic graph. In a…
Classifying the Concentration of the Boolean Cube for Dependent Distributions
Jonathan Root, Mark Kon
A metric probability space obeys the if subsets of measure enlarge to subsets of measure close to 1 as a transition…
Feature Network Methods in Machine Learning and Applications
Xinying Mu, Mark Kon
A machine learning (ML) feature network is a graph that connects ML features in learning tasks based on their similarity. This network representation allows us to view feature vect…
Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
Harvey Diamond, Mark Kon, Louise Raphael
Given a directed graph, the Minimal Feedback Arc Set (FAS) problem asks for a minimal set of arcs which, when removed, results in an acyclic graph. Equivalently, the FAS problem as…