?
Статистические процедуры со многими решениями в задаче анализа итогов приема в филиалы ВУЗа
Бизнес-информатика. 2012. № 1(19). С. 24–31.
Problem of multiple comparisons of several populations on small samples and specificity of the method of it solution are analyzed. It is proposed to extend a classical method for constructing statistical tests by the use of information preprocessing. Examples of the application of the proposed method are given.
Language:
Russian
Shabanov N., Kuricheva O., Kurbatova J. et al., / Series Working Papers SSRN "Department of Economics Ca’ Foscari University of Venice". 2026.
The carbon balance of an ecosystem is the difference between Gross Primary Productivity (GPP) and Ecosystem Respiration (Reco) as expressed by Net Ecosystem Exchange (NEE). While remote sensing retrievals of GPP have reached maturity, Reco estimation remains underexplored and ultimately cast bias on NEE. Here we present an end-to-end multi-scale analysis of the mechanism of ...
Added: August 21, 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
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
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
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
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
Petrovanov I., Sergeev A., / Series Computer Science "arxiv.org". 2025. No. 2512.18332.
Transport coding reduces message delay in packet-switched networks by introducing controlled redundancy at the transport layer: original packets are encoded into coded packets, and the message is reconstructed after the first successful deliveries, effectively shifting latency from the maximum packet delay to the -th order statistic. We present a concise, reproducible discrete-event implementation of transport coding in OMNeT++, including ...
Added: December 24, 2025
Hessian-based lightweight neural network for brain vessel segmentation on a minimal training dataset
Меньшиков И. А., Бернадотт А. К., Elvimov N. S., / Series arXie "Statistical mechanics". 2025.
Accurate segmentation of blood vessels in brain magnetic resonance angiography (MRA) is essential for successful surgical procedures, such as aneurysm repair or bypass surgery. Currently, annotation is primarily performed through manual segmentation or classical methods, such as the Frangi filter, which often lack sufficient accuracy. Neural networks have emerged as powerful tools for medical image ...
Added: December 1, 2025
Kalyagin V. A., Koldanov A. P., Koldanov P. et al., Springer, 2020.
This book studies complex systems with elements represented by random variables. Its main goal is to study and compare uncertainty of algorithms of network structure identification with applications to market network analysis. For this, a mathematical model of random variable network is introduced, uncertainty of identification procedure is defined through a risk function, random variables ...
Added: September 10, 2020
Koldanov P., Advances in Computer Science Research 2019 P. 50–55
The concept of random variables network used to model the complex system of random nature is discussed. The problem of threshold graph identi cation to network analysis of the complex system is considered as multiple decision statistical procedure. The properties of robustness of di erent tests for testing individual hypotheses for threshold graph identi cation are investigated by ...
Added: December 7, 2019
Semenov D., Koldanov P., , in: Computational Aspects and Applications in Large-Scale Networks. Springer Proceedings in Mathematics & StatisticsVol. 247.: Springer, 2018. P. 221–234.
Market network analysis attracts a growing attention last decade. Important component of the market network is a model of stock returns distribution. Elliptically contoured distributions are popular as probability model of stock returns. The question of adequacy of this model to real market data is open. There are known results that reject such model and ...
Added: September 24, 2018
Kalyagin V. A., Koldanov A. P., Koldanov P. et al., Annals of Operations Research 2018 Vol. 266 No. 1-2 P. 313–327
Research into the market graph is attracting increasing attention in stock market analysis. One of the important problems connected with the market graph is its identification from observations. The standard way of identifying the market graph is to use a simple procedure based on statistical estimations of Pearson correlations between pairs of stocks. Recently a ...
Added: May 17, 2017
Koldanov P., Комиссарова А. Э., , in: Models, Algorithms, and Technologies for Network Analysis / From the 4th International Conference on Network Analysis.: NY: Springer, 2016. P. 157–163.
The paper deal with uncertainty in market network analysis. The main problem addressed is to investigate statistical uncertainty of Kruskal algorithm for the minimum spanning tree in market network. Uncertainty of Kruskal algorithm is measured by the probability of q incorrectly included edges. Numerical experiments are conducted with the returns of a set of 100 ...
Added: December 7, 2015
Kalyagin V. A., Koldanov A. P., Pardalos P. M., Annals of Mathematics and Artificial Intelligence 2016 Vol. 76 No. 1 P. 83–92
The main goal of the present paper is the development of a general framework of multivariate network analysis of statistical data sets. A general method of multivariate network construction, on the basis of measures of association, is proposed. In this paper we consider Pearson correlation network, sign similarity network, Fechner correlation network, Kruskal correlation network, ...
Added: September 7, 2015
Koldanov P., Kalyagin V. A., Bautin G. A., Annals of Mathematics and Artificial Intelligence 2016 Vol. 76 No. 1 P. 47–57
The problem of stock selection is disscused from different points of view. Three different sequentially rejective statistical procedures for stock selection are described and compared: Holm multiple test procedure, maximin multiple test procedure and multiple decision procedure. Properties of statistical procedures are studied for different loss functions. It is shown that conditional risk for additive loss ...
Added: February 3, 2015
Koldanov A. P., Koldanov P.A., Springer Optimization and Its Applications 2014 Vol. 87 P. 205–216
Problem of construction of the market graph as a multiple decision statistical problem is considered. Detailed description of a optimal unbiased multiple decision statistical procedure is given. This procedure is constructed using the Lehmann’s theory of multiple decision statistical procedures and the conditional tests of the Neyman structures. The equations for thresholds calculation for the ...
Added: September 13, 2013
Koldanov P., Springer Proceedings in Mathematics & Statistics 2013 Vol. 59 P. 71–84
The problem of comparison of several branches efficiency is formulated as a multiple decision problem. The main difficulty to handle this problem lies in the compatibility condition. Solution of this difficulty, based on a method of combination of testing compatible generating hypotheses is given. The additivity condition of the loss function is investigated. This condition ...
Added: September 13, 2013