"Here’s the plan of the work: In Section 1 we will restrict ourselves to the study of random walks on finite networks. Here we will establish the connection between the electrical concepts of current and voltage and corresponding descriptive quantities of random walks regarded as finite state Markov chains. In Section 2 we will consider random walks on infinite networks. Polya’s theorem will be proved using Rayleigh’s method, and the proof will be compared with the classical proof using probabilistic methods. We will then discuss walks on more general infinite graphs, and use Rayleigh’s method to derive certain extensions of Polya’s theorem." -- still to read.

"The stochastic dynamics of an active particle undergoing a constant speed and additionally driven by an overall fluctuating torque is investigated.…"

"Monograph in preparation," pdfs available free online.

"Graphs with geometry." Mentioned in the references of that Jung, Shah, and Shin article I just linked to...

"the researchers modified the pagerank algorithm to better reflect the search activity of scientific researchers [...]. generally, researchers start with a recent article and then slowly work back to older articles. to reflect this activity, the algorithm biased the starting point of searchers toward more recent articles."

"this page contains the lecture notes of a course taught by fan chung graham concerning random walks on graphs."

"following links is just a (human-readable) way of saying sparse matrix multiplication."

To read.