I am a fellow of the Sobolev Institute of Mathematics of Siberian Branch of Russian Academy of Sciences (2016- at present). I am also a docent at Omsk State Technical University (2006-at present). I interested in the theory and application of Network Science. I teach programming (Java, C++), math modeling and theory of simulation. I use the Rstudio, the AnyLogic, the Repast Suite etc.

EDUCATION
2000 – 2005: Omsk State Technical University, Automated Control System department, engineer
2006-2009 Postgraduate education, Omsk State Technical University
2012 Ph. D. Thesis: Structural identification of large stochastic networks and random preferential attachment graphs
(Scientific adviser – Zadorozhnyi V.N.)

RESEARCH INTERESTS
– probabilistic models and methods,
– complex networks,
– agent simulation,
– network process,
– network motifs,
– percolation theory,
– Ising model.

SELECTED PUBLICATIONS                                                                                                            

Zadorozhnyi V.N., Yudin E.B. Growing network: models following nonlinear preferential attachment rule. // Physica A: Statistical Mechanics and its Applications (2015) pp. 111-132.
DOI:10.1016/j.physa.2015.01.052.   https://www.sciencedirect.com/science/article/pii/S0378437115000710?via%3Dihub.

Zadorozhnyi V.N., Yudin E.B. Structural properties of the scale-free Barabasi-Albert graph. / // Automation and Remote Control. – Vol. 73, No. 4, 2012. – P. 702-716. DOI: 10.1134/ S0005117912040091.

Zadorozhnyi V N; Yudin E. B., Yudina M. N. Distributions of degrees in growing graphs with loss of arcs // 2018 Moscow Workshop on Electronic and Networking Technologies (MWENT), P. 1-7.  DOI: 10.1109/MWENT.2018.8337251.  https://ieeexplore.ieee.org/document/8337251.

Yudin E.B. Growing graphs with addition of communities // 2018 Journal of Physics: Conference Series 1050(1), P. 012099. DOI: 10.1088/1742-6596/1050/1/012099 http://iopscience.iop.org/article/10.1088/1742-6596/1050/1/012099/.

Yudin, E.B., Yudina, M.N. Calculation of number of motifs on three nodes using random sampling of frames in networks with directed links // Proceedings – 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017, 8071957, P.23-26. DOI: 10.1109/SSDSE.2017.8071957 https://ieeexplore.ieee.org/document/8071957.

Yudin E.B., Zadorozhnyi V.N. Statistical approach to calculation of number of network motifs// 2015 International Siberian Conference on Control and Communications, SIBCON 2015 – Proceedings P.7147296. DOI: 10.1109/SIBCON.2015.7147296 https://ieeexplore.ieee.org/document/7147296.

Zadorozhnyi, V.N., Yudin, E.B., Yudina, M.N. Analytical and numerical methods of calibration for preferential attachment random graphs // 2017 International Siberian Conference on Control and Communications, SIBCON 2017 – Proceedings, P. 7998461. DOI: 10.1109/SIBCON.2017.7998461 https://ieeexplore.ieee.org/document/7998461.

Zadorozhnyi V. N., Yudin E. B. The investigation of social networks based on multi-component random graphs // 2018 J. Phys.: Conf. Ser. 944, P.012124. DOI: 10.1088/1742-6596/944/1/012124 http://iopscience.iop.org/article/10.1088/1742-6596/944/1/012124.

Zadorozhnyi V.N., Yudin E.B., Yudina M.N. Graphs with complex stochastic increments // 2017 11th International IEEE Scientific and Technical Conference Dynamics of Systems, Mechanisms and Machines Dynamics. – P.1-8. DOI: 10.1109/Dynamics.2017.8239525 https://ieeexplore.ieee.org/document/8239525.

Zadorozhnyi V.N., Yudin E.B. Nonlinear Extension of the Barabasi-Albert Model // Communication in Computer and Information Science. 2014. V.483. – P.432-439. DOI: 10.1007/978-3-319-13671-4_49 https://link.springer.com/chapter/10.1007/978-3-319-13671-4_49.

SOFTWARE

Mathematical models and numerical methods are implemented in periodically updated versions of the Simbigraph agent-based simulation system.https://github.com/yudinev/Simbigraph2https://sourceforge.net/projects/budnik/.