相关论文: A weighted planar stochastic lattice with scale-fr…
We propose a weighted planar stochastic lattice (WPSL) formed by the random sequential partition of a plane into contiguous and non-overlapping blocks and find that it evolves following several non-trivial conservation laws, namely…
The square lattice is perhaps the simplest cellular structure. In this work, however, we investigate the various structural and topological properties of the kinetic and stochastic counterpart of the square lattice and termed them as…
In this article, we show that the block size distribution function in the weighted planar stochastic lattice (WPSL), which is a multifractal and whose dual is a scale-free network, exhibits dynamic scaling. We verify it numerically using…
We introduce the Weighted Planar Stochastic Porous Lattice (WPSPL), a geometrically disordered substrate generated by iteratively subdividing a unit square. At each step a block is selected with probability proportional to its area, divided…
The weighted planar stochastic (WPS) lattice introduces a topological disorder that emerges from a multifractal structure. Its dual network has a power-law degree distribution and is embedded in a two-dimensional space, forming a planar…
We investigate site percolation on a weighted planar stochastic lattice (WPSL) which is a multifractal and whose dual is a scale-free network. Percolation is typically characterized by percolation threshold $p_c$ and by a set of critical…
We propose a deterministic weighted scale-free small-world model for considering pseudofractal web with the coevolution of topology and weight. In the model, we have the degree distribution exponent $\gamma$ restricted to a range between 2…
We propose a general geometric growth model for pseudofractal scale-free web, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks: degree distribution, second moment of degree…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
In this paper we introduce a model of spatial network growth in which nodes are placed at randomly selected locations on a unit square in $\mathbb{R}^2$, forming new connections to old nodes subject to the constraint that edges do not…
A network is formed using the $N$ sites of an one-dimensional lattice in the shape of a ring as nodes and each node with the initial degree $k_{in}=2$. $N$ links are then introduced to this network, each link starts from a distinct node,…
We propose a geometric growth model for weighted scale-free networks, which is controlled by two tunable parameters. We derive exactly the main characteristics of the networks, which are partially determined by the parameters. Analytical…
In this article, we extend the idea of stochastic dyadic Cantor set to weighted planar stochastic lattice that leads to a stochastic porous lattice. The process starts with an initiator which we choose to be a square of unit area for…
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…
Scale-free networks are abundant in nature and society, describing such diverse systems as the world wide web, the web of human sexual contacts, or the chemical network of a cell. All models used to generate a scale-free topology are…
We introduce a deterministic model for scale-free networks, whose degree distribution follows a power-law with the exponent $\gamma$. At each time step, each vertex generates its offsprings, whose number is proportional to the degree of…
We present a family of scale-free network model consisting of cliques, which is established by a simple recursive algorithm. We investigate the networks both analytically and numerically. The obtained analytical solutions show that the…
The Watts-Strogatz algorithm transferring a regular lattice to the small world network is modified by introducing preferential rewiring constrained by connectivity demand. The probability to link to/ unlink form a node is dependent on a…
A scale-free network is grown in the Euclidean space with a global directional bias. On a vertical plane, nodes are introduced at unit rate at randomly selected points and a node is allowed to be connected only to the subset of nodes which…
We propose and study a model of weighted scale-free networks incorporating a stochastic scheme for weight assignments to the links, taking into account both the popularity and fitness of a node. As the network grows the weights of links are…