Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Palacios, JoséLuis
and
Tetali, Prasad
1996.
A note on expected hitting times for birth and death chains.
Statistics & Probability Letters,
Vol. 30,
Issue. 2,
p.
119.
Nyberg, Svein Olav
1997.
The discrete Einstein relation.
Circuits Systems and Signal Processing,
Vol. 16,
Issue. 5,
p.
547.
Ponzio, Stephen
1998.
The Combinatorics of Effective Resistances and Resistive Inverses.
Information and Computation,
Vol. 147,
Issue. 2,
p.
209.
Tetali, Prasad
1999.
Design of On-Line Algorithms Using Hitting Times.
SIAM Journal on Computing,
Vol. 28,
Issue. 4,
p.
1232.
Winkler, Peter
2000.
Dependent percolation and colliding random walks.
Random Structures and Algorithms,
Vol. 16,
Issue. 1,
p.
58.
Bingham, N.H.
2001.
Stochastic Processes: Theory and Methods.
Vol. 19,
Issue. ,
p.
171.
Palacios, Jos� Luis
2001.
Closed-form formulas for Kirchhoff index.
International Journal of Quantum Chemistry,
Vol. 81,
Issue. 2,
p.
135.
Chlamtac, Eden
and
Feige, Uriel
2005.
Improved approximation of the minimum cover time.
Theoretical Computer Science,
Vol. 341,
Issue. 1-3,
p.
22.
Palacios, José Luis
and
Renom, José M.
2010.
Sum rules for hitting times of Markov chains.
Linear Algebra and its Applications,
Vol. 433,
Issue. 2,
p.
491.
Chen, Haiyan
2010.
Random walks and the effective resistance sum rules.
Discrete Applied Mathematics,
Vol. 158,
Issue. 15,
p.
1691.
Cinkir, Zubeyir
2011.
Generalized Foster's identities.
International Journal of Quantum Chemistry,
Vol. 111,
Issue. 10,
p.
2228.
Xu, Hao
and
Yau, Shing-Tung
2013.
Discrete Greenʼs functions and random walks on graphs.
Journal of Combinatorial Theory, Series A,
Vol. 120,
Issue. 2,
p.
483.
Palacios, José Luis
Gómez, Eduardo
and
Del Río, Miguel
2014.
Hitting Times of Walks on Graphs through Voltages.
Journal of Probability,
Vol. 2014,
Issue. ,
p.
1.
Markowsky, Greg
and
Palacios, José Luis
2017.
Sum rules for effective resistances in infinite graphs.
Journal of Statistical Mechanics: Theory and Experiment,
Vol. 2017,
Issue. 4,
p.
043403.
Thulasiraman, Krishnaiyan
Yadav, Mamta
and
Naik, Kshirasagar
2019.
Network Science Meets Circuit Theory: Resistance Distance, Kirchhoff Index, and Foster’s Theorems With Generalizations and Unification.
IEEE Transactions on Circuits and Systems I: Regular Papers,
Vol. 66,
Issue. 3,
p.
1090.
Ye, Luzh
and
Yan, Weigen
2019.
Resistance between two vertices of almost complete bipartite graphs.
Discrete Applied Mathematics,
Vol. 257,
Issue. ,
p.
299.
Choi, Michael C.H.
2019.
On resistance distance of Markov chain and its sum rules.
Linear Algebra and its Applications,
Vol. 571,
Issue. ,
p.
14.
Zhang, Jingyuan
and
Yan, Weigen
2020.
A New Proof of Foster’s First Theorem.
The American Mathematical Monthly,
Vol. 127,
Issue. 1,
p.
72.
Ge, Jun
and
Dong, Fengming
2020.
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs.
Discrete Applied Mathematics,
Vol. 283,
Issue. ,
p.
542.
Chebotarev, Pavel
and
Deza, Elena
2020.
Hitting time quasi-metric and its forest representation.
Optimization Letters,
Vol. 14,
Issue. 2,
p.
291.