Tuning complexity on randomly occupied lattices

被引:0
|
作者
Jyh, TI [1 ]
Ren, TI [1 ]
机构
[1] Univ Antwerp, RUCA, Vis Lab, Dept Phys, B-2020 Antwerp, Belgium
关键词
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Using diversity of cluster size (mass) as a measurement of structural complexity on randomly occupied lattices, we describe a tuning effect in complexity by parameters L, size of the lattice, and p, probability of occupation. We also show the behavior of the number of fragments (clusters) in relation to the probability of occupation p. Another kind of pattern used to define diversity was the form (shape) of the cluster. A behavior similar to the cluster size diversity was observed. Showing that diversity as a measurement of complexity has an inherent subjective constraint. Scaling relations between the variables measured show some aspects of the complexity of the system and can give more insights into the tuning effect observed.
引用
收藏
页码:569 / 578
页数:10
相关论文
共 50 条
  • [21] SELF-AVOIDING WALKS ON RANDOMLY DILUTED LATTICES
    LYKLEMA, JW
    KREMER, K
    ZEITSCHRIFT FUR PHYSIK B-CONDENSED MATTER, 1984, 55 (01): : 41 - 44
  • [22] SELF-AVOIDING WALKS ON RANDOMLY DILUTED LATTICES
    LEE, SB
    NAKANISHI, H
    PHYSICAL REVIEW LETTERS, 1988, 61 (18) : 2022 - 2025
  • [23] On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams
    Har-Peled, Sariel
    Raichel, Benjamin
    DISCRETE & COMPUTATIONAL GEOMETRY, 2015, 53 (03) : 547 - 568
  • [24] THE COMPLEXITY OF QUASIVARIETY LATTICES. II
    Schwidefsky, M. V.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2023, 20 (01): : 501 - 513
  • [25] ON THE COMPUTATIONAL-COMPLEXITY OF ALGEBRA ON LATTICES
    HUNT, HB
    ROSENKRANTZ, DJ
    BLONIARZ, PA
    SIAM JOURNAL ON COMPUTING, 1987, 16 (01) : 129 - 148
  • [26] Upper bounds on trellis complexity of lattices
    Tarokh, V
    Vardy, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (04) : 1294 - 1300
  • [27] On the trellis complexity of root lattices and their duals
    Banihashemi, AH
    Blake, IF
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) : 2168 - 2172
  • [28] On the Complexity of Randomly Weighted Multiplicative Voronoi Diagrams
    Sariel Har-Peled
    Benjamin Raichel
    Discrete & Computational Geometry, 2015, 53 : 547 - 568
  • [29] Lattices in machine learning: Complexity issues
    Kourie, DG
    Oosthuizen, GD
    ACTA INFORMATICA, 1998, 35 (04) : 269 - 292
  • [30] On the Complexity of Randomly Overlapped Subarray Feeding Networks
    Bianchi, Davide
    Genovesi, Simone
    Monorchio, Agostino
    2017 PROGRESS IN ELECTROMAGNETICS RESEARCH SYMPOSIUM - SPRING (PIERS), 2017, : 3586 - 3589