?
A disproof of the Le Bars conjecture about the zero-one law for existential monadic second-order sentences
Doklady Mathematics. 2018. Vol. 98. No. 3. P. 638-640.
Popova S., Zhukovskii M.
The Le Bars conjecture (2001) states that the binomial random graph G(n, 1/2) obeys the zero–one law for existential monadic sentences with two first-order variables. This conjecture is disproved. Moreover, it is proved that there exists an existential monadic sentence with a single monadic variable and two first-order variables whose truth probability does not converge.
Popova S., Sbornik Mathematics 2016 Vol. 207 No. 3 P. 458-478
The zero-one law for the model of random distance graphs with vertices in Z^n is studied. Sufficient conditions for a sequence of random distance graphs to obey the zero-one law are derived, as well as conditions under which it contains a subsequence obeying the zero-one law. ...
Added: October 4, 2019
Popova S., Zhukovskii M., Annals of Pure and Applied Logic 2019 Vol. 170 No. 4 P. 505-514
In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ϕ such that P(G_n |= ϕ) does not converge ...
Added: October 6, 2019
Popova S., Doklady Mathematics 2014 Vol. 90 No. 2 P. 535-538
...
Added: October 5, 2019
Popova S., Siberian Advances in Mathematics 2017 Vol. 27 No. 1 P. 26-75
We study the limit probabilities of first-order properties for random graphs with vertices in a Boolean cube. We find sufficient conditions for a sequence of random graphs to obey the zero-one law for first-order formulas of bounded quantifier depth. We also find conditions implying a weakened version of the zero-one law. ...
Added: October 5, 2019
Popova S., Problems of Information Transmission 2014 Vol. 50 No. 1 P. 57-78
We study zero-one laws for random distance graph with vertices in {−1, 0, 1} ^n depending on a set of parameters. We give some conditions under which sequences of random distance graphs obey or do not obey the zero-one law. ...
Added: October 4, 2019
Gorsky A., Valba O. V., Journal of Complex Networks 2020 Vol. 8 No. 1 P. cnaa008
In this article, we show numerically the strong finite-size effects in exponential random graphs. Particularly, for the two-star model above the critical value of the chemical potential for triplets a ground state is a star-like graph with the finite set of hubs at network density p<0.5p<0.5 or as the single cluster at p>0.5p>0.5. We find that there exists ...
Added: August 28, 2020
Tikhonov K., Mirlin A. D., Skvortsov M. A., Physical Review B: Condensed Matter and Materials Physics 2016 Vol. 94 P. 220203-1-220203-6
A numerical study of Anderson transition on random regular graphs (RRGs) with diagonal disorder is performed.
The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity.
In a certain sense, the RRG ensemble can be seen as an infinite-dimensional (d→∞) cousin of the Anderson ...
Added: March 9, 2017
van der Hoorn P., Ostroumova Prokhorenkova Liudmila, Samosvat E., Stochastic Systems 2018 Vol. 8 No. 1 P. 1-28
We present an algorithm that solves the problem of generating graphs, with a given degree distribution, that are maximally disassortative (with respect to Spearman’s rank correlation). As a result, we obtain a general lower bound for Spearman’s rho on graphs, which depends on the distribution of the probability mass between the head and tail of ...
Added: May 3, 2020
Popova S., Discrete Applied Mathematics 2021 Vol. 293 P. 134-142
The notion of spectrum for first-order properties introduced by J. Spencer for Erdős–Rényi random graph is considered in relation to random uniform hypergraphs. In this work we study the set of limit points of the spectrum for first-order formulae with bounded quantifier depth and give bounds for its minimum value. ...
Added: March 12, 2021
Tamm M., Nechaev S. K., Valba O. V., Journal of Statistical Mechanics: Theory and Experiment 2017 Vol. 2017 No. 053301 P. 1-17
We study the asymptotic behavior of the number of paths of length N on several classes of infinite graphs with a single special vertex. This vertex can work as an ‘entropic trap’ for the path, i.e. under certain conditions the dominant part of long paths becomes localized in the vicinity of the special point instead ...
Added: October 19, 2017
Popova S., Problems of Information Transmission 2018 Vol. 54 No. 3 P. 281-289
We study the asymptotic behavior of probabilities of first-order properties for random uniform hypergraphs. In 1990, J. Spencer introduced the notion of a spectrum for graph properties and proved the existence of a first-order property with an infinite spectrum. In this paper we give a definition of a spectrum for properties of uniform hypergraphs and ...
Added: October 4, 2019
Losev A. S., Slizovskiy S., JETP Letters 2010 Vol. 91 P. 620-624
Added: February 27, 2013
Ilyashenko Y., Яковенко С. Ю., М. : МЦНМО, 2013
Предлагаемая книга—первый том двухтомной монографии, посвящённой аналитической теории дифференциальных уравнений.
В первой части этого тома излагается формальная и аналитическая теория нормальных форм и теорема о разрешении особенностей для векторных полей на плоскости.
Вторая часть посвящена алгебраически разрешимым локальным задачам теории аналитических дифференциальных уравнений , квадратичным векторным полям и проблеме локальной классификации ростков векторных полей в комплексной области ...
Added: February 5, 2014
191574970, Functional Analysis and Its Applications 2006 Vol. 40 No. 2 P. 81-90
It is well known that every module M over the algebra ℒ(X) of operators on a finite-dimensional space X can be represented as the tensor product of X by some vector space E, M ≅ = E ⊗ X. We generalize this assertion to the case of topological modules by proving that if X is a stereotype space with the stereotype approximation property, then for each stereotype module M over the ...
Added: September 23, 2016
Kalyagin V.A., Koldanov A.P., Koldanov P.A. et al., Physica A: Statistical Mechanics and its Applications 2014 Vol. 413 No. 1 P. 59-70
A general approach to measure statistical uncertainty of different filtration techniques for market network analysis is proposed. Two measures of statistical uncertainty are introduced and discussed. One is based on conditional risk for multiple decision statistical procedures and another one is based on average fraction of errors. It is shown that for some important cases ...
Added: July 19, 2014
Maslov V., Теоретическая и математическая физика 2019 Т. 201 № 1 С. 65-83
We study the process of a nucleon separating from an atomic nucleus from the mathematical standpoint
using experimental values of the binding energy for the nucleus of the given substance. A nucleon becomes
a boson at the instant of separating from a fermionic nucleus. We study the further transformations of
boson and fermion states of separation in a ...
Added: November 1, 2019
Pahomov F., Известия РАН. Серия математическая 2016 Т. 80 № 6 С. 173-216
Полимодальная логика доказуемости
GLP была введена Г. К. Джапаридзе в 1986 г. Она является логикой доказуемости для ряда цепочек предикатов доказуемости возрастающей силы. Всякой полимодальной логике соответствует многообразие полимодальных алгебр. Л. Д. Беклемишевым и А. Виссером был поставлен вопрос о разрешимости элементарной теории свободной GLP-алгебры, порожденной константами 0, 1 [1]. В этой статье для любого натурального n решается аналогичный вопрос для логик GLPn, являющихся ...
Added: December 4, 2017
Sinelshchikov D., Кудряшов Н. А., Theoretical and Mathematical Physics 2018 Vol. 196 No. 2 P. 1230-1240
We study a family of nonautonomous generalized Liénard-type equations. We consider the equivalence problem via the generalized Sundman transformations between this family of equations and type-I Painlevé–Gambier equations. As a result, we find four criteria of equivalence, which give four integrable families of Liénard-type equations. We demonstrate that these criteria can be used to construct ...
Added: February 9, 2019
Kolokolov I., Lebedev V., Sizov G. A., Journal of Experimental and Theoretical Physics 2011 Vol. 140 No. 2 P. 387-400
We analyze magnetic kinematic dynamo in a conducting fluid where the stationary shear flow is accompanied by relatively weak random velocity fluctuations. The diffusionless and diffusion regimes are described. The growth rates of the magnetic field moments are related to the statistical characteristics of the flow describing divergence of the Lagrangian trajectories. The magnetic field ...
Added: February 2, 2017
ООО Фирма "Элист", 2014
В книге представлены тезисы докладов I тура XV Всероссийской научно-технической конференции и школы молодых ученых, аспирантов и студентов. ...
Added: October 17, 2014
Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Kotelnikova M. V., Aistov A., Вестник Нижегородского университета им. Н.И. Лобачевского. Серия: Социальные науки 2019 Т. 55 № 3 С. 183-189
The article describes a method that allows to improve the content of disciplines of the mathematical cycle by dividing them into invariant (general) and variable parts. The invariants were identified for such disciplines as «Linear algebra», «Mathematical analysis», «Probability theory and mathematical statistics» delivered to Bachelors program students of economics at several universities. Based on ...
Added: January 28, 2020
Min Namkung, Younghun K., Scientific Reports 2018 Vol. 8 No. 1 P. 16915-1-16915-18
Sequential state discrimination is a strategy for quantum state discrimination of a sender’s quantum
states when N receivers are separately located. In this report, we propose optical designs that can
perform sequential state discrimination of two coherent states. For this purpose, we consider not
only binary phase-shifting-key (BPSK) signals but also general coherent states, with arbitrary prior
probabilities. Since ...
Added: November 16, 2020
Levashov M., Кухаренко А. В., Вопросы защиты информации 2018 № 2 С. 66-71
Рассматривается статистическая модель одного этапа системы фрод-мониторинга транзакций в интернет-банкинге. Построен и рассчитан близкий к отношению правдоподобия критерий отсева мошеннических транзакций. Для выборочных распределений, полученных на выборке объема в 1 млн реальных транзакций, вычислены параметры эффективности этого критерия. ...
Added: June 14, 2018