?
On the Random Minimum Spanning Subgraph Problem for Hypergraphs
Zvonkov N.
The weight of the minimum spanning tree in a complete weighted graph with random edge weights is a well-known problem. For various classes of distributions, it is proved that the weight of the minimum spanning tree tends to a constant, which can be calculated depending on the distribution. In this paper, we generalise this result to the hypergraphs setting.
Priority areas:
mathematics
Language:
English
FRUCT Oy, 2024.
Added: September 19, 2026
FRUCT Oy, 2025.
Added: September 19, 2026
FRUCT Oy, 2026.
Added: September 19, 2026
Aleksei Samarin, Nazarenko A., Kotenko E. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 8 P. 1–26
This paper presents a novel method for pruning deep neural networks based on the concept of flow, derived from the continuous modeling of signal propagation across layers. We derive flow functions for fully connected, convolutional, and self-attention architectures, and we propose a new iterative pruning algorithm, Iterative Flow-Aware Pruning (IFAP), that leverages these measures to ...
Added: September 19, 2026
Myachin A. L., Procedia Computer Science 2026 Vol. 287 P. 193–200
We extend the static pattern analysis method to the temporal dimension by introducing a six-type trajectory taxonomy that classifies objects according to the frequency and structure of pattern switches over an observation window of T > 8 periods. For each object, a reference pattern is designated as the most frequently occupied group over the observation ...
Added: September 18, 2026
Kuzyutin D., Smirnova N., Veselkov A., Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software 2026 Vol. 19 No. 3 P. 40–49
We consider spatial dynamic fishery management problem taking into account the resource migration process between an open-access fishing area and no-take marine protected area. The introduced extension of a standard single-criterion fish war game implies that each player aims to maximize simultaneously two performance criteria which present an economic benefit and an environmental conservation goal ...
Added: September 18, 2026
Громов Р. С., Нестеров Р.А., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 23–44
This paper explores the performance criteria of the newest algorithm for solving the problem of finding shortest paths on a graph from a given vertex – Bounded Multi-Source Shortest Path Algorithm
(BM-SSP). The algorithm was published in 2025 and, as its creators claim, it is asymptotically superior to Dijkstra’s deterministic algorithm. However, in the publication devoted ...
Added: September 18, 2026
Ероховец Николай Юрьевич, Математический сборник 2026 Т. 217 № 5 С. 45–89
Toric topology assigns to each simple convex n-polytope P with m facets an n-dimensional real moment-angle manifold RZP with a canonical action of Zm2=(Z/2Z)m. We consider (not necessarily free) actions of subgroups H⊂Zm2 on RZP. The orbit space N(P,H)=RZP/H carries an action of Zm2/H. For general n we introduce the notion of Hamiltonian C(n,k)-subcomplex in the boundary of an ...
Added: September 17, 2026
Kuninets A., Malygina E., Cryptography and Communications 2026
In this paper, we determine explicit bases for Riemann–Roch spaces associated with various families of elliptic codes. We establish the feasibility and provide exact algorithms for constructing bases of Riemann–Roch spaces corresponding to arbitrary divisors on elliptic curves, including the non-effective case. These results are subsequently applied to derive bases for quasi-cyclic elliptic codes and ...
Added: September 17, 2026
Кузнецов М. Е., Полякова М., Лукьянович В. et al., ФАНУ "Востокгосплан", 2026.
Обзор международных практик развития робототехники и искусственного интеллекта и оценка возможностей их применения в условиях России, в первую очередь для Дальнего Востока и Арктической зоны РФ ...
Added: September 16, 2026
Kazakov A., Koryakin V., Safonov K. et al., Journal of Differential Equations 2026 Vol. 480 Article 114626
We study a family of one-dimensional maps that models the dynamics of a system of differential equations with a Lorenz attractor near a bifurcation curve where the system has a pair of homoclinic loops with zero separatrix value. Of particular interest is the region of the parameter plane where the map has a robust chaotic ...
Added: September 16, 2026
Letellier C., Stankevich N., Houri S. et al., Chaos 2026 Vol. 36 No. 9 Article 093128
Toroidal chaos designates a chaotic solution that is structured in the neighborhood of a torus. For being chaotic, such a torus needs to be discontinuously fractalized to present a Cantor set, ensuring the great sensitivity to initial conditions required for chaos. A fractal is related to self-similarity and a non-integer dimension. In fact, although clearly ...
Added: September 16, 2026
Poddiakov A., / Series Social Science Research Network "Social Science Research Network". 2026. No. 7437658.
Clarity of knowledge and reasoning is necessary in many cases. Yet vagueness in scientific thinking related to surprise, curiosity, "ability to engage with not-knowing" (de Freitas) and abductive reasoning is also a crucially important source of scientific creativity which supplements combinatorial logic when dealing with the already known. Starting from studies by C. S. Peirce ...
Added: September 15, 2026
Melman A., Evsyutin O., Computer Science Review 2027 Vol. 63 (A) Article 101066
One of the effective means of protecting digital images is invisible watermarking. Different scenarios have different requirements for watermark resistance to post-processing. Robust watermarking schemes are resistant to a wide range of modifications. Fragile watermarking schemes are designed for integrity control and are destroyed by even minor modifications of images. Semi-fragile watermarking schemes combine features ...
Added: September 15, 2026
Воронова К. Д., Lyadova L. N., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 153–170
Title: Automated Event Logs Generation Based on Unstructured Internet Sources for Process Analysis Tasks
Abstract. This paper presents an approach to automated structuring event-related information extracted from unstructured textual Internet sources for process mining tasks. In many practical cases, information on events associated with various processes is not presented in the form of ready-made event logs, but is ...
Added: September 14, 2026
Springer, 2026.
This book gathers selected papers from the KES-IDT 2025 conference, held in Solin, Croatia, on June 25–27, 2025. The book presents and discusses the latest research results and generates new ideas in the field of intelligent decision-making. The range of topics discussed is classification, prediction, data analysis, big data, data science, decision support, knowledge engineering, ...
Added: September 13, 2026
Glutsyuk A., / Series arXiv "math". 2026.
B.Josephson (Nobel Prize, 1973) predicted a tunnelling effect for a system of two superconductors separated by a narrow dielectric (such a system is called Josephson junction): existence of a supercurrent through it and equations governing it. The overdamped Josephson junction is modeled by the family of differential equations on the 2-torus, dθdτ=1ω(cosθ+B+Acosτ), which is known as ...
Added: September 8, 2026
Pochinka O., Shmukler V., / Series math.RT "arXiv:1808.06395 [math.RT]". 2026.
Anosov flows have a long and rich history, firstly motivated by the
study of geodesic flows in negative curvature surface by Anosov and Sinai.
Not every closed manifold admits an Anosov flow for well-known reasons:
the fundamental group of a 3-manifold M admitting an Anosov flow must
have exponential growth, and M must be universally covered by R3. Nevertheless,
there ...
Added: August 31, 2026
Vlasenko D., Saranskaia I., Zakharov D., European Physical Journal: Special Topics 2026 P. 1–16
Hypergraphs provide a natural framework for representing neurophysiological interactions distributed across sets of sensors. A key methodological question is how hyperedges should be defined from frequency-resolved electroencephalography/magnetoencephalography (EEG/MEG) data. We demonstrate a construction strategy in which hyperedges are obtained from canonical coherence (caCOH), an extension of coherence that estimates coupling between multidimensional signal spaces. To ...
Added: August 18, 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
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026