all AI news
Edge Augmentation on Disconnected Graphs via Eigenvalue Elevation. (arXiv:2207.05301v1 [cs.SI])
July 13, 2022, 1:11 a.m. | Tianyi Li
stat.ML updates on arXiv.org arxiv.org
The graph-theoretical task of determining most likely inter-community edges
based on disconnected subgraphs' intra-community connectivity is proposed. An
algorithm is developed for this edge augmentation task, based on elevating the
zero eigenvalues of graph's spectrum. Upper bounds for eigenvalue elevation
amplitude and for the corresponding augmented edge density are derived and are
authenticated with simulation on random graphs. The algorithm works
consistently across synthetic and real networks, yielding desirable performance
at connecting graph components. Edge augmentation reverse-engineers graph
partition under …
More from arxiv.org / stat.ML updates on arXiv.org
Jobs in AI, ML, Big Data
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Senior Machine Learning Engineer
@ Samsara | Canada - Remote