1. Cover time of a random graph with a given degree sequence;['Abdullah, Mohammed', 'Cooper, Colin', 'Frieze, Alan'];Discrete Math.,2012
2. Absolutely continuous spectrum implies ballistic transport for quantum particles in a random potential on tree graphs;['Aizenman, Michael', 'Warzel, Simone'];J. Math. Phys.,2012
3. Processes on unimodular random networks;['Aldous, David J.', 'Lyons, Russell'];Electron. J. Probab.,2007
4. Non-backtracking random walks mix faster;['Alon, Noga', 'Benjamini, Itai', 'Lubetzky, Eyal', 'Sodin, Sasha'];Commun. Contemp. Math.,2007
5. Reversibility of a simple random walk on periodic trees;['Altok, Serdar'];Proc. Am. Math. Soc.,2010