Add to ORKGMany real life networks present an average path length logarithmic with the number of nodes and a degree distribution which follows a power law. Often these networks have also a modular and self-similar structure and, in some cases - usually associated with topological restrictions- their clustering is low and they are almost planar. In this paper we introduce a family of graphs which share all these properties and are defined by two parameters. As their construction is deterministic, we obtain exact analytic expressions for relevant properties of the graphs including the degree distribution, degree correlation, diameter, and average distance, as a function of the two defining parameters. Thus, the graphs are useful to model some c...
Researchers have proposed a variety of metrics to measure important graph properties, for instance, ...
Abstract—We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and...
The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-46084-5_5Proceedi...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
In this paper we introduce a family of planar, modular and self-similar graphs which have small-worl...
Background: Much work in systems biology, but also in the analysis of social network and communicati...
We propose a unified model to build planar graphs with diverse topological characteristics which are...
This work describes how the formalization of complex network concepts in terms of discrete mathemati...
Researchers have proposed a variety of metrics to measure important graph properties, for instance, ...
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Re...
Complex networks describe a variety of systems found in nature and society. Traditionally these syst...
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Re...
Complex networks describe a wide range of systems and structures in the world. Any real network can ...
Abstract. We present a stochastic model for networks with arbitrary degree distributions and average...
Researchers have proposed a variety of metrics to measure important graph properties, for instance, ...
Abstract—We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and...
The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-46084-5_5Proceedi...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
Many real life networks present an average path length logarithmic with the number of nodes and a de...
In this paper we introduce a family of planar, modular and self-similar graphs which have small-worl...
Background: Much work in systems biology, but also in the analysis of social network and communicati...
We propose a unified model to build planar graphs with diverse topological characteristics which are...
This work describes how the formalization of complex network concepts in terms of discrete mathemati...
Researchers have proposed a variety of metrics to measure important graph properties, for instance, ...
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Re...
Complex networks describe a variety of systems found in nature and society. Traditionally these syst...
This paper introduces a family of modular, self-similar, small-world graphs with clustering zero. Re...
Complex networks describe a wide range of systems and structures in the world. Any real network can ...
Abstract. We present a stochastic model for networks with arbitrary degree distributions and average...
Researchers have proposed a variety of metrics to measure important graph properties, for instance, ...
Abstract—We propose a radically new family of geometric graphs, i.e., Hypocomb, Reduced Hypocomb and...
The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-46084-5_5Proceedi...