Stochastic growth tree networks with an identical fractal dimension: construction and mean hitting time for random walks

DOI10.1063/5.0093795zbMATH Open1542.90068MaRDI QIDQ6565166FDOQ6565166

Fei Ma, Xudong Luo, Ping Wang

Publication date: 1 July 2024

Published in: Chaos (Search for Journal in Brave)

zbMATH Keywords

edge-operationedge-vertex-operation

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81) Stochastic network models in operations research (90B15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Exponential-family random graph models for valued networks
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• A guide to first-passage processes
• Exact Recovery in the Stochastic Block Model
• Collective dynamics of ‘small-world’ networks
• Networks
• Fractal interpolation on the Koch curve
• Brownian Motion and Harmonic Analysis on Sierpinski Carpets
• Hitting Times, Cover Cost, and the Wiener Index of a Tree
• On the spectrum of the normalized Laplacian of iterated triangulations of graphs
• Epidemic spreading on complex networks with community structure
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm
• The distribution of first hitting times of randomwalks on Erdős–Rényi networks
• Elements of random walk and diffusion processes
• Nonlinear synchronization on connected undirected networks
• Spectral properties of the trap model on sparse networks
• Generating Fibonacci-model as evolution of networks with vertex-velocity and time-memory
• Dynamics of nonlinear random walks on complex networks
• An ensemble of random graphs with identical degree distribution
• The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
• Random growth networks with exponential degree distribution

Cited In (1)

• Dispersion complexity-entropy curves: an effective method to characterize the structures of nonlinear time series

This page was built for publication: Stochastic growth tree networks with an identical fractal dimension: construction and mean hitting time for random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565166)