相关论文: Analytical estimation of the correlation dimension…
We consider various two-dimensional lattices such as square, Kagome, Lieb, honeycomb, dice lattices of finite extent, to study the effect of lattice profile in terms of the number of nearest neighbour and connectivity patterns on the…
We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the…
In this paper, we study detection and fast reconstruction of the celebrated Watts-Strogatz (WS) small-world random graph model \citep{watts1998collective} which aims to describe real-world complex networks that exhibit both high clustering…
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into Gamma_f, the f-dimensional Fibonacci cube. We give bounds on the Fibonacci dimension of a graph in terms of…
A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension of $\Gamma$ is the smallest size of…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
Understanding the intricate architecture of brain networks and its connection to brain function is essential for deciphering the underlying principles of cognition and disease. While traditional graph-theoretical measures have been widely…
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…
We obtain an implicit equation for the correlation dimension of dynamical systems in terms of an integral over a propagator. We illustrate the utility of this approach by evaluating the correlation dimension for inertial particles suspended…
This paper introduces a novel mathematical framework for analyzing cyber threat campaigns through fractal geometry. By conceptualizing hierarchical taxonomies (MITRE ATT&CK, DISARM) as snowflake-like structures with tactics, techniques, and…
As for the remarkable study on the estimate of the Hausdorff dimension of a self-similar set due to weak contractions (Kitada A. et al. Chaos, Solitons & Fractals 13 (2002) 363-366), we present a mathematically simplified form which will be…
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…
We prove a conjectured graph theoretic characterization of a geometric property of 3 dimensional linkages posed 15 years ago by Sitharam and Gao, motivated by their equivalent characterization for $d\le 2$ that does not generalize to $d\ge…
Graphs and network data are ubiquitous across a wide spectrum of scientific and application domains. Often in practice, an input graph can be considered as an observed snapshot of a (potentially continuous) hidden domain or process.…
Recently, the first author has extended the definition of the zeta function associated with fractal strings to arbitrary bounded subsets $A$ of the $N$-dimensional Euclidean space ${\mathbb R}^N$, for any integer $N\ge1$. It is defined by…
Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…
The metric dimension is quite a well-studied graph parameter. Recently, the adjacency dimension and the local metric dimension have been introduced and studied. In this paper, we give a general formula for the local metric dimension of the…
We show analytically that the $[0,1]$, $[1,1]$ and $[2,1]$ Pad{\'e} approximants of the mean cluster number $S(p)$ for site and bond percolation on general $d$-dimensional lattices are upper bounds on this quantity in any Euclidean…
It has been recently proposed that the natural connectivity can be used to characterize efficiently the robustness of complex networks. The natural connectivity quantifies the redundancy of alternative routes in the network by evaluating…
We use persistent homology in order to define a family of fractal dimensions, denoted $\mathrm{dim}_{\mathrm{PH}}^i(\mu)$ for each homological dimension $i\ge 0$, assigned to a probability measure $\mu$ on a metric space. The case of…