Multifractal analysis of one-dimensional biased walks
From MaRDI portal
Publication:4959952
DOI10.1142/S0218348X18500305zbMATH Open1433.60021OpenAlexW2791728962WikidataQ130184258 ScholiaQ130184258MaRDI QIDQ4959952FDOQ4959952
Authors: Yufei Chen, Meifeng Dai, Yu Sun, Su Weiyi, Xiaoqian Wang
Publication date: 7 April 2020
Published in: Fractals (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218348x18500305
Recommendations
Cites Work
Cited In (9)
- Mean first-passage times for two biased walks on the weighted rose networks
- Individual behaviors of oriented walks.
- Multi-scale analysis and random walks boundaries
- FRACTAL SETS IN THE FIELD OF p-ADIC ANALOGUE OF THE COMPLEX NUMBERS
- Analysis of a one-dimensional random walk with irreversible losses at each step: applications for protein movement on DNA
- Average trapping time of weighted scale-free m-triangulation networks
- Title not available (Why is that?)
- CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS
- WEIERSTRASS-TYPE FUNCTIONS IN p-ADIC LOCAL FIELDS
This page was built for publication: Multifractal analysis of one-dimensional biased walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959952)