Search PubMed⌕ Search

Biomedical subjects

Krzysztof Malarz

Publications and source records attributed to Krzysztof Malarz.

3 recordsLinked to original sources

Restoring site percolation on damaged square lattices.

Restoring site percolation on a damaged square lattice with the nearest neighbor (N2) is investigated using two different strategies. In the first one, a density y of new sites are created on the empty sites with longer range links, either next-nearest neighbor (N3) or next-next-nearest neighbor (N4), but without N2. In the second one, new longer range links N3 or N4 are added to N2 but only for a fraction v of the remaining non-destroyed sites. Starting at p(c)(N2), with a density x of randomly destroyed sites, the values of y(c) and v(c), which restore site percolation, are calculated for both strategies with, respectively, N3 and N4 using Monte Carlo simulations. Results are obtained for the whole range 0 < or = x < or = p(c)(N2).

Journal Article↗

Magnetization reversal in spin patterns with complex geometry.

We study field-driven dynamics of spins with antiferromagnetic interactions along the links of a complex substrate geometry, which is modeled by graphs of a controlled connectivity distribution. The magnetization reversal occurs in avalanches of spin flips, which are pinned by the topological constraints of the underlying graph. The hysteresis loop and avalanche sizes are analyzed and classified in terms of the graph's connectivity and clustering. The results are relevant for magnets with a hierarchical spatial inhomogeneity and for design of nanoscale magnetic devices.

Journal Article↗

Square-lattice site percolation at increasing ranges of neighbor bonds.

We report site percolation thresholds for square lattice with neighbor bonds at various increasing ranges. Using Monte Carlo techniques we found that nearest neighbors (NN), next-nearest neighbors (NNN), next-next-nearest neighbors (4N), and fifth-nearest neighbors (6N) yield the same pc = 0.592... . The fourth-nearest neighbors (5N) give pc = 0.298... . This equality is proved to be mathematically exact using symmetry argument. We then consider combinations of various kinds of neighborhoods with (NN+NNN), (NN+4N), (NN+NNN+4N), and (NN+5N). The calculated associated thresholds are respectively pc = 0.407..., 0.337..., 0.288..., and 0.234... . The existing Galam-Mauger universal formula for percolation thresholds does not reproduce the data showing dimension and coordination number are not sufficient to build a universal law which extends to complex lattices.

Journal Article↗