Return times of random walk on generalized random graphs Export

@misc{citeulike:662, abstract = {Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even broader classes of related stochastic models. Abundant results are obtained for random walk on simple graphs such as the regular lattices and the Cayley trees. However, random walks and related processes on more complex networks, which are often more relevant in the real world, are still open issues, possibly yielding different characteristics. In this paper, we investigate the return times of random walks on random graphs with arbitrary vertex degree distributions. We analytically derive the distributions of the return times. The results are applied to some types of networks and compared with numerical data.}, archivePrefix = {arXiv}, author = {Masuda, Naoki and Konno, Norio}, citeulike-article-id = {662}, citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0401255}, citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0401255}, day = {23}, eprint = {cond-mat/0401255}, keywords = {graph-theory, networks, topology}, month = {September}, posted-at = {2004-11-15 21:33:58}, title = {Return times of random walk on generalized random graphs}, url = {http://arxiv.org/abs/cond-mat/0401255}, year = {2004} }

TY - ELEC ID - citeulike:662 L3 - citeulike-article-id:662 N2 - Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even broader classes of related stochastic models. Abundant results are obtained for random walk on simple graphs such as the regular lattices and the Cayley trees. However, random walks and related processes on more complex networks, which are often more relevant in the real world, are still open issues, possibly yielding different characteristics. In this paper, we investigate the return times of random walks on random graphs with arbitrary vertex degree distributions. We analytically derive the distributions of the return times. The results are applied to some types of networks and compared with numerical data. TI - Return times of random walk on generalized random graphs KW - graph-theory KW - networks KW - topology AU - Masuda, Naoki AU - Konno, Norio PY - 2004/09/23/ UR - http://arxiv.org/abs/cond-mat/0401255 ER -