arXiv subjects
Publications and source records attributed to A. M. Raigorodskii.
This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented, highlighting nontrivial relationships between the obtained bounds. Known upper bounds and their potential suboptimality are discussed separately.
Some variant of the Frank-Wolfe method for convex optimization problems with adaptive selection of the step parameter corresponding to information about the smoothness of the objective function (the Lipschitz constant of the gradient). Theoretical estimates of the quality of the solution provided by the method are obtained in terms of adaptively selected parameters L_k. An important feature of the obtained result is the elaboration of a situation in which it is possible to guarantee, after the completion of the iteration, a reduction of the discrepancy in the function by at least 2 times. At the same time, using of adaptively selected parameters in theoretical estimates makes it possible to apply the method for both smooth and nonsmooth problems, provided that the exit criterion from the iteration is met. For smooth problems, this can be proved, and the theoretical estimates of the method are guaranteed to be optimal up to multiplication by a constant factor. Computational experiments were performed, and a comparison with two other algorithms was carried out, during which the efficiency of the algorithm was demonstrated for a number of both smooth and non-smooth problems.
In this paper, we test the performance of some modern stochastic optimization methods and practices in application to digital pre-distortion problem, that is a valuable part of processing signal on base stations providing wireless communication. In first part of our study, we focus on search of the best performing method and its proper modifications. In the second part, we proposed the new, quasi-online, testing framework that allows us to fit our modelling results with the behaviour of real-life DPD prototype, retested some selected of practices considered in previous section and approved the advantages of the method occured to be the best in real-life conditions. For the used model, maximum achieved improvement in depth was 7% in standard regime and 5% in online one (metric itself is of logarithmic scale). We also achieved a halving of the working time preserving 3% and 6% improvement in depth for the standard and online regime, correspondingly. All comparisons are made to the Adam method, which was highlighted as the best stochastic method for DPD problem in paper [Pasechnyuk et al., 2021], and to the Adamax method, that is the best in the proposed online regime.
We give evidence that a population of pure contrarians globally coupled D-dimensional Kuramoto oscillators reaches a collective synchronous state when the interplay between the units goes beyond the limit of pairwise interactions. Namely, we will show that the presence of higher order interactions may induce the appearance of a coherent state even when the oscillators are coupled negatively to the mean field. An exact solution for the description of the microscopic dynamics for forward and backward transitions is provided, which entails imperfect symmetry breaking of the population into a frequency-locked state featuring two clusters of different instantaneous phases. Our results contribute to a better understanding of the powerful potential of group interactions entailing multi-dimensional choices and novel dynamical states in many circumstances, such as in social systems.
Networks determine our social circles and the way we cooperate with others. We know that topological features like hubs and degree assortativity affect cooperation, and we know that cooperation is favoured if the benefit of the altruistic act divided by the cost exceeds the average number of neighbours. However, a simple rule that would predict cooperation transitions on an arbitrary network has not yet been presented. Here we show that the unique sequence of degrees in a network can be used to predict at which game parameters major shifts in the level of cooperation can be expected, including phase transitions from absorbing to mixed strategy phases. We use the evolutionary prisoner's dilemma game on random and scale-free networks to demonstrate the prediction, as well as its limitations and possible pitfalls. We observe good agreements between the predictions and the results obtained with concurrent and Monte Carlo methods for the update of the strategies, thus providing a simple and fast way to estimate the outcome of evolutionary social dilemmas on arbitrary networks without the need of actually playing the game.
From biology to social science, the functioning of a wide range of systems is the result of elementary interactions which involve more than two constituents, so that their description has unavoidably to go beyond simple pairwise-relationships. Simplicial complexes are therefore the mathematical objects providing a faithful representation of such systems. We here present a complete theory of synchronization of $D$-dimensional oscillators obeying an extended Kuramoto model, and interacting by means of 1- and 2- simplices. Not only our theory fully describes and unveils the intimate reasons and mechanisms for what was observed so far with pairwise interactions, but it also offers predictions for a series of rich and novel behaviors in simplicial structures, which include: a) a discontinuous de-synchronization transition at positive values of the coupling strength for all dimensions, b) an extra discontinuous transition at zero coupling for all odd dimensions, and c) the occurrence of partially synchronized states at $D=2$ (and all odd $D$) even for negative values of the coupling strength, a feature which is inherently prohibited with pairwise-interactions. Furthermore, our theory untangles several aspects of the emergent behavior: the system can never fully synchronize from disorder, and is characterized by an extreme multi-stability, in that the asymptotic stationary synchronized states depend always on the initial conditions. All our theoretical predictions are fully corroborated by extensive numerical simulations. Our results elucidate the dramatic and novel effects that higher-order interactions may induce in the collective dynamics of ensembles of coupled $D$-dimensional oscillators, and can therefore be of value and interest for the understanding of many phenomena observed in nature, like for instance the swarming and/or flocking processes unfolding in three or more dimensions.
The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their observed macroscopic patterns. These advances, however, are restricted to pairwise interactions, captured by dyadic links, and provide limited insight into higher-order structure, in which a group of several components represents the basic interaction unit. Such multi-component interactions can only be grasped through simplicial complexes, which have recently found applications in social and biological contexts, as well as in engineering and brain science. What, then, are the generative models recovering the patterns observed in real-world simplicial complexes? Here we introduce, study, and characterize a model to grow simplicial complexes of order two, i.e. nodes, links and triangles, that yields a highly flexible range of empirically relevant simplicial network ensembles. Specifically, through a combination of preferential and/or non preferential attachment mechanisms, the model constructs networks with a scale-free degree distribution and an either bounded or scale-free generalized degree distribution - the latter accounting for the number of triads surrounding each link. Allowing to analytically control the scaling exponents we arrive at a highly general scheme by which to construct ensembles of synthetic complexes displaying desired statistical properties.
In 1973 P. Erdős and L. Lovász noticed that any hypergraph whose edges are pairwise intersecting has chromatic number 2 or 3. In the first case, such hypergraph may have any number of edges. However, Erdős and Lovász proved that in the second case, the number of edges is bounded from above. For example, if a hypergraph is $ n $-uniform, has pairwise intersecting edges, and has chromatic number 3, then the number of its edges does not exceed $ n^n $. Recently D.D. Cherkashin improved this bound (see \cite{Ch}). In this paper, we further improve it in the case when the number of vertices of an $n$-uniform hypergraph is bounded from above by $ n^m $ with some $ m = m(n) $.