44 citations · 142 across the 11 of their papers we have counts for
7 papers · 1 filter
Numbers of n-th neighbors and node-to-node distances in growing networks
K. Malarz
Topology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest…
Reshuffling spins with short range interactions: When sociophysics produces physical results
A. O. Sousa, K. Malarz, S. Galam
Galam reshuffling introduced in opinion dynamics models is investigated under the nearest neighbor Ising model on a square lattice using Monte Carlo simulations. While the correspo…
How to count trees?
S. Piec, K. Malarz, K. Kulakowski
We propose a new topological invariant of unlabeled trees of N nodes. The invariant is a set of Nx2 matrices of integers, with sum_j k^{d_{i,j}} and v_i as the matrix elements, whe…
Magnetization reversal in spin patterns with complex geometry
B. Tadic, K. Malarz, K. Kulakowski
We study field-driven dynamics of spins with antiferromagnetic interaction along the links of a complex substrate geometry, which is modeled by graphs of a controlled connectivity…
Restoring site percolation on a damaged square lattice
Serge Galam, Krzysztof Malarz
We study how to restore site percolation on a damaged square lattice with nearest neighbor (N) interactions. Two strategies are suggested for a density of destroyed sites b…
Dependence of the average to-node distance on the node degree for random graphs and growing networks
K. Malarz, K. Kulakowski
In a graph, nodes can be characterized locally (with their degree ) or globally (e.g. with their average length path to other nodes). Here we investigate how depends on…