?
Generalized Centrality Measures for Multiplex Networks: Combining Node Attributes and Group Dynamics
Procedia Computer Science. 2025. Vol. 266. P. 818–824.
Many complex systems are best represented as multilayer or multiplex networks, where nodes are connected through multiple types of links across different layers. This layered structure introduces additional challenges for identifying central elements, as traditional centrality measures typically assume a single-layer network. The paper introduces a new centrality framework for multiplex networks that accounts for both vertex attributes and group-mediated influence, offering a refined approach to identifying critical nodes in multilayer systems. Additionally, we introduce a block concept, combining weights, node parameters, and inter-layer group effects into a unified analytical model. The model is applied to the Florence families dataset.
Gorbounov Vassily, Kazakov A., Data Analytics and Topology 2025 Vol. 1 No. 1 P. 33–45
A classic problem in data analysis is studying the systems of subsets defined by either a similarity or a dissimilarity function on X which is either observed directly or derived from a data set.
For an electrical network there are two functions on the set of the nodes defined by the resistance matrix and the response ...
Added: May 28, 2026
Degtyarev A., Bakhurin S., Yudin N., DSPA 2026 P. 1–6
This paper investigates one possible solution to the problem of self-interference cancellation (SIC) arising in the design of in-band full-duplex (IBFD) communication systems. Self-interference cancellation is performed in the digital domain using multilayer nonlinear models adapted via gradient-based optimization. The presence of local minima and saddle points during the adaptation of multilayer models limits the ...
Added: May 26, 2026
Ilyashenko Y., Shilin I., Stanislav Minkov, Russian Journal of Mathematical Physics 2026 Vol. 33 No. 1 P. 89–106
In this paper, new numerical invariants of structurally unstable vector fields in the plane
are found. One of the main tools is an improved asymptotics of sparkling saddle connections that
occur when a separatrix loop of a hyperbolic saddle breaks. Another main tool is a new topological
invariant of two arithmetic progressions, both perturbed and unperturbed, on the ...
Added: May 26, 2026
Gusev I., Maksaev A., Promyslov V., Journal of Mathematical Sciences 2025 Vol. 299 No. 6
The regular graph of the space of n × m matrices over a field F is defined as the undirected graph whose vertices are matrices of rank min(n, m), and distinct matrices A and B are connected by an edge if and only if rk(A + B) < min(n, m). In this paper, for |F| ...
Added: May 25, 2026
Tyukin I., Tyukina T., van Helden D. P. et al., Information Sciences 2024 Vol. 678 Article 120856
AI errors pose a significant challenge, hindering real-world applications. This work introduces a novel approach to cope with AI errors using weakly supervised error correctors that guarantee a specific level of error reduction. Our correctors have low computational cost and can be used to decide whether to abstain from making an unsafe classification. We provide ...
Added: May 23, 2026
Zaikin A., Sviridov I., Sosedka A. et al., Technologies 2026 Vol. 14 No. 2 Article 84
High-dimensional tabular data are common in biomedical and clinical research, yet conventional machine learning methods often struggle in such settings due to data scarcity, feature redundancy, and limited generalization. In this study, we systematically evaluate Synolitic Graph Neural Networks (SGNNs), a framework that transforms high-dimensional samples into sample-specific graphs by training ensembles of low-dimensional pairwise ...
Added: May 23, 2026
Chertopolokhov V., Mukhamedov A., Bugriy G. et al., IEEE Access 2026 Vol. 14 P. 14369–14392
This study presents on-the-fly identification and multi-step prediction of nonlinear systems with delayed inputs using a dynamic neural network combined with a smooth projection onto ellipsoids. The projection enforces parameter constraints that guarantee stability, while a Lyapunov–Krasovskii analysis yields computable ultimate error bounds. Riccati-type matrix inequalities are derived, providing an efficient vectorization–projection–devectorization implementation suitable for ...
Added: May 22, 2026
Морозов С. В., Calcolo 2026 Vol. 63 No. 2 Article 23
The approximation of tensors in a low-para metric format is a crucial component in many mathematical modelling and data analysis tasks. Among the widely used low-parametric representations, the canonical polyadic (CP) decomposition is known to be very efficient. Nowadays, most algorithms for CP approximation aim to construct the approximation in the Frobenius norm; however, some ...
Added: May 22, 2026
Селянин Ф. И., Journal of Dynamical and Control Systems 2026 Vol. 32 No. 2 Article 18
A B-facet is a lattice -dimensional polytope in the positive octant with a positive normal covector, such that every -dimensional simplex with vertices in it is a B-simplex (i.e., a pyramid of height one with base on a coordinate hyperplane). B-facets were introduced in [2] in the context of the monodromy conjecture. In this paper, we complete the ...
Added: May 21, 2026
Ausubel L., Baranov O., Journal of Economic Theory 2026 Vol. 235 Article 106192
The Vickrey-Clarke-Groves (VCG) mechanism is one of the most compelling constructs in mechanism design, but the presence of complementary goods creates the possibility of non-core and even zero-revenue outcomes. In this article, we show that joint feasibility constraints on allocations offer a second pathway to ill-behaved outcomes in the VCG mechanism, even when all bidders ...
Added: May 20, 2026
Denis Seliutskii, Russian Journal of Mathematical Physics 2025 Vol. 32 No. 2 P. 399–407
In this paper, we find an upper bound for the first Steklov eigenvalue for a surface of revolution with boundary consisting of two spheres of different radii. Moreover, we prove that, in some cases, this boundary is sharp. ...
Added: May 19, 2026
Жакупов О. Б., European Journal of Mathematics 2025 Vol. 11 Article 84
We provide examples of smooth three-dimensional Fano complete intersections of degree 2, 4, 6, and 8 that have absolute coregularity 0. Considering the main theorem of Avilov, Loginov, and Przyjalkowski (CNTP 18:506–577, 2024) on the remaining 101 families of smooth Fano threefolds, our result implies that each family of smooth Fano threefolds has an element of absolute ...
Added: May 18, 2026
Gurevich E., Saraev I., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 19–56
In this paper, we consider a class of gradient-like ows without heteroclinic
intersections, dened on closed manifolds of dimension four. We show that for
such ows, the problem of complete topological classication can be reduced to
the combinatorial problem of distinguishing special framed graphs describing
the mutual arrangement of invariant manifolds and the action of the ow on a
wandering ...
Added: May 18, 2026
Gonchenko S., Lerman L., Turaev D., Regular and Chaotic Dynamics 2026 Vol. 31 No. 3 P. 349–369
We show that bifurcations of four-dimensional symplectic diffeomorphisms with a quadratic homoclinic tangency to a saddle periodic orbit with real multipliers produce 2-elliptic periodic orbits if the tangency is not partially hyperbolic. We show that a normal form for the rescaled first-return maps near such tangency is given by a four-dimensional symplectic H´enonlike map and study bifurcations of the ...
Added: May 15, 2026
Aleskerov F. T., Khutorskaya O., Stepochkina A. et al., Springer, 2026.
The book contains new models of bibliometric analysis based on centrality measures in network analysis, pattern analysis and stability analysis. A distinctive feature of these centrality measures is that they account for the parameters of vertices and group influence of vertices to a vertex. This reveals specific groups of publications, authors, terms, journals and affiliations ...
Added: May 15, 2026
Kuptsov P., Panyushev A., Stankevich N., Chaos 2026 Vol. 36 No. 5 Article 053138
We develop a machine-learning approach to reproduce the behavior of two versions of the van der Pol oscillator exhibiting a subcritical Andronov–Hopf bifurcation, with or without a codimension-2 Bautin point. We construct a neural-network model that functions as a recur rent map and train it on short segments of oscillator trajectories. The results show that, ...
Added: May 15, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Lebedev V., Journal of Mathematical Analysis and Applications 2026 Vol. 563 No. 2 Article 130787
It is known that for every continuous real-valued
function $f$ on the circle $\mathbb T=\mathbb R/2\pi\mathbb Z$ there exists a
change of variable, i.e., a self-homeomorphism $h$ of $\mathbb T$, such that
the superposition $f\circ h$ is in the Sobolev space $W_2^{1/2}(\mathbb T)$.
We obtain new results on simultaneous improvement of functions by a single
change of variable in relation ...
Added: May 14, 2026
Leonidov A., Vasilyev S., Vasilyeva E., Chaos, Solitons and Fractals 2025 Vol. 201 No. 2 Article 117242
Game-theoretic static equilibria in multiagent two-layered consensus/opinion formation noisy binary choice model are studied. Both layers in the model are complete networks. Each player is present in both layers. Agent’s strategies with respect to the layers are interconnected. General asymmetric, symmetric and antisymmetric expectation/quantal response equilibria are analysed. Phase diagram of the model containing various ...
Added: September 26, 2025
Fuad Aleskerov, Tkachev D., , in: Dynamics of Disasters: From Natural Phenomena to Human ActivityVol. 217.: Springer, 2024. Ch. 1 P. 1–13.
The situation of deep uncertainty is defined by the absence of any statistical evaluations of the situation development. For instance, such situations may include events that occur for the first time. We use scenario analysis to model the potential outcomes of events affecting networks under deep uncertainty. Centrality indices are used to identify vulnerable vertices ...
Added: March 5, 2025
I. Samoylenko, Aleja D., Primo E. et al., Physical Review X 2023 Vol. 13 No. 2 Article 021032
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical ...
Added: July 28, 2023
Kovalenko K., Romance M., Vasilyeva E. et al., Chaos, Solitons and Fractals 2022 Vol. 162 Article 112397
Identifying the most influential nodes in networked systems is of vital importance to optimize their function and control. Several scalar metrics have been proposed to that effect, but the recent shift in focus towards network structures which go beyond a simple collection of dyadic interactions has rendered them void of performance guarantees. We here introduce ...
Added: January 31, 2023
Lepskiy A., Meshcheryakova N., , in: Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2020* 2. Vol. 1238.: Cham: Springer, 2020. P. 283–296.
We apply Dempster-Shafer theory in order to reveal important elements in undirected weighted networks. We estimate cooperation of each node with different groups of vertices that surround it via construction of belief functions. The obtained intensities of cooperation are further redistributed over all elements of a particular group of nodes that results in pignistic probabilities ...
Added: July 8, 2020
Aleskerov F. T., Yakuba V. I., / NRU Higher School of Economics. Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2020. No. 2323.
We introduce a class of new centrality indices in networks which take into account a para meter of a node, direct and indirect (with fixed length of the path) connections of nodes, and a group influence of nodes to a node. Total influence is evaluated as a linear combination of its components, however, other rules ...
Added: May 30, 2020