Results 1 to 10 of about 210 (139)
Generalized Open Quantum Walks on Apollonian Networks. [PDF]
PLoS ONE, 2015 We introduce the model of generalized open quantum walks on networks using the Transition Operation Matrices formalism. We focus our analysis on the mean first passage time and the average return time in Apollonian networks.
Łukasz Pawela +3 more
doaj +7 more sources
Polygon-Based Hierarchical Planar Networks Based on Generalized Apollonian Construction
Physics, 2021 Experimentally observed complex networks are often scale-free, small-world and have an unexpectedly large number of small cycles. An Apollonian network is one notable example of a model network simultaneously having all three of these properties.
Mikhail V. Tamm +2 more
doaj +4 more sources
Synchronization Stability Model of Complex Brain Networks: An EEG Study [PDF]
Frontiers in Psychiatry, 2020 In this paper, from the perspective of complex network dynamics we investigated the formation of the synchronization state of the brain networks. Based on the Lyapunov stability theory of complex networks, a synchronous steady-state model suitable for ...
Guimei Yin +6 more
doaj +2 more sources
Degree distribution of random Apollonian network structures and Boltzmann sampling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Random Apollonian networks have been recently introduced for representing real graphs. In this paper we study a modified version: random Apollonian network structures (RANS), which preserve the interesting properties of real graphs and can be handled ...
Alexis Darrasse, Michèle Soria
doaj +2 more sources
Strong Geodetic Problem in Networks
Discussiones Mathematicae Graph Theory, 2020 In order to model certain social network problems, the strong geodetic problem and its related invariant, the strong geodetic number, are introduced.
Manuel Paul +4 more
doaj +3 more sources
Network Reconstruction in Terms of the Priori Structure Information
Frontiers in Physics, 2021 In this paper, we investigate the reconstruction of networks based on priori structure information by the Element Elimination Method (EEM). We firstly generate four types of synthetic networks as small-world networks, random networks, regular networks ...
Jia-Qi Fu +4 more
doaj +1 more source
Toward the “overthrow of Platonism”: Processist critical social ontology and ameliorative discourse
European Journal of Philosophy, Volume 31, Issue 3, Page 622-638, September 2023., 2023 Abstract In this article, I argue that, for the purpose of developing an effective critical social ontology about gender groups, it is not simply sufficient to carve gender groups at their joints: one must have in view whether the metaphysical categories we use to make sense of gender groups are prone to ideological distortion and vitiation.
Paul Giladi
wiley +1 more source
Complexity, Volume 2021, Issue 1, 2021., 2021 Societies have always used their heritage to remain resilient and to express their cultural identities. Today, all the still‐available experiences accrued by human societies over time and across space are, in principle, essential in coping with the twenty‐first century grand challenges of humanity (refer to the 17 UN Sustainable Development Goals ...
Andrea Nanetti, Shu-Heng Chen
wiley +1 more source
Tax Evasion and Multi-Agent-Based Model on Various Topologies [PDF]
Reports in Advances of Physical Sciences, 2017 In this work, we use Monte-Carlo simulations to study the control of the fluctuations for tax evasion in the economics model proposed by [G. Zaklan, F. Westerhoff and D. Stauffer, J. Econ. Interact. Coordination. 4 (2009) 1; G. Zaklam, F.W.S. Lima and F.
F. W. S. Lima
doaj +1 more source
Polynomials and General Degree‐Based Topological Indices of Generalized Sierpinski Networks
Complexity, Volume 2021, Issue 1, 2021., 2021 Sierpinski networks are networks of fractal nature having several applications in computer science, music, chemistry, and mathematics. These networks are commonly used in chaos, fractals, recursive sequences, and complex systems. In this article, we compute various connectivity polynomials such as M‐polynomial, Zagreb polynomials, and forgotten ...
Chengmei Fan +5 more
wiley +1 more source