26 citations · 74 across the 8 of their papers we have counts for
13 papers
A Loop Reversibility and Subdiffusion of the Rotor-Router Walk
Vl. V. Papoyan, V. S. Poghosyan, V. B. Priezzhev
The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We…
Transfer matrix for spanning trees, webs and colored forests
J. G. Brankov, V. S. Poghosyan, V. B. Priezzhev +1
We use the transfer matrix formalism for dimers proposed by Lieb, and generalize it to address the corresponding problem for arrow configurations (or trees) associated to dimer con…
Euler tours and unicycles in the rotor-router model
V. S. Poghosyan, V. B. Priezzhev
A recurrent state of the rotor-routing process on a finite sink-free graph can be represented by a unicycle that is a connected spanning subgraph containing a unique directed cycle…
Tighter Upper Bounds for the Minimum Number of Calls and Rigorous Minimal Time in Fault-Tolerant Gossip Schemes
V. H. Hovnanyan, H. E. Nahapetyan, Su. S. Poghosyan +1
The gossip problem (telephone problem) is an information dissemination problem in which each of nodes of a communication network has a unique piece of information that must be…
From elongated spanning trees to vicious random walks
A. Gorsky, S. Nechaev, V. S. Poghosyan +1
Given a spanning forest on a large square lattice, we consider by combinatorial methods a correlation function of paths ( is odd) along branches of trees or, equivalently, $…
Return probability for the loop-erased random walk and mean height in sandpile : a proof
V. S. Poghosyan, V. B. Priezzhev, P. Ruelle
Single site height probabilities in the Abelian sandpile model, and the corresponding mean height , are directly related to the probability that a loop erased ra…