Related papers: Geometry and Dynamics for Hierarchical Regular Net…
Two new classes of networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They consist of a one-dimensional lattice backbone overlayed by a hierarchical…
Diffusion is modeled on the recently proposed Hanoi networks by studying the mean- square displacement of random walks with time, <r^2>~t^{2/d_w}. It is found that diffusion - the quintessential mode of transport throughout Nature -…
We present a rotated hyperbolic wrapped normal distribution (RoWN), a simple yet effective alteration of a hyperbolic wrapped normal distribution (HWN). The HWN expands the domain of probabilistic modeling from Euclidean to hyperbolic…
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…
We give exact relations for certain types of the hierarchic fractal structures. In the blatant distinction from regular networks of the "small world" (SW) topology [1], regular fractal networks manifests the logarithmic dependence of the…
We consider the role of network geometry in two types of diffusion processes: transport of constant-density information packets with queuing on nodes, and constant voltage-driven tunneling of electrons. The underlying network is a…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
From extensive numerical simulations, we find that periodic polygonal billiard channels with angles which are irrational multiples of pi generically exhibit normal diffusion (linear growth of the mean squared displacement) when they have a…
The return-to-origin probability and the first passage time distribution are essential quantities for understanding transport phenomena in diverse systems. The behaviors of these quantities typically depend on the spectral dimension $d_s$.…
Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…
In recent years, graph neural networks (GNNs) have gained increasing popularity and have shown very promising results for data that are represented by graphs. The majority of GNN architectures are designed based on developing new…
The transport of quantum electrons through hierarchical lattices is of interest because such lattices have some properties of both regular lattices and random systems. We calculate the electron transmission as a function of energy in the…
We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…
A class of cubic networks composed of a regular one-dimensional lattice and a set of long-range links is introduced. Networks parametrized by a positive integer k are constructed by starting from a one-dimensional lattice and iteratively…
Let $M$ be the infinite spanning-tree-weighted random planar map, which is the local limit of finite random planar maps sampled with probability proportional to the number of spanning trees they admit. We show that a.s. the…
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…
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either well-structured regular subgraphs or those with many triangles. We observe a superdiffusion for the highly connected nodes while it is…
We derive a renormalization method to calculate the spectral dimension $\bar{d}$ of deterministic self-similar networks with arbitrary base units and branching constants. The generality of the method allows the affect of a multitude of…
We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the interactions of which lead to a dynamic graph. The walkers of the…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…