A new method for quantifying network cyclic structure to improve community detection

DOI10.1016/J.PHYSA.2020.125116MaRDI QIDQ2143282zbMATH OpenOpenAlexFDO

Authors Behnaz Moradi-Jamei, Heman Shakeri, Pietro Poggi-Corradini, Michael J. Higgins

Publication date 31 May 2022

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.07484

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites work

• scientific article; zbMATH DE number 742629 (Why is no real title available?)
• A First Look at Rigorous Probability Theory
• A faster algorithm for betweenness centrality*
• Community structure in social and biological networks
• Consistency of community detection in networks under degree-corrected stochastic block models
• Enhancing community detection using a network weighting strategy
• Fast unfolding of communities in large networks
• Graph partitioning models for parallel computing
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• Non-backtracking random walk
• Probability Inequalities for Sums of Bounded Random Variables
• The Structure and Function of Complex Networks
• The distribution of first hitting times of non-backtracking random walks on Erdos-Rényi networks
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks

This page was built for publication: A new method for quantifying network cyclic structure to improve community detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143282)