Estimate the shortest paths on fractal \(m\)-gons

DOI10.1016/j.cnsns.2011.08.033zbMath1245.28009OpenAlexW2028585586MaRDI QIDQ434781

Mohamed Mubarak

Publication date: 16 July 2012

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2011.08.033

zbMATH Keywords

shortest pathsfractalscomplex systemscomplex networkthe mean geodesic

Mathematics Subject Classification ID

Fractals (28A80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition densities for Brownian motion on the Sierpinski carpet
• The average distance on the Sierpiński gasket
• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• Fractaln-gons and their Mandelbrot sets
• On the structure of self-similar sets
• Self‐Similar Sets 2. A Simple Approach to the Topological Structure of Fractals
• Brownian motion on nested fractals
• Isoperimetric Estimates on Sierpinski Gasket Type Fractals
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Estimate the shortest paths on fractal \(m\)-gons