arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2203.07869math.PRcs.CEcs.DM
收藏

用熵最大化方法求多稀疏割集

Finding Many Sparse Cuts Using Entropy Maximization

Farshad Noravesh

摘要:

基于构造一个称为多尺度环过程(MRP)的对偶马尔可夫链和一个新的熵概念,给出了一种寻找稀疏割的随机算法。它示出了如何吸收的双重过程的时间措施的连通性的图形和相应的马尔可夫过程,然后利用它来做聚类的混合。第二种算法使用熵,它提供了一种新的方法和一组工具来考虑稀疏切割以及图的稀疏化。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑