I am a PhD Candidate in the Department of Computer Science
of the University of California, Santa Barbara, working as a Graduate
Student Researcher at the Databases,
Data Mining, and Bioinformatics Lab (DBL), and being advised by
Ambuj K. Singh. My research
interests are machine learning and data mining, combinatorial algorithms,
linear algebra, dynamical systems, and their application to the analysis and modeling of dynamic processes in networks, such as online social networks. Prior to joining DBL, I had
worked in highperformance computing
(CSC,
LBNL),
and spent several years as a
software engineer in industry. I have obtained my Master's degree in
Applied Mathematics and Computer Science with an emphasis on Numerical
Analysis from
Tula State University,
Russia in 2008, having been advised
by Valeriy Ivanov.
Publications

Amelkin V., Bullo F., Singh A.K.
"Polar Opinion Dynamics in Social Networks",
Submitted to IEEE Transactions on Automatic Control (May, 2016)

Amelkin V., Askarisichani O., Kim Y.J., Singh A.K., Malone T.W.
"Dynamics of Collective Performance
in Collaboration Networks",
INSNA Sunbelt (2016),
[slides]

Amelkin V., Singh A., Bogdanov P.
"A Distance Measure for
the Analysis of Polar Opinion Dynamics in
Social Networks",
Submitted (2016)

Amelkin V., Singh A., Bogdanov P.
"A Distance Measure for
the Analysis of Polar Opinion Dynamics
in Social Networks" (Extended
Paper),
arXiv:1510.05058 [cs.SI]
(2015)

Amelkin V., Ng E.G.
"Parallel Communication Analysis for Sparse Cholesky
Factorization Algorithms",
LBNL (2012), [report]

Amelkin V., Ivanov A., "Fejér problem for polynomials on
a twodimensional sphere",
Modern Problems of Mathematics,
Mechanics, Computer Science; Tula State University (2008)
Software

matlabtransport
— a fast transportation problem solver for MATLAB, based on
Andrew Goldberg's CS2
implementation of GoldbergTarjan's mincost network flow algorithm.
It works much faster than MATLAB's linprog or CPLEX' generalpurpose
LPsolver.

matlabsssp
— multiple MATLAB implementations of Dijkstra's singlesource shortest
path algorithm for sparse networks: the binary heapbased implementation, due
to David Bindel;
the radix heapbased implementation; and the implementation
based on an improved version of Dial's algorithm.

cnp1.6nix
— a GNU/Linux and Mac OS X port of Complex Network Package 1.6 — a graph library for MATLAB.

alchemyapi
— a MATLAB API to AlchemyAPI's text sentiment quantification
webservice. Academic users can get 30k transactions per day for free.
The sentiment quantification accuracy for Sentiment140's training set of tweets was around 70%.
Miscellany

MAE
— materials from my Major Area Exam.