Weighted planar stochastic lattice

The construction process of the WPSL can be described as follows.{{cite journal | last1=Hassan | first1=M K | last2=Hassan | first2=M Z | last3=Pavel | first3=N I | title=Scale-free network topology and multifractality in a weighted planar stochastic lattice | journal=New Journal of Physics | volume=12 | issue=9 | date=2010-09-27 | issn=1367-2630 | doi=10.1088/1367-2630/12/9/093045 | page=093045| arxiv=1008.4994 | bibcode=2010NJPh...12i3045H |doi-access=free}}{{cite journal | last1=Hassan | first1=M K | last2=Hassan | first2=M Z | last3=Pavel | first3=N I | title=Scale-free coordination number disorder and multifractal size disorder in weighted planar stochastic lattice | journal=Journal of Physics: Conference Series | publisher=IOP Publishing |volume=297 | date=2011-05-01 | issue=1 | issn=1742-6596 | doi=10.1088/1742-6596/297/1/012010 | page=012010| arxiv=1104.1831 | bibcode=2011JPhCS.297a2010H }} It starts with a square of unit area which we regard as an initiator. The generator then divides the initiator, in the first step, randomly with uniform probability into four smaller blocks. In the second step and thereafter, the generator is applied to only one of the blocks. The question is: How do we pick that block when there is more than one block? The most generic choice would be to pick preferentially according to their areas so that the higher the area the higher the probability to be picked. For instance, in step one, the generator divides the initiator randomly into four smaller blocks. Let us label their areas starting from the top left corner and moving clockwise as $a\_1,\; a\_2,\; a\_3$ and $a\_4$. But of course the way we label is totally arbitrary and will bear no consequence to the final results of any observable quantities. Note that $a\_i$ is the area of the $i$th block which can be well regarded as the probability of picking the $i$th block. These probabilities are naturally normalized $\backslash sum\_i\; a\_i=1$ since we choose the area of the initiator equal to one. In step two, we pick one of the four blocks preferentially with respect to their areas. Consider that we pick the block $3$ and apply the generator onto it to divide it randomly into four smaller blocks. Thus the label $3$ is now redundant and hence we recycle it to label the top left corner while the rest of three new blocks are labelled $a\_5,\; a\_6$ and $a\_7$ in a clockwise fashion. In general, in the $j$th step, we pick one out of $3j-2$ blocks preferentially with respect to area and divide randomly into four blocks.

File:Log aC vs a 1 copy.jpg

File:Distribution WPSL.jpg

• Planar
• Stochastic
• Stochastic process

{{Reflist}}

Category:Applied mathematics

Category:Stochastic models

Category:Network theory

Category:Graph theory