Geodesic
Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component
Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika, Tome 9 (2017) no. 4, pp. 5-12 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The work is the continuation of the authors’ work on the simulation of the structure of the society by the method of random graphs generation. In their previous works, the authors experimentally proved that the social graph has a strict orientation of the information direction propagation from the shares of the graph with high bonds density to the graph parts having a lower bond density. The authors proposed a method for determining the orientation of the social graph by investigating the ratio of the number of outgoing links to the incoming ones. This method found its application in the analysis of postal mailing, but it turned out to be practically inapplicable in the analysis of social networks, since the counting of incoming and outgoing communications required the compilation of the announced social graphs which was a time-consuming and computational resources task that does not have a solution for polynomial time at present. Since the issue of the social networks analysis is not only of a strictly scientific, but also of a practical interest, the authors developed and tested a technique for determining the orientation of social graphs by the method of analyzing the numerical characteristics of a graph. The new method does not require a detailed analysis of the correspondence of users of social networks, but operates with open user information that is a list of friends (Friend List). The ultimate goal of this work is to develop simple and effective methods for analyzing social networks to identify “opinion leaders”, ways of disseminating information, including propagandizing deviant and dependent forms of behavior, identifying anti-systems and separate closed network communities, and general monitoring of the state of social systems.
Keywords: social graph, random graphs, numerical characteristics of graphs
Mots-clés : social graph orientation. 
@article{VYURM_2017_9_4_a0,
     author = {E. V. Garin and R. V. Mescheriakov},
     title = {Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component},
     journal = {Vestnik \^U\v{z}no-Uralʹskogo gosudarstvennogo universiteta. Seri\^a, Matematika, mehanika, fizika},
     pages = {5--12},
     year = {2017},
     volume = {9},
     number = {4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/VYURM_2017_9_4_a0/}
}
TY  - JOUR
AU  - E. V. Garin
AU  - R. V. Mescheriakov
TI  - Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component
JO  - Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika
PY  - 2017
SP  - 5
EP  - 12
VL  - 9
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/VYURM_2017_9_4_a0/
LA  - en
ID  - VYURM_2017_9_4_a0
ER  - 
%0 Journal Article
%A E. V. Garin
%A R. V. Mescheriakov
%T Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component
%J Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika
%D 2017
%P 5-12
%V 9
%N 4
%U http://geodesic.mathdoc.fr/item/VYURM_2017_9_4_a0/
%G en
%F VYURM_2017_9_4_a0
E. V. Garin; R. V. Mescheriakov. Method for determination of the social graph orientation by the analysis of the vertices valence in the connectivity component. Vestnik Ûžno-Uralʹskogo gosudarstvennogo universiteta. Seriâ, Matematika, mehanika, fizika, Tome 9 (2017) no. 4, pp. 5-12. http://geodesic.mathdoc.fr/item/VYURM_2017_9_4_a0/

[1] L.-A. Baraba'si, R. Albert, “Emergence of scaling in random networks”, Science, 286:5439 (1999), 509–512 | DOI | MR | Zbl

[2] L.-A. Baraba'si, R. Albert, H. Jeong, “Scale-free characteristics of random net- works: the topology of the world-wide web”, Physica A: Statistical Mechanics and its Applications, 281:1–4 (2000), 69–77 | DOI

[3] B. Bolloba's, O. Riordan, “Mathematical results on scale-free random graphs”, Handbook of Graphs and Networks: From the Genome to the Internet, Wiley-VCH, Weinheim, 2003, 1–34 | DOI | MR

[4] A. Stoimenow, “Enumeration of chord diagrams and an upper bound for Vassiliev invariants”, Journal of Knot Theory and Its Ramifications, 7:1 (1998), 93–114 | DOI | MR | Zbl

[5] B. Bolloba's, O. Riordan, “The diameter of a scale-free random graph”, Combinatorica, 24:1 (2004), 5–34 | DOI | MR | Zbl

[6] B. Bolloba's, O. Riordan, J. Spencer, G. Tusna'dy, “The degree sequence of a scale-free random graph process”, Random Structures Algorithms, 18:3 (2001), 279–290 | DOI | MR | Zbl

[7] R. Kumar, P. Raghavan, S. Rajagopalan et al., “Stochastic models for the web graph”, Proc. 41st Symposium on Foundations of Computer Science, 2000 | DOI | MR

[8] Kukushkin A. A., Bogomolov A. V., Ushakov I. B., “Mathematical providing of estimation of materiel systems state”, Information technologies, 2004, no. 7, appendix, 32 pp.

[9] Bogomolov A. V., Gridin L. A., Kukushkin Yu. A., Ushakov I. B., Diagnosis of the human condition: mathematical approaches, Meditsina Publ., M., 2003, 464 pp.

[10] M.E.J. Newman, D.J. Watts, “Scaling and percolation in the small-world network model”, Phys. Rev. E, 60 (1999), 7332–7342, arXiv: 9904419v2 | DOI

[11] Garin E. V., Meshcheryakov R. V., “Social graph of the society. News of higher educational institutions”, Sociology. Economy. Policy, 2015, no. 4(47), 11–14 (in Russ.)

[12] Garin Y., Meshcheryakov R., “Model of Socium Governance”, Problems of Management Theory and Practice, 2017, no. 1, 105–121 (in Russ.)