Unveiling community structures in weighted networks

Simple item page
dc.creatorAlves, Nelson Augusto
dc.date2007-03-07
dc.date.accessioned2026-07-07T08:30:57Z
dc.date.available2026-07-07T08:30:57Z
dc.descriptionRandom walks on simple graphs in connection with electrical resistor networks lead to the definition of Markov chains with transition probability matrix in terms of electrical conductances. We extend this definition to an effective transition matrix $P_{ij}$ to account for the probability of going from vertex $i$ to any vertex $j$ of the original connected graph $G$. Also, we present an algorithm based on the definition of this effective transition matrix among vertices in the network to extract a topological feature related to the manner graph $G$ has been organized. This topological feature corresponds to the communities in the graph.
dc.identifierhttps://arxiv.org/abs/physics/0703087
dc.identifierhttp://arxiv.org/abs/physics/0703087
dc.identifierPhysical Review E 76 (2007) 036101
dc.identifierdoi:10.1103/PhysRevE.76.036101
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138376
dc.subjectPhysics and Society
dc.subjectStatistical Mechanics
dc.subjectData Analysis, Statistics and Probability
dc.titleUnveiling community structures in weighted networks
dc.typetext

Files

Collections

arXiv