437 citations · 1.2k across the 32 of their papers we have counts for
4 papers · 1 filter
Discovering hidden layers in quantum graphs
Łukasz G. Gajewski, Julian Sienkiewicz, Janusz A. Hołyst
Finding hidden layers in complex networks is an important and a non-trivial problem in modern science. We explore the framework of quantum graphs to determine whether concealed par…
Log-periodic oscillations due to discrete effects in complex networks
Julian Sienkiewicz, Piotr Fronczak, Janusz A. Holyst
We show that discretization of internode distribution in complex networks affects internode distances l_ij calculated as a function of degrees (k_i k_j) and an average path length…
Universal scaling of distances in complex networks
Janusz A. Holyst, Julian Sienkiewicz, Agata Fronczak +2
Universal scaling of distances between vertices of Erdos-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Auton…
Higher order clustering coefficients in Barabasi-Albert networks
Agata Fronczak, Janusz A. Holyst, Maciej Jedynak +1
Higher order clustering coefficients are introduced for random networks. The coefficients express probabilities that the shortest distance between any two nearest neighbours…