Yangyang Xu

Generating author description...

All published works

Action	Title	Year	Authors
+	Some further results on the maximal hitting times of trees with some given parameters	2022	Shuchao Li Yangyang Xu Huihui Zhang
+	Existence of $L^q$-dimension and entropy dimension of self-conformal measures on Riemannian manifolds	2022	Sze-Man Ngai Yangyang Xu
+ PDF Chat	MMDA na resolução da relaxação por Programação Semidefinida do Problema Quadrático de Alocação	2017	Danilo Elias Oliveira Henry Wolkowicz Yangyang Xu
+ PDF Chat	A Block Coordinate Descent Method for Multi-Convex Optimization with Applications to Nonnegative Tensor Factorization and Completion	2012	Yangyang Xu Wotao Yin

Common Coauthors

Coauthor	Papers Together
Danilo Elias Oliveira	1
Shuchao Li	1
Henry Wolkowicz	1
Wotao Yin	1
Huihui Zhang	1
Sze-Man Ngai	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	None	1998	Zhao Qing Stefan E. Karisch Franz Rendl Henry Wolkowicz	1
+	Cutpoint Decoupling and First Passage Times for Random Walks on Graphs	1999	Stephen Kirkland Michael Neumann	1
+	Maximum hitting time for random walks on graphs	1990	Graham Brightwell Peter Winkler	1
+	Resistances and currents in infinite electrical networks	1990	Carsten Thomassen	1
+ PDF Chat	The electrical resistance of a graph captures its commute and cover times	1989	Ashok K. Chandra Prabhakar Raghavan Walter L. Ruzzo Roman Smolensky	1
+	A new bound for the quadratic assignment problem based on convex quadratic programming	2001	Kurt M. Anstreicher Nathan W. Brixius	1
+	Random walks and the effective resistance of networks	1991	Prasad Tetali	1
+ PDF Chat	Covering Problems for Brownian Motion on Spheres	1988	Peter Matthews	1
+ PDF Chat	Bounds for the quadratic assignment problem using the bundle method	2006	Franz Rendl Renata Sotirov	1
+	Discrete Green's Functions	2000	Fan Chung Shing‐Tung Yau	1
+	SDPT3 — A Matlab software package for semidefinite programming, Version 1.3	1999	Kim-Chuan Toh Michael J. Todd Reha Tütüncü	1
+	Discrete Greenʼs functions and random walks on graphs	2012	Hao Xu Shing‐Tung Yau	1
+	Random walks on highly symmetric graphs	1990	Luc Devroye Amine Sbihi	1
+	Extremal cover times for random walks on trees	1990	Graham Brightwell Peter Winkler	1
+ PDF Chat	Hitting Times of Walks on Graphs through Voltages	2014	José Luis Palacios Eduardo Gómez Miguel Del Río	1
+	Random walk and electric currents in networks	1959	C. St. J. A. Nash‐Williams	1
+ PDF Chat	Hitting Times, Cover Cost, and the Wiener Index of a Tree	2016	Agelos Georgakopoulos Stephan Wagner	1
+ PDF Chat	The Best Mixing Time for Random Walks on Trees	2016	Andrew Beveridge Jeanmarie Youngblood	1
+	Hitting times for random walks on subdivision and triangulation graphs	2017	Haiyan Chen	1
+	Expected hitting times for random walks on quadrilateral graphs and their applications	2017	Jing Huang Shuchao Li	1
+	The hitting time of random walk on unicyclic graphs	2019	Xiaomin Zhu Xiao‐Dong Zhang	1
+ PDF Chat	An explicit formula of hitting times for random walks on graphs	2014	Hao Xu Shing‐Tung Yau	1
+	Further results on the expected hitting time, the cover cost and the related invariants of graphs	2018	Jing Huang Shuchao Li Zheng Xie	1
+	Extremal cover cost and reverse cover cost of trees with given segment sequence	2019	Shuchao Li Shujing Wang	1
+	Extremal hitting times of trees with some given parameters	2020	Huihui Zhang Shuchao Li	1
+	On the (reverse) cover cost of trees with some given parameters	2020	Huihui Zhang Shuchao Li	1
+	The Hitting Times of Random Walks on Bicyclic Graphs	2021	Xiaomin Zhu Xiao‐Dong Zhang	1
+	Random walks on edge-transitive graphs (II)	1999	José Luis Palacios José Miguel Renom Pedro Berrizbeitia	1
+	A Tractable Variant of Cover Time	2012	Agelos Georgakopoulos	1
+	None	2001	Andrey A. Dobrynin R. C. Entringer Iván Gutman	1