Related papers: Average path length for Sierpinski pentagon
We show how appropriate rewiring with the aid of Metropolis Monte Carlo computational experiments can be exploited to create network topologies possessing prescribed values of the average path length (APL) while keeping the same…
We present exact analytical results for the distribution of shortest path lengths (DSPL) in a directed network model that grows by node duplication. Such models are useful in the study of the structure and growth dynamics of gene regulatory…
Objective. Proton beams enable localized dose delivery. Accurate range estimation is essential, but planning still relies on X-ray CT, which introduces uncertainty in stopping power and range. Proton CT measures water equivalent thickness…
As a classic self-similar network model, Sierpinski gasket network has been used many times to study the characteristics of self-similar structure and its influence on the dynamic properties of the network. However, the network models…
Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)\sim k^{-\gamma}$, where the degree exponent $\gamma$ describes the extent of…
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set $\mathcal{P}$ of $h$ pairwise-disjoint…
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computational Geometry, 1993). Given a set of $n$ points in the plane in…
We develop an approach for performing scaling analysis of $N$-step Random Walks (RWs). The mean square end-to-end distance, $\langle\vec{R}_{N}^{2}\rangle$, is written in terms of inner persistence lengths (IPLs), which we define by the…
Pseudo-arclength continuation is a well-established method for generating a numerical curve approximating the solution of an underdetermined system of nonlinear equations. It is an inherently sequential predictor-corrector method in which…
We derive exactly the number of Hamiltonian paths H(n) on the two dimensional Sierpinski gasket SG(n) at stage $n$, whose asymptotic behavior is given by $\frac{\sqrt{3}(2\sqrt{3})^{3^{n-1}}}{3} \times (\frac{5^2 \times 7^2 \times…
Many real networks share three generic properties: they are scale-free, display a small-world effect, and show a power-law strength-degree correlation. In this paper, we propose a type of deterministically growing networks called Sierpinski…
For the Abelian sandpile model on Sierpinski graphs, we investigate several statistics such as average height, height probabilities and looping constant. In particular, we calculate the expected average height of a recurrent sandpile on the…
We study self-approaching paths that are contained in a simple polygon. A self-approaching path is a directed curve connecting two points such that the Euclidean distance between a point moving along the path and any future position does…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
Let $s$ be a source point and $t$ be a destination point inside an $n$-vertex simple polygon $P$. Euclidean shortest paths and minimum-link paths between $s$ and $t$ inside $P$ have been well studied. Both these kinds of paths are simple…
We propose a simple algorithm which produces a new category of networks, high dimensional random Apollonian networks, with small-world and scale-free characteristics. We derive analytical expressions for their degree distributions and…
We investigate a quantum spatial search problem on fractal lattices, such as Sierpinski carpets and Menger sponges. In earlier numerical studies of the Sierpinski gasket, the Sierpinski tetrahedron, and the Sierpinski carpet, conjectures…
Given two locations $s$ and $t$ in a road network, a distance query returns the minimum network distance from $s$ to $t$, while a shortest path query computes the actual route that achieves the minimum distance. These two types of queries…
Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…