?
Proceedings of the 5th International Electronic Conference on Entropy and Its Applications
Vol. 46. Issue 1.
MDPI AG, 2020.
Proceedings (ISSN 2504-3900) publishes publications resulting from conferences, workshops and similar events.
Chapters
Koltsov S., Ignatenko V., Pashakhin S., , in: Proceedings of the 5th International Electronic Conference on Entropy and Its ApplicationsVol. 46. Issue 1.: MDPI AG, 2020. Ch. 5 P. 1–8.
In practice, the critical step in building machine learning models of big data (BD) is costly in terms of time and the computing resources procedure of parameter tuning with a grid search. Due to the size, BD are comparable to mesoscopic physical systems. Hence, methods of statistical physics could be applied to BD. The paper ...
Added: March 13, 2020
David J. L., Leonid Grinin, Korotayev A., , in: Complexity in Universal Evolution. A Big History Perspective.: Springer, 2026. Ch. 22 P. 585–608.
This collective monograph explores focus on complexity aspects in Big History against the background of complexity growth in the Universe, on our planet, and in biological, social, and cultural systems. Complexity growth is regarded as the connecting thread of evolutionary development and as a leading trend of Big History. The cosmic development chapters examine symmetries ...
Added: August 10, 2026
Korotayev A., , in: Complexity in Universal Evolution. A Big History Perspective.: Springer, 2026. Ch. 13 P. 359–409.
We have undertaken an attempt to propose a periodization of the Big History Biosocial (Anthropogenesis) Era on the basis of the most recent scientific data. This periodization is complexity-based, that is, the boundaries of the identified epochs are marked with complexity jumps, that is, in our case, such phase transitions that result in significant increases ...
Added: August 10, 2026
Leonid Grinin, Alexander M., Korotayev A., , in: Complexity in Universal Evolution. A Big History Perspective.: Springer, 2026. Ch. 12 P. 283–355.
In the first half of this chapter, Grinin et al. survey general similarities and differences between biological and social macroevolution. They undertake a systematic comparison between biological and social evolution at different levels of analysis and in various aspects, formulating a considerable number of general principles and rules of evolution, and working to develop a ...
Added: August 10, 2026
David J. L., Leonid Grinin, Korotayev A., , in: Complexity in Universal Evolution. A Big History Perspective.: Springer, 2026. Ch. 2 P. 29–90.
This chapter explores the role of complexity dynamics in Big History through an integrative theoretical framework that spans physical, chemical, biological, social, cognitive, and civilizational domains. Building on foundational work in systemstheory,thermodynamics,andevolutionarytheory,thechapterarguesthat complexity can serve as a conceptual bridge across disciplines. By examining how complexity emerges, is sustained, and transforms across thresholds, as well as ...
Added: August 10, 2026
David J. L., Leonid Grinin, Korotayev A., , in: Complexity in Universal Evolution. A Big History Perspective.: Springer, 2026. Ch. 1 P. 1–25.
Complexity is widely acknowledged as a foundational and pivotal concept in Big History, offering a unifying lens through which to examine the emergence and development of systems—from particles and galaxies to life, civilizations, and beyond. Yet, despite its centrality, major gaps remain in how we define, measure, and interpret complexity across different phases and scales. ...
Added: August 10, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Polyakov S., Smeshkova L., Lapin V. et al., Veredas do Direito 2026 Vol. 23 No. 11 Article e237531
The article examines the significant transformation of the concept of information and its impact on modern security technologies. Until the middle of the 20th century, the concept of information was considered as a philosophical category related to the transfer of knowledge and meaning. With the advent of Claude Shannon's communication theory, information was reinterpreted as ...
Added: July 27, 2026
Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.
In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...
Added: July 21, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Chryssomalakos C., Flores-Delgado A. G., Guzman Gonzalez E. et al., Physical Review A: Atomic, Molecular, and Optical physics 2026 Vol. 113 Article L060404
Added: June 3, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Makarov D. M., Kalikin N., Gurikov P. et al., Journal of Supercritical Fluids 2026 Vol. 235 Article 106979
Supercritical CO2 (scCO2 ) is an environmentally friendly solvent, but its low polarity limits the solubility of polar compounds. Cosolvents are commonly used to enhance solvation capability, yet comprehensive datadriven studies are scarce. We compiled the largest dataset to date — 4401 experimental solubility records with 22 cosolvents for 93 nonionic solutes, plus 4855 records ...
Added: April 19, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 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
Соболев В. Н., Фролов А. А., Чебышевский сборник 2025 Т. 26 № 5 С. 203–220
In the article, on the class K 0 of infinite binary sequences without the runs of ones, a
consistent probability distribution P is constructed which is induced by a time-homogeneous
Markov chain with a one-step transition matrix P𝜑 , and is completely determined by the
golden ratio 𝜑. Using a Markov chain to construct a probability measure P ...
Added: February 11, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 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