Network Structure Revealed by Short Cycles

Simple item page
dc.creatorBagrow, James
dc.creatorBollt, Erik
dc.creatorCosta, Luciano da F.
dc.date2006-12-19
dc.date.accessioned2026-07-07T07:35:54Z
dc.date.available2026-07-07T07:35:54Z
dc.descriptionThis article explores the relationship between communities and short cycles in complex networks, based on the fact that nodes more densely connected amongst one another are more likely to be linked through short cycles. By identifying combinations of 3-, 4- and 5-edge-cycles, a subnetwork is obtained which contains only those nodes and links belonging to such cycles, which can then be used to highlight community structure. Examples are shown using a theoretical model (Sznajd networks) and a real-world network (NCAA football).
dc.description6 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0612502
dc.identifierhttp://arxiv.org/abs/cond-mat/0612502
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/120248
dc.subjectDisordered Systems and Neural Networks
dc.titleNetwork Structure Revealed by Short Cycles
dc.typetext

Files

Collections

arXiv