Related papers: Random walks on bifractal networks
Topological properties of "scale-free" networks are investigated by determining their spectral dimensions $d_S$, which reflect a diffusion process in the corresponding graphs. Data bases for citation networks and metabolic networks together…
We calculate the fractal dimension $d_{\rm f}$ of critical curves in the $O(n)$ symmetric $(\vec \phi^2)^2$-theory in $d=4-\varepsilon$ dimensions at 6-loop order. This gives the fractal dimension of loop-erased random walks at $n=-2$,…
We study random walks on ensembles of a specific class of random multigraphs which provide an "effective graph ensemble" for the causal dynamical triangulation (CDT) model of quantum gravity. In particular, we investigate the spectral…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
The Fourier-Bessel expansion of a function on a circular disc yields a simple series representation for the end-to-end probability distribution function w(R,phi) encountered in a planar persistent random walk, where the direction taken in a…
The dynamical discrete web (DyDW),introduced in recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical time parameter \tau. The evolution is by…
The scale-free (SF) networks that have been studied so far contained quenched disorder generated by random dilution which does not vary with the time. In practice, if a SF network is to represent, for example, the worldwide web, then the…
Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks…
In this paper, we study random walks $g_n=f_{n-1}\cdots f_0$ on the group $\mathrm{Homeo}(S^1)$ of the homeomorphisms of the circle, where the homeomorphisms $f_k$ are chosen randomly, independently, with respect to a same probability…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d greater than or equal to 2. These include…
The dynamics of swollen fractal networks (Rouse model) has been studied through computer simulations. The fluctuation-relaxation theorem was used instead of the usual Langevin approach to Brownian dynamics. We measured the equivalent of the…
We consider the two-dimensional simple random walk conditioned on never hitting the origin. This process is a Markov chain, namely it is the Doob $h$-transform of the simple random walk with respect to the potential kernel. It is known to…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
We introduce a general framework, applicable to a broad class of random walks on networks, that quantifies the response of the mean first-passage time to a target node to a local perturbation of the network, both in the context of attacks…
Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…
Traditional studies of chaos in conservative and driven dissipative systems have established a correspondence between sensitive dependence on initial conditions and fractal basin boundaries, but much less is known about the relation between…
Random Walk is a basic algorithm to explore the structure of networks, which can be used in many tasks, such as local community detection and network embedding. Existing random walk methods are based on single networks that contain limited…
We present results from a detailed numerical study of the small-scale and loop production properties of cosmic string networks, based on the largest and highest resolution string simulations to date. We investigate the non-trivial fractal…
We investigate the transport and entanglement properties exhibited by quantum walks with coin operators concatenated in a space-time fractal structure. Inspired by recent developments in photonics, we choose the paradigmatic Sierpinski…