On the role of autocorrelations in texts

The task of finding a criterion allowing to distinguish a text from an arbitrary set of words is rather relevant in itself, for instance, in the aspect of development of means for internet-content indexing or separating signals and noise in communication channels. The Zipf law is currently considered to be the most reliable criterion of this kind [3]. At any rate, conventional stochastic word sets do not meet this law. The present paper deals with one of possible criteria based on the determination of the degree of data compression.Comment: 5 pages, 4 figures, 5 reference

Diagram of measurement series elements deviation from local linear approximations

Method for detection and visualization of trends, periodicities, local peculiarities in measurement series (dL-method) based on DFA technology (Detrended fluctuation analysis) is proposed. The essence of the method lies in reflecting the values of absolute deviation of measurement accumulation series points from the respective values of linear approximation. It is shown that dL-method in some cases allows better determination of local peculiarities than wavelet-analysis. Easy-to-realize approach that is proposed can be used in the analysis of time series in such fields as economics and sociology.Comment: 4 pages, 6 figure

Power law in website ratings

In the practical work of websites popularization, analysis of their efficiency and downloading it is of key importance to take into account web-ratings data. The main indicators of website traffic include the number of unique hosts from which the analyzed website was addressed and the number of granted web pages (hits) per unit time (for example, day, month or year). Of certain interest is the ratio between the number of hits (S) and hosts (H). In practice there is even used such a concept as "average number of viewed pages" (S/H), which on default supposes a linear dependence of S on H. What actually happens is that linear dependence is observed only as a partial case of power dependence, and not always. Another new power law has been discovered on the Internet, in particular, on the WWW.Comment: 4 pages, 5 figure

Self-similarity properties in a queuing network model

In this paper a model of subscriber telephone network based on the concept of cellular automata is elaborated. Some fractal properties inherent in the model are revealed that vary depending on parameters assigning its operation rules. The main advantage of the model in question is its compatibility with algorithmic methods - a finite set of formal rules, assigned on a finite set of elements (cells), allows precise realization in the form of algorithms.Comment: 5 pages, 5 figure

Compactified Horizontal Visibility Graph for the Language Network

A compactified horizontal visibility graph for the language network is proposed. It was found that the networks constructed in such way are scale free, and have a property that among the nodes with largest degrees there are words that determine not only a text structure communication, but also its informational structure.Comment: 9 pages, 3 figures, 2 appendix table

"Conjectural" links in complex networks

This paper introduces the concept of Conjectural Link for Complex Networks, in particular, social networks. Conjectural Link we understand as an implicit link, not available in the network, but supposed to be present, based on the characteristics of its topology. It is possible, for example, when in the formal description of the network some connections are skipped due to errors, deliberately hidden or withdrawn (e.g. in the case of partial destruction of the network). Introduced a parameter that allows ranking the Conjectural Link. The more this parameter - the more likely that this connection should be present in the network. This paper presents a method of recovery of partially destroyed Complex Networks using Conjectural Links finding. Presented two methods of finding the node pairs that are not linked directly to one another, but have a great possibility of Conjectural Link communication among themselves: a method based on the determination of the resistance between two nodes, and method based on the computation of the lengths of routes between two nodes. Several examples of real networks are reviewed and performed a comparison to know network links prediction methods, not intended to find the missing links in already formed networks.Comment: 12 pages, 3 figure

Detection Implicit Links and G-betweenness

A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a generalization of such characteristics as the betweenness, which allows to rank network nodes in more details. The effectiveness of the proposed concepts is shown by the numerical examples.Comment: 11 pages, 3 figure

Dynamic Network of Concepts from Web-Publications

The network, the nodes of which are concepts (people's names, companies' names, etc.), extracted from web-publications, is considered. A working algorithm of extracting such concepts is presented. Edges of the network under consideration refer to the reference frequency which depends on the fact how many times the concepts, which correspond to the nodes, are mentioned in the same documents. Web-documents being published within a period of time together form an information flow, which defines the dynamics of the network studied. The phenomenon of its structure stability, when the number of web-publications, constituting its formation bases, increases, is discussedComment: 7 pages, 8 figure

K-method of cognitive mapping analysis

Introduced a new calculation method (K-method) for cognitive maps. K - method consists of two consecutive steps. In the first stage, allocated subgraph composed of all paths from one selected node (concept) to another node (concept) from the cognitive map (directed weighted graph) . In the second stage, after the transition to an undirected graph (symmetrization adjacency matrix) the influence of one node to another calculated with Kirchhoff method. In the proposed method, there is no problem inherent in the impulse method. In addition to "pair" influence of one node to another, the average characteristics are introduced, allowing to calculate the impact of the selected node to all other nodes and the influence of all on the one selected. For impulse method similar to the average characteristics in the case where the pulse method "works" are introduced and compared with the K-method.Comment: 13 pages, 4 figures, 1 appendi

Peculiarities of the Correlation between Local and Global News Popularity of Electronic Mass Media

One of the approaches to the solution of the navigation problem in current information flows is ranking the documents according to their popularity level. The definition of local and global news popularity which is based on the number of similar-in-content documents, published within local and global time interval, was suggested. Mutual behavior of the documents of local and global popularity levels was studied. The algorithm of detecting the documents which received great popularity before new topics appeared was suggested.Comment: 5 pages, 5 figure