Hierarchical Cutting of Complex Networks Performed by Random Walks
CoRR(2024)
Abstract
Several interesting approaches have been reported in the literature on
complex networks, random walks, and hierarchy of graphs. While many of these
works perform random walks on stable, fixed networks, in the present work we
address the situation in which the connections traversed by each step of a
uniformly random walks are progressively removed, yielding a successively less
interconnected structure that may break into two components, therefore
establishing a respective hierarchy. The sizes of each of these pairs of sliced
networks, as well as the permanence of each connected component, are studied in
the present work. Several interesting results are reported, including the
tendency of geometrical networks sometimes to be broken into two components
with comparable large sizes.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined