Related papers: Knots and Random Walks in Vibrated Granular Chains
We consider a discrete time quantum walker in one dimension, where at each step, the step length $\ell$ is chosen from a distribution $P(\ell) \propto \ell^{-\delta -1}$ with $\ell \leq \ell_{max}$. We evaluate the probability $f(x,t)$ that…
The interplay of topological constraints and Coulomb interactions in static and dynamic properties of charged polymers is investigated by numerical simulations and scaling arguments. In the absence of screening, the long-range interaction…
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…
We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…
In a continuous time random walk (CTRW), each random jump follows a random waiting time. CTRW scaling limits are time-changed processes that model anomalous diffusion. The outer process describes particle jumps, and the non-Markovian inner…
A central paradigm of polymer physics states that chains in melts behave like random walks as intra- and interchain interactions effectively cancel each other out. Likewise, $\theta$-chains, i.e., chains at the transition from a swollen…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
We investigate the dynamics of random walks on weighted networks. Assuming that the edge's weight and the node's strength are used as local information by a random walker, we study two kinds of walks, weight-dependent walk and…
This paper is a collection of recent results on discrete-time and continuous-time branching random walks. Some results are new and others are known. Many aspects of this theory are considered: local, global and strong local survival, the…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
We investigate the behaviour of a finite chain of Brownian particles, interacting through a pairwise potential $U$, with one end of the chain fixed and the other end pulled away, in the limit of slow pulling speed and small Brownian noise.…
We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…
In this paper, we present a theory to efficiently deal with mechanical properties of heterogeneous polymer chain in free space and the central problem is to evaluate the diffusion equation and orientation-orientation correlation function,…
We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of…
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…
Recently, neuronal avalanches have been observed to display oscillations, a phenomenon regarded as the co-existence of a scale-free behaviour (the avalanches close to criticality) and scale-dependent dynamics (the oscillations). Ordinary…
We analyze the dynamics of random walks in which the jumping probabilities are periodic {\it time-dependent} functions. In particular, we determine the survival probability of biased walkers who are drifted towards an absorbing boundary.…
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously…
We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length $\ell$ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and…