2022/03/08 by Farshad Noravesh, Noravesh, Farshad
Computer Science · Physics and Astronomy · #Complex Network Analysis Techniques #Computational Engineering #Data Visualization and Analytics #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Finance #Probability (math.PR) #Rough Sets and Fuzzy Logic #and Science (cs.CE)
paper · pdf · doi:10.48550/arxiv.2203.07869
openalex publication_date 2022/03/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A randomized algorithm for finding sparse cuts is given which is based on constructing a dual markov chain called multiscale rings process(MRP) and a new concept of entropy. It is shown how the time to absorption of the dual process measures the connectedness of the graph and mixing of the corresponding markov process which is then utilized to do clustering. The second algorithm uses the entropy which provides a new methodology and a set of tools to think about sparse cuts as well as sparsification of a graph.