We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our model consists of a periodic random walk plus uniform jumps. This has a direct interpretation as a teleporting random walk, of the type used by search engines to locate web pages, on a simple ring network. More loosely, the model may be regarded as an analogue of the original small world network of Watts and Strogatz [Nature, 393 (1998), pp. 440-442]. We measure the small world property by expressing the mean hitting time, averaged over all states, in terms of the expected number of shortcuts per random walk. This average mean hitting time is equivalent to the expected number of steps between a pair of states chosen uniformly at random. The ana...
A regular lattice in which the sites can have long-range connections at a distance l with a probabil...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
In this thesis, we study convergence of finite state, discrete, and time homogeneous Markov chains t...
We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our mo...
We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our mo...
AbstractWe use matrix analysis to study a cycle plus random, uniform shortcuts—the classic small wor...
"Small worlds" are large networks in which any given node has only a few connections to other nodes,...
We study the mean traversal time tau for a class of random walks on Newman-Watts small-world network...
Long a matter of folklore, the ``small-world phenomenon'' --- the principle that we are all linked b...
Abstract. “Small worlds ” are large systems in which any given node has only a few con-nections to o...
New classes of random graphs have recently been shown to exhibit the small world phenomenon - they a...
The small-world network model is a simple model of the structure of social networks, which simultan...
Collective dynamics on small-world networks emerge in a broad range of systems with their spectra ch...
AbstractA small world is obtained from the d-dimensional torus of size 2L adding randomly chosen con...
Collective dynamics on small-world networks emerge in a broad range of systems with their spectra ch...
A regular lattice in which the sites can have long-range connections at a distance l with a probabil...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
In this thesis, we study convergence of finite state, discrete, and time homogeneous Markov chains t...
We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our mo...
We use techniques from applied matrix analysis to study small world cutoff in a Markov chain. Our mo...
AbstractWe use matrix analysis to study a cycle plus random, uniform shortcuts—the classic small wor...
"Small worlds" are large networks in which any given node has only a few connections to other nodes,...
We study the mean traversal time tau for a class of random walks on Newman-Watts small-world network...
Long a matter of folklore, the ``small-world phenomenon'' --- the principle that we are all linked b...
Abstract. “Small worlds ” are large systems in which any given node has only a few con-nections to o...
New classes of random graphs have recently been shown to exhibit the small world phenomenon - they a...
The small-world network model is a simple model of the structure of social networks, which simultan...
Collective dynamics on small-world networks emerge in a broad range of systems with their spectra ch...
AbstractA small world is obtained from the d-dimensional torus of size 2L adding randomly chosen con...
Collective dynamics on small-world networks emerge in a broad range of systems with their spectra ch...
A regular lattice in which the sites can have long-range connections at a distance l with a probabil...
Diaconis and others have shown that certain Markov chains exhibit a "cutoff phenomenon" in which, af...
In this thesis, we study convergence of finite state, discrete, and time homogeneous Markov chains t...