Simple Derivation of the Lifetime and the Distribution of Faces for a Binary Subdivision Model

The iterative random subdivision of rectangles is used as a generation model of networks in physics, computer science, and urban planning. However, these researches were independent. We consider some relations in them, and derive fundamental properties for the average lifetime depending on birth-time and the balanced distribution of rectangle faces.

[1]  Grzegorz Rozenberg,et al.  Parallel Generation of Maps: Developmental Systems for Cell Layers , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[2]  Parongama Sen,et al.  Modulated scale-free network in Euclidean space. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Tao Zou,et al.  Random Sierpinski network with scale-free small-world and modular structure , 2008, 0803.0780.

[4]  E. Fekete.  Arms and Feet Nodes Level Polynomial in Binary Search Trees , 2004 .

[5]  Parongama Sen,et al.  Clustering properties of a generalized critical Euclidean network. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  S. S. Manna,et al.  A transition from river networks to scale-free networks , 2007, cond-mat/0701246.

[7]  Tao Zhou,et al.  Maximal planar networks with large clustering coefficient and power-law degree distribution. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Pascal Müller,et al.  Procedural modeling of cities , 2001, SIGGRAPH.

[9]  Tao Zhou,et al.  Erratum: Maximal planar networks with large clustering coefficient and power-law degree distribution [Phys. Rev. E 71, 046141 (2005)] , 2005 .

[10]  N. Kato,et al.  L-SYSTEM APPROACH TO GENERATING ROAD NETWORKS FOR VIRTUAL CITIES , 2000 .

[11]  Jean Jabbour-Hattab,et al.  Martingales and large deviations for binary search trees , 2001, Random Struct. Algorithms.

[12]  Pascal Müller.  Procedural modeling of cities , 2006, SIGGRAPH Courses.

[13]  Alberto Vancheri.  The dynamics of complex urban systems : an interdisciplinary approach , 2010 .

[14]  Yukio Hayashi,et al.  An approximative calculation of the fractal structure in self-similar tilings , 2010, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[15]  Lei Wang,et al.  Random pseudofractal scale-free networks with small-world effect , 2006 .

[16]  Takuya Machida,et al.  Combinatorial and approximative analyses in a spatially random division process , 2013, ArXiv.

[17]  Lili Rong,et al.  High-dimensional random Apollonian networks , 2005, cond-mat/0502591.

[18]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  I M Sokolov,et al.  Evolving networks with disadvantaged long-range connections. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Jonathan P K Doye,et al.  Self-similar disk packings as model spatial scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Leonidas J. Guibas,et al.  Static and kinetic geometric spanners with applications , 2001, SODA '01.

[22]  Pierre Frankhauser,et al.  Fractal Geometry for Measuring and Modelling Urban Patterns , 2008 .

[23]  Yukio Hayashi,et al.  Geographical networks stochastically constructed by a self-similar tiling according to population. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  David Eisenstat,et al.  Random Road Networks: The Quadtree Model , 2010, ANALCO.

[25]  Julian Togelius,et al.  Constructive generation methods for dungeons and levels , 2016 .

[26]  Shlomo Havlin,et al.  Fractal and transfractal recursive scale-free nets , 2007 .

[27]  Hosam M. Mahmoud.  The Expected Distribution of Degrees in Random Binary Search Trees , 1986, Comput. J..