相关论文: Transfinite fractal dimension of trees and hierarc…
The spectral dimension has been widely used to understand transport properties on regular and fractal lattices. Nevertheless, it has been little studied for complex networks such as scale-free and small world networks. Here we study the…
We study the origin of scale invariance (SI) of the degree distribution in scale-free (SF) networks with a degree exponent $\gamma$ under coarse graining. A varying number of vertices belonging to a community or a box in a fractal analysis…
Hausdorff dimension of level sets of generic continuous functions defined on fractals can give information about the "thickness/narrow cross-sections" "network" corresponding to a fractal set, $F$. This lead to the definition of the…
We introduce a new concept of dimension for metric spaces, the so-called topological Hausdorff dimension. It is defined by a very natural combination of the definitions of the topological dimension and the Hausdorff dimension. The value of…
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental testing process. Recently, there have been some attempts to analyze the…
Self-similarity is a property of fractal structures, a concept introduced by Mandelbrot and one of the fundamental mathematical results of the 20th century. The importance of fractal geometry stems from the fact that these structures were…
We consider the fragmentation process with mass loss and discuss self-similar properties of the arising structure both in time and space, focusing on dimensional analysis. This exhibits a spectrum of mass exponents $\theta$, whose exact…
The presence of large-scale real-world networks with various architectures has motivated an active research towards a unified understanding of diverse topologies of networks. Such studies have revealed that many networks with the scale-free…
We introduce graph width parameters, called $\alpha$-edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of a tree-cut decomposition. They are motivated by edge-cut width, recently…
The fractal dimension of domain walls produced by changing the boundary conditions from periodic to anti-periodic in one spatial direction is studied using both the strong-disorder renormalization group and the greedy algorithm for the…
We present the first fixed-parameter tractable (FPT) algorithms for exact computation of generalized hypertree width (ghw) and fractional hypertree width (fhw). Our algorithms are parameterized by the target width, the rank, and the maximum…
The asymptotic dimension of metric spaces is an important notion in geometric group theory introduced by Gromov. The metric spaces considered in this paper are the ones whose underlying spaces are the vertex-sets of graphs and whose metrics…
Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and…
Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified by the four problems…
Homogeneity and isotropy of the universe at sufficiently large scales is a fundamental premise on which modern cosmology is based. Fractal dimensions of matter distribution is a parameter that can be used to test the hypothesis of…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G. A resolving set X of a graph G is a subset of vertices such…
Starting from the working hypothesis that both physics and the corresponding mathematics have to be described by means of discrete concepts on the Planck-scale, one of the many problems one has to face in this enterprise is to find the…
Fractal (or transfractal) features are common in real-life networks and are known to influence the dynamic processes taking place in the network itself. Here we consider a class of scale-free deterministic networks, called $(u,v)$-flowers,…
Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution…