?
A Nonlinear Dynamical Approach to the Interpretation of Microblogging Network Complexity
P. 390–400.
In book
Vol. 689: Complex Networks & Their Applications VI. , Springer, 2018.
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 2026 Vol. 114 No. 1 P. 014217–014217
This study investigates the dynamical origins and statistical properties of extreme events (EEs) in a diffusively coupled theoretical Brusselator system, extending from pairwise interactions to globally coupled networks. Statistically, the emergence of EEs is characterized by heavy-tailed probability density functions and exponential interevent interval distributions, alongside an analysis of the complementary cumulative distribution function and ...
Added: July 15, 2026
Poddiakov A., Klarina E., New psychological research 2026 No. 2 P. 207–227
In the initial stage of our study, participants were shown Polunin’s pantomime 10,000-Meter Race (1981), in which he portrayed a runner growing increasingly exhausted through different stages of the race. In individual interviews, participants were asked about their impressions of the pantomime. Then an emergent turn in the research occurred. One of the participants found and sent ...
Added: June 22, 2026
Yerbolova A. S., Tomashchuk K., Kogan A. et al., Complexity 2026 Vol. 2026 No. 1 Article 5519690
Tis paper presents a novel approach to analyzing and grouping natural languages based on the degree of their chaoticity. It clusters 52 languages from 18 language families, according to the value of the entropy–complexity pair, to reveal the chaotic properties of semantic trajectories. Te obtained clusters appear to be closely correlated with the family of ...
Added: February 16, 2026
Speranski S. O., Journal of Logic and Computation 2013 Vol. 23 No. 5 P. 1035–1055
In the present article, the quantifiers over propositions are first introduced into the language for reasoning about probability, then the complexity issues for validity problems dealing with the corresponding hierarchy of probabilistic sentences are investigated. We prove, among other things, the $\Pi^1_1$-completeness for the general validity and also indicate the least level in the hierarchy ...
Added: December 27, 2025
Speranski S. O., Computability 2015 Vol. 4 No. 2 P. 159–174
Added: December 27, 2025
Speranski S. O., Studia Logica 2017 Vol. 105 No. 2 P. 407–429
The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general. ...
Added: December 26, 2025
Kuznetsov S., Speranski S. O., Annals of Pure and Applied Logic 2022 Vol. 173 No. 2 Article 103057
We introduce infinitary action logic with exponentiation — that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allow some of the structural rules (contraction, weakening, permutation). The logic is presented in the form of an infinitary sequent calculus. We prove cut elimination and, in the case ...
Added: December 26, 2025
Kuznetsov S., Speranski S. O., Studia Logica 2023 Vol. 111 No. 2 P. 251–280
Infinitary action logic can be naturally expanded by adding exponential and subexponential modalities from linear logic. In this article we shall develop infinitary action logic with a subexponential that allows multiplexing (instead of contraction). Both non-commutative and commutative versions of this logic will be considered, presented as infinitary sequent calculi. We shall prove cut admissibility ...
Added: December 26, 2025
Speranski S. O., Logic Journal of the IGPL 2025 Vol. 33 No. 2 Article jzae042
This paper is concerned with a two-sorted probabilistic language, denoted by QPL, which contains quantifiers over events and over reals, and can be viewed as an elementary language for reasoning about probability spaces. The fragment of QPL containing only quantifiers over reals is a variant of the well-known ‘polynomial’ language from [Fagin et al. 1990, Section 6]. ...
Added: December 26, 2025
Speranski S. O., Logic Journal of the IGPL 2025 Vol. 33 No. 3 Article jzae114
We shall be concerned with two natural expansions of the quantifier-free ‘polynomial’ probability logic of [Fagin et al. 1990]. One of these, denoted by QPL-e, is obtained by adding quantifiers over arbitrary events, and the other, denoted by p-QPL-e, uses quantifiers over propositional formulas — or equivalently, over events expressible by such formulas. The earlier proofs ...
Added: December 26, 2025
LePoire D., Grinin L. E., Korotayev A., Journal of Big History 2025 Vol. 8 No. 3 P. 98–139
Building on foundational work in systems theory, thermodynamics, and evolutionary theory, this paper argues that complexity can serve as a conceptual bridge across disciplines. It explores the role of complexity dynamics in Big History through an integrative theoretical framework that spans physical, chemical, geological, biological, social, cognitive, and civilizational domains. By examining how complexity emerges, ...
Added: November 1, 2025
Yury Semenov, Oleg Sukhoroslov, , in: Mathematical Optimization Theory and Operations Research 24th International Conference, MOTOR 2025, Novosibirsk, Russia, July 7–11, 2025, ProceedingsVol. 15681.: Switzerland: Springer, 2025. P. 317–331.
Added: September 17, 2025
Lubashevskiy V., Ejjbiri H., Lubashevsky I., IEEE Access 2025 Vol. 13 P. 60889–60902
The assessment of edge criticality ranking in complex networks is a challenging issue in network science and has numerous applications, including network decomposition and, conversely, enhancing the resilience and redundancy of complex systems. Two main approaches are commonly used to rank edges based on their importance for maintaining network connectivity. The first is the Static approach, which relies on ...
Added: July 10, 2025
Arzhantsev I., Functional Analysis and Its Applications 1997 Vol. 31 No. 4 P. 278–280
Let a connected reductive group G act on a normal affine variety X with the generic stabilizer H, let the complexity of this action be one, and let the categorial quotient X//G be one-dimensional. Then the closure of any G-orbit in X is normal. ...
Added: June 13, 2025
Gromov V., , in: 6th International Conference, TMPA 2021, Tomsk, Russia, November 25–27, 2021, Revised Selected Papers. Tools and Methods of Program AnalysisVol. 1559: CCIS .: Springer, 2024. P. 120–129.
Added: October 29, 2024
Глобина А. К., Глебова С. В., Конфликтология 2020 Т. 15 № 3 С. 127–148
The emerging technologies have penetrated into everyday life and have become natural part of it. Despite the fact that they made the communication, logistics and bureaucracy much simpler, they also originated a group of problems. Questions of incontrollable behaviour of user’s exists in the dialectic symbiosis with fear of total control by government; all of ...
Added: October 26, 2024
Popov V., Chepovskiy A., , in: Complex Networks & Their Applications XIII, Proceedings of The Thirteenth International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2024 - Volume 3.: Springer, 2025. P. 83–90.
Added: September 20, 2024
Krivonosov M., Nazarenko T., Bacalini M. G. et al., Chaos, Solitons and Fractals 2022 Vol. 165 Article 112863
Despite the fact that the cause of Down Syndrome (DS) is well established, the underlying molecular mechanisms that contribute to the syndrome and the phenotype of accelerated aging remain largely unknown. DNA methylation profiles are largely altered in DS, but it remains unclear how different methylation regions and probes are structured into a network of interactions. We ...
Added: March 12, 2024
Springer, 2024.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XII International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2023). The carefully selected papers cover ...
Added: March 5, 2024
Cham: Springer, 2020.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students, and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the Eighth International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2019), which took place in Lisbon, ...
Added: February 27, 2024
Springer, 2024.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XII International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2023). The carefully selected papers cover ...
Added: February 22, 2024
Knyazev S. N., Chhugani K., Sarwal V. et al., Nature Methods 2022 Vol. 19 No. 4 P. 374–380
During the COVID-19 pandemic, genomics and bioinformatics have emerged as essential public health tools. The genomic data acquired using these methods have supported the global health response, facilitated the development of testing methods and allowed the timely tracking of novel SARS-CoV-2 variants. Yet the virtually unlimited potential for rapid generation and analysis of genomic data ...
Added: February 8, 2024