426 citations · 435 across the 4 of their papers we have counts for
4 papers
Zero-divisor algebras of graph functions: quantum caging, entangling routing and stochastic first-passage exclusion
Fülöp Bazsó
We construct Lie-bialgebraic differential structures on vertex functions of a finite graph using coefficients in commutative algebras with zero divisors. We derive the exact Jacobi…
Regular decomposition of large graphs and other structures: scalability and robustness towards missing data
Hannu Reittu, Ilkka Norros, Fülöp Bazsó
A method for compression of large graphs and matrices to a block structure is further developed. Szemerédi's regularity lemma is used as a generic motivation of the significance of…
Regular Decomposition: an information and graph theoretic approach to stochastic block models
Hannu Reittu, Fülöp Bazsó, Ilkka Norros
A method for compression of large graphs and non-negative matrices to a block structure is proposed. Szemerédi's regularity lemma is used as heuristic motivation of the significanc…
Fuzzy communities and the concept of bridgeness in complex networks
Tamás Nepusz, Andrea Petróczi, László Négyessy +1
We consider the problem of fuzzy community detection in networks, which complements and expands the concept of overlapping community structure. Our approach allows each vertex of t…