No article text was recorded for this version.
recursive network construction
Version 2 of 293 papers134 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Self-similar planar graphs as models for complex networks
- Blog: An alternative approach to determining average distance in a class of scale-free modular networks
- Blog: Novel scale-free small-world networks from Koch curves
- Blog: A Method for Geodesic Distance on Subdivision of Trees with Arbitrary Orders and Their Applications
- Blog: Planar unclustered scale-free graphs as models for technological and biological networks
- Blog: Kronecker Graphs: An Approach to Modeling Networks
- Blog: A deterministic small-world network created by edge iterations
- Blog: Average distance in a hierarchical scale-free network: an exact solution
- Blog: Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
- Blog: Vertex labeling and routing in expanded Apollonian networks
- Blog: On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Blog: Controlling the Multifractal Generating Measures of Complex Networks
- Blog: Standard random walks and trapping on the Koch network with scale-free behavior and small-world effect
- Blog: Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
- Blog: Recursive weighted treelike networks
- Blog: Hitting Times of Random Walks on Edge Corona Product Graphs
- Blog: Trapping in scale-free networks with hierarchical organization of modularity
- Blog: Scalable modeling of real graphs using Kronecker multiplication
- Blog: Mean first-passage time for random walks on the T-graph
- Blog: COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
- Blog: Exact mean first-passage time on generalized Vicsek fractal
- Blog: Kronecker Graphs: An Approach to Modeling Networks
- Blog: The number and degree distribution of spanning trees in the Tower of Hanoi graph
- Blog: Scaling of average receiving time on weighted polymer networks with some topological properties
- Blog: Graph Mining: Patterns, Generators and Tools
- Blog: Mean hitting time for random walks on the T-graph
- Blog: A Method for Geodesic Distance on Subdivision of Trees With Arbitrary Orders and Their Applications
- Blog: Evolving pseudofractal networks
- Blog: A general geometric growth model for pseudofractal scale-free web
- Blog: Structural and spectral properties of a family of deterministic recursive trees: rigorous solutions
- Blog: Self-similar non-clustered planar graphs as models for complex networks
- Blog: Spectra, Hitting Times and Resistance Distances of<i>q</i>- Subdivision Graphs
- Blog: Resistance Distances in Simplicial Networks
- Blog: Farey graphs as models for complex networks
- Blog: Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
- Blog: The Number of Spanning Trees of an Infinite Family of Outerplanar, Small-World and Self-Similar Graphs
- Blog: A hierarchical three-way interconnect architecture for hexagonal processors
- Blog: On Freese's technique
- Blog: Distinct scalings for mean first-passage time of random walks on scale-free networks with the same degree sequence
- Blog: Analytical solution of average path length for Apollonian networks
- Blog: Some Combinatorial Problems in Power-law Graphs
- Blog: BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks
- Blog: Random walks on the Apollonian network with a single trap
- Blog: Design, Generation, and Validation of Extreme Scale Power-Law Graphs
- Blog: Griffiths singularities and algebraic order in the exact solution of an Ising model on a fractal modular network
- Blog: Effects of heterogeneity in site–site couplings for tight-binding models on scale-invariant structures
- Blog: Exact calculations of first-passage properties on the pseudofractal scale-free web
- Blog: Evolving networks consist of cliques
- Blog: An Unpooling Layer for Graph Generation
- Blog: Exact solution for mean first-passage time on a pseudofractal scale-free web
- Blog: Extremal digraphs for open neighbourhood location-domination and identifying codes
- Blog: A unified model for Sierpinski networks with scale-free scaling and small-world effect
- Blog: Spanning Triangle-trees and Flows of Graphs
- Blog: Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm
- Blog: Type-II Apollonian Model
- Blog: Realizing RCC8 networks using convex regions
- Blog: Modeling Blog Dynamics
- Blog: Topologies and Laplacian spectra of a deterministic uniform recursive tree
- Blog: A Mathematical Theory of Hyper-simplex Fractal Network for Blockchain: Part I
- Blog: Realization of Multi-Terminal Universal Interconnection Networks Using Contact Switches
Showing 60 of 93 papers.
History & citation
Current · Permanent link
- Exact Analytical Solutions for Self Similar Networks merged into this direction (70% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_recursive_network_construction_c1d8dc40,
title = {recursive network construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/recursive-network-construction/rdr_c1d8dc402aea43b28665885c8d8701ba},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_recursive_network_construction_c1d8dc40_v2,
title = {recursive network construction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/recursive-network-construction/rdr_c1d8dc402aea43b28665885c8d8701ba/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}