?
Algorithms and Models for the Web Graph. WAW 2020
Springer, 2020.
Under the general editorship: B. Kamiński, P. Prałat, P. Szufel
This book constitutes the proceedings of the 17th International Workshop on Algorithms and Models for the Web Graph, WAW 2020, held in Warsaw, Poland, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 19 submissions. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs.
Springer, 2019
This book constitutes the proceedings of the 16th International Workshop on Algorithms and Models for the Web Graph, WAW 2019, held in Brisbane, QLD, Australia, in July 2019.
The 9 full papers presented in this volume were carefully reviewed and selected from 13 submissions. The papers cover topics of all aspects of algorithmic and mathematical research ...
Added: April 25, 2020
Tamm M., Avetisov V. A., Shkarin A. et al., / arxiv.org. Series 1307 "arxiv.org". 2013. No. 1307.0113.
We consider non-directed Erdos-Renyi random networks subject to a dynamics conserving the vertex degrees and study numerically and analytically the equilibrium three-vertex motif distributions in the presence of the external field coupled with one of the motifs. For small values of external fields the numerical data is well described by a chemical kinetics based on ...
Added: November 19, 2013
Tikhonov K., Mirlin A. D., Physical Review B: Condensed Matter and Materials Physics 2019 Vol. 99 No. 2 P. 024202-1-024202-25
Dynamical and spatial correlations of eigenfunctions as well as energy level correlations in the Anderson model on random regular graphs (RRG) are studied. We consider the critical point of the Anderson transition and the delocalized phase. In the delocalized phase near the transition point, the observables show a broad critical regime for system sizes N ...
Added: January 7, 2019
Кирьянов Д. П., Orekhov B., Вестник Приамурского государственного университета им. Шолом-Алейхема 2015 № 3 С. 23-40
This study introduces a complex networks-based approach to quantifying agglutination. This approach is one of the most powerful ways of model description but it has been rarely used for linguistic needs and there are very few papers where it is applied to morphology.
The Bashkir language belongs to the Turkic languages which are considered to be ...
Added: March 16, 2016
Springer, 2017
This valuable source for graduate students and researchers provides a comprehensive introduction to current theories and applications in optimization methods and network models. Contributions to this book are focused on new efficient algorithms and rigorous mathematical theories, which can be used to optimize and analyze mathematical graph structures with massive size and high density induced ...
Added: June 26, 2017
Соколов Б. В., Ivanov D., Dolgui A., Algorithms 2018 Vol. 11 No. 5 P. 57
Added: February 11, 2020
Babenko M. A., Goldberg A. V., Gupta A. ,. et al., ACM Transactions on Algorithms 2016 Vol. 13 No. 1 P. 16:1-16:17
We consider the hub label optimization problem, which arises in designing fast preprocessing-based shortest- path algorithms. We give O(log n)-approximation algorithms for the objectives of minimizing the maximum label size (l∞-norm) and simultaneously minimizing a constant number of lp-norms. Prior to this, an O(log n)- approximation algorithm was known [Cohen et al. 2003] only for ...
Added: January 12, 2017
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., 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
Delong A., Osokin A., Isack H. et al., , in : Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2010). : San Francisco : IEEE, 2010. P. 2173-2180.
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involve unary, pairwise, and specialized higher-order terms. Our main contribution is to extend α-expansion so that it can simultaneously optimize “label costs” as well. An energy with label ...
Added: October 18, 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
Германова Д. А., Замятина Е.Б., Зорин В.Н., 2015 № 4(31) С. 71-77
This paper discusses the problems of design and implementation of the program tools devoted for the modeling of social networks, considers the overview of existing software tools and shows how simulation system TriadNS may be use for the modeling of social networks. ...
Added: February 25, 2016
Kucherov G., Nekrich Y., Starikovskaya T., , in : Lecture Notes in Computer Science. Vol. 7608: Proceedings of the 19th International Symposium on String Processing and Information Retrieval.: Berlin : Springer, 2012. P. 307-317.
We study the following three problems of computing generic or discriminating words for a given collection of documents. Given a pattern $P$ and a threshold $d$, we want to report (i) all longest extensions of $P$ which occur in at least $d$ documents, (ii) all shortest extensions of $P$ which occur in less than $d$ ...
Added: October 30, 2013
M. Polyakova, Semenov A. V., Kovalyuk V. et al., IEEE Transactions on Applied Superconductivity 2019 Vol. 29 No. 5 P. 1-5
We present a simple quantum detector tomography
protocol, which allows, without ambiguities, to measure the twospot
detection efficiency and extract the hot-spot interaction length
of SNSPDs with unity intrinsic detection efficiency. We identify a
significant parasitic contribution to the measured two-spot efficiency,
related to an effect of the bias circuit, and find a way to rule
out this contribution during data ...
Added: October 23, 2019
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
Iskhakov L., Kamiński B., Mironov M. et al., Journal of Complex Networks 2020 Vol. 8 No. 1 P. 1-32
In this article, we study the clustering properties of the spatial preferential attachment (SPA) model. This model naturally combines geometry and preferential attachment using the notion of spheres of influence. It was previously shown in several research papers that graphs generated by the SPA model are similar to real-world networks in many aspects. Also, this ...
Added: April 24, 2020
Evmenova E., Gromov D., , in : Networks in the Global World V: Proceedings of NetGloW 2020. Lecture Notes in Networks and Systems. Vol. 181.: Springer, 2021. P. 120-132.
Signed networks form a particular class of complex networks that has many applications in sociology, recommender and voting systems. The contribution of this paper is twofold. First, we propose an approach aimed at determining the characteristic subgraphs of the network. Second, we apply the developed approach to the analysis of the network describing the Wikipedia ...
Added: March 1, 2021
Popkov Y., Dubnov Y. A., Popkov A. Y., Automation and Remote Control 2018 Vol. 79 No. 11 P. 2038-2051
The direct and inverse projections (DIP) method was proposed to reduce the feature space to the given dimensions oriented to the problems of randomized machine learning and based on the procedure of “direct” and “inverse” design. The “projector” matrices are determined by maximizing the relative entropy. It is suggested to estimate the information losses by ...
Added: February 12, 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
Babenko M. A., Kociumaka T., Gawrychowski P. et al., , in : Lecture Notes in Computer Science. Vol. 8486: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching.: Springer, 2014. P. 30-39.
We revisit the problems of computing the maximal and the minimal non-empty suffixes of a substring of a longer text of length n, introduced by Babenko, Kolesnichenko and Starikovskaya [CPM’13]. For the minimal suffix problem we show that for any 1 ≤ τ ≤ logn there exists a linear-space data structure with(τ)query time and(nlogn/τ)preprocessing time. As a sample application, we show that ...
Added: June 24, 2014
Springer, 2019
16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019, Proceedings ...
Added: October 26, 2021
Miasnikof P., Shestopaloff A. Y., Bonner A. J. et al., Journal of Complex Networks 2020 Vol. 8 No. 3 P. 1-33
We introduce graph clustering quality measures based on comparisons of global, intra- and inter-cluster densities, an accompanying statistical significance test and a step-by-step routine for clustering quality assessment. Our work is centred on the idea that well-clustered graphs will display a mean intra-cluster density that is higher than global density and mean inter-cluster density. We ...
Added: August 4, 2020
Карташева А. А., Философские проблемы информационных технологий и киберпространства 2024
The problem of confirming the authenticity of works of art is especially acute in the digital environment. The issue of authentication is central to both intellectual property law and cultural communication strategies. Originality is a necessary parameter for a work to be recognized as original. Although the concept of «originality» is not enshrined in legal acts, it is an important element for the construction of «authenticity», which is often produced by «cultural intermediaries». The latter can be not only ...
Added: November 30, 2023
Switzerland : Springer, 2017
This book constitutes the refereed proceedings of the Third Russian Supercomputing Days, RuSCDays 2017, held in Moscow, Russia, in September 2017. The 41 revised full papers and one revised short paper presented were carefully reviewed and selected from 120 submissions. The papers are organized in topical sections on parallel algorithms; supercomputer simulation; high performance architectures, ...
Added: November 15, 2017