English
Related papers

Related papers: Spectral theorems for random walks on mapping clas…

200 papers

The range process $R_n$ of a random walk is the collection of sites visited by the random walk up to time $n$. In this work we deal with the question of whether the range process of a random walk or the range process of a cocycle over an…

Probability · Mathematics 2018-12-19 George Deligiannidis , Sebastien Gouezel , Zemer Kosloff

We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…

Probability · Mathematics 2010-07-13 David Windisch

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…

Probability · Mathematics 2021-12-08 David A. Croydon , Daisuke Shiraishi

It has recently been shown that networks possessing scale-free and fractal properties may exhibit a bifractal nature, in which local structures are described by two different fractal dimensions. In this study, we investigate random walks on…

Physics and Society · Physics 2024-12-30 Kousuke Yakubo , Gentaro Shimojo , Jun Yamamoto

We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…

Probability · Mathematics 2016-06-02 Matthias Birkner , Jiří Černý , Andrej Depperschmidt

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

Probability · Mathematics 2015-01-14 Masato Shinoda , Elmar Teufl , Stephan Wagner

We establish new results on the dimensional properties of measures and invariant sets associated to random walks and group actions by circle diffeomorphisms. This leads to several dynamical applications. Among the applications, we show,…

Dynamical Systems · Mathematics 2024-10-25 Weikun He , Yuxiang Jiao , Disheng Xu

Given a diffeomorphism of the interval, consider the uniform norm of the derivative of its n-th iteration. We get a sequence of real numbers called the growth sequence. Its asymptotic behavior is an invariant which naturally appears both in…

Classical Analysis and ODEs · Mathematics 2012-01-17 Lev Buhovsky , Roman Muraviev

In this article, we study branching random walks on graphs modeling division-mutation processes inspired by adaptive immunity. We apply the theory of expander graphs on mutation rules in evolutionary processes and obtain estimates for the…

Probability · Mathematics 2016-07-05 Irene Balelli , Vuk Milisic , Gilles Wainrib

We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…

Statistical Mechanics · Physics 2008-10-21 Andrea Baronchelli , Michele Catanzaro , Romualdo Pastor-Satorras

For any finitely generated group G, let n ---> \Phi_G(n) be the function that describes the rough asymptotic behavior of the probability of return to the identity element at time 2n of a symmetric simple random walk on G (this is an…

Probability · Mathematics 2013-07-23 Laurent Saloff-Coste , Tianyi Zheng

The continuous time random walks (CTRWs) are typically defned in the way that their trajectories are discontinuous step fuctions. This may be a unwellcome feature from the point of view of application of theese processes to model certain…

Probability · Mathematics 2017-11-08 Piotr Zebrowski , Marcin Magdziarz

We study the random walk on the symmetric group $S_n$ generated by the conjugacy class of cycles of length $k$. We show that the convergence to uniform measure of this walk has a cut-off in total variation distance after $\frac{n}{k} log n$…

Probability · Mathematics 2016-05-04 Bob Hough

We construct a covering of Culler-Vogtmann Outer space by the Teichmuller spaces of punctured surfaces. By considering the equivariant homology for the action of Out(F_n) on this covering, we construct a spectral sequence converging to the…

Geometric Topology · Mathematics 2021-09-24 Matthew Horak

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…

Disordered Systems and Neural Networks · Physics 2009-11-10 Carlos P. Herrero

In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…

Quantum Algebra · Mathematics 2019-05-14 Isabelle Baraquin

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

In this paper we prove a rate of escape theorem and a central limit theorem for isotropic random walks on Fuchsian buildings, giving formulae for the speed and asymptotic variance. In particular, these results apply to random walks induced…

Probability · Mathematics 2014-12-01 L. A. Gilch , S. Mueller , J. Parkinson

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

Probability · Mathematics 2020-06-02 James R. Lee

Consider d uniformly random permutation matrices on n labels. Consider the sum of these matrices along with their transposes. The total can be interpreted as the adjacency matrix of a random regular graph of degree 2d on n vertices. We…

Probability · Mathematics 2019-09-25 Ioana Dumitriu , Tobias Johnson , Soumik Pal , Elliot Paquette