### ?

## 2023 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)

IEEE, 2023.

Under the general editorship: B. Aditya Prakash, D. Wang, T. Weninger

Meshcheryakova N., Shvydun S., , in : 2023 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). : IEEE, 2023. P. 407-414.

In recent decades, a large number of centrality measures have been proposed to assess the importance of nodes in complex networks. The choice of the most appropriate centrality index for specific applications is one of the biggest challenges. This paper performs the perturbation analysis of 8 centrality measures. Since most real networks are incomplete and ...

Added: November 4, 2023

Мальков Ю. А., Ponomarenko A., Plos One 2016 Vol. 11 No. 6 P. 1-14

Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of ...

Added: September 9, 2016

Switzerland : Springer, 2016

The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher ...

Added: October 24, 2016

Aleskerov F. T., Dutta S., Egorov D. et al., Procedia Computer Science 2022 Vol. 214 P. 1285-1292

We construct a model to find the insecure countries in terms of food security using network analysis under the conditions of deep uncertainty. The conditions under deep uncertainty can be drought, flood, earthquakes, etc., which affect the supply and demand of food of the countries. Under such conditions which countries are more vulnerable has been ...

Added: December 10, 2022

Cham : Springer, 2020

This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students, and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the Eighth International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2019), which took place in Lisbon, ...

Added: February 27, 2024

Aachen : CEUR Workshop Proceedings, 2015

This volume contains proceedings of the fourth conference on Analysis of Images, Social Networks and Texts (AIST’2015)1 . The first three conferences in 2012–2014 attracted a significant number of students, researchers, academics and engineers working on interdisciplinary data analysis of images, texts, and social networks. The broad scope of AIST makes it an event where ...

Added: October 9, 2015

Aleskerov F. T., Meshcheryakova N., Shvydun S., / Издательский дом ВШЭ. Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2016. No. WP7/2016/04.

We propose a new method for assessing agents’ influence in network structures, which takes into consideration nodes attributes, individual and group influences of nodes, and the intensity of interactions. This approach helps us to identify both explicit and hidden central elements which cannot be detected by classical centrality measures or other indices. ...

Added: July 13, 2016

Ponomarenko A., Pitsoulis L., Shamshetdinov M., Plos One 2021 Vol. 16 No. 8 Article e0255717

In this paper, we present a new method for detecting overlapping communities in net- works with a predefined number of clusters called LPAM (Link Partitioning Around Medoids). The overlapping communities in the graph are obtained by detecting the disjoint communities in the associated line graph employing link partitioning and parti- tioning around medoids which are ...

Added: December 9, 2020

NY : Springer, 2013

This volume contains a selection of contributions from the "First International Conference in Network Analysis," held at the University of Florida, Gainesville, on December 14-16, 2011. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The ...

Added: December 19, 2012

Springer, 2021

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.
The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length.
The research part ...

Added: July 10, 2021

Lanham : University Press of America, 2012

The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...

Added: February 13, 2013

Akopov A. S., Beklaryan A., Искусственные общества 2021 Т. 16 № 1 С. 1-23

This article presents a model of the ground autonomous vehicles (AVs) motion in the Artificial Road Network (ARN) belonging to the "Manhattan Lattice" type with the implementation of the large-scale agent-based modeling framework FLAME GPU. The most important scenarios of the traffic situation development are investigated, in particular, which are associated with reducing visibility on ...

Added: April 1, 2021

Пермь : Пермский государственный национальный исследовательский университет, 2020

В сборнике представлены статьи участников Всероссийской научно-практической конференции молодых ученых с международным участием «Математика и междисциплинарные исследования – 2020». На конференцию было прислано более ста статей из различных регионов России, а также из ближнего
и дальнего зарубежья. По итогам работы экспертной комиссии для публикации было отобрано шестьдесят две статьи. Каждая статья оценивалась группой экспертов в той области, которая рассматривается автором.
Представленные ...

Added: December 10, 2020

Yasnitsky L., Ваулева С. В., Сафонова Д. Н. et al., Всероссийский криминологический журнал 2015 Т. 9 № 3 С. 423-430

Modern criminalists do not share a common opinion regarding the choice of parameters which could be used to work out a system of characteristics to differentiate a maniac killer from an ordinary person. This hinders the development of efficient software for investigation purposes. The paper describes the experience of developing a neural network that can ...

Added: October 1, 2015

Koldanov A. P., Koldanov P., Semenov D., Журнал Новой экономической ассоциации 2021 Т. 2 № 50 С. 12-34

. The problem of analysis of pairwise connections between stocks of financial market by observations on stock returns is considered. Such problem arise in stock market network analysis. It is assumed that joint distribution of stock returns belongs to the wide class of elliptical distributions. Classical Pearson correlation, Fechner correlation and Kendall correlation are used ...

Added: June 17, 2021

Sirotkin D., Malyshev D., Дискретная математика 2017 Т. 29 № 3 С. 114-125

Задача о независимом множестве для заданного обыкновенного графа состоит в вычислении размера наибольшего множества его попарно несмежных вершин. Предлагается новый способ редукции графов. С его помощью получено новое доказательство NP-полноты задачи о независимом множестве в классе планарных графов и доказана NP-полнота данной задачи в классе плоских графов, имеющих только треугольные внутренние грани, с максимальной степенью ...

Added: September 7, 2017

Akopov A. S., Beklaryan L. A., Saghatelyan A. K., Environmental Modelling and Software 2019 Vol. 116 P. 7-25

Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...

Added: February 24, 2019

Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45

Added: October 17, 2014

Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...

Added: April 7, 2014

Gafarov E., Lazarev A. A., Information Processing Letters 2012 Т. 112 № 3 С. 72-76

In this note, we consider a single machine scheduling problem with generalized total tardiness objective function.
A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new
graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number
of tardy jobs on a single ...

Added: November 24, 2012

Chernyshev S. V., Cherepanov E. A., Pankratiev E. V. et al., Journal of Mathematical Sciences 2005 Vol. 128 No. 6 P. 3487-3495

Added: January 27, 2014

Marshirov V. V., Marshirova L. E., Сибирский журнал индустриальной математики 2013 Т. XVI № 4 С. 111-120

The paper considers the problem of determining the rate of cooling of metal during solidification at the intersection of the liquidus temperature under intense heat sink from the surface. The solution to this problem it is necessary to determine the process conditions, the boundary and initial conditions for which it is possible to get new ...

Added: November 17, 2013

P. : Université Paris 13 - Paris Sorbonne Cité, 2013

In this workshop we will bring together participants who have solutions for one or more of the following problems: How can mutual understanding be optimized with the help of technology in hospitals where both patients and professionals have varying language skills, cultural backgrounds and cognitive capacities? Can domain ontologies, natural language processing tools, multilingual knowledge-based ...

Added: December 18, 2014

Malyshev D., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2020 Vol. 14 No. 4 P. 706-721

The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...

Added: January 30, 2021

Bliznets Ivan, Cygan M., Komosa P. et al., ACM Transactions on Computation Theory 2018 Vol. 10 No. 2 P. 1-32

The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly, but we add edges instead of deleting them. The study of these two problem families has recently been the subject of intensive studies from the point of ...

Added: October 30, 2018