Search arXivSearch

arXiv · 2405.06236

Fixed Node Determination and Analysis in Directed Acyclic Graphs of Structured Networks

Abstract

This paper explores the conditions for determining fixed nodes in structured networks, specifically focusing on directed acyclic graphs (DAGs). We introduce several necessary and sufficient conditions for determining fixed nodes in $p$-layered DAGs. This is accomplished by defining the problem of maximum disjoint stems, based on the observation that all DAGs can be represented as hierarchical structures with a unique label for each layer. For structured networks, we discuss the importance of fixed nodes by considering their controllability against the variations of network parameters. Moreover, we present an efficient algorithm that simultaneously performs labeling and fixed node search for $p$-layered DAGs with an analysis of its time complexity. The results presented in this paper have implications for the analysis of controllability at the individual node level in structured networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nam-jin Park, Yeong-Ung Kim, Hyo-Sung Ahn. 2024-05-10. Fixed Node Determination and Analysis in Directed Acyclic Graphs of Structured Networks. https://doi.org/10.1016/j.jfranklin.2024.106995

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The circle as a topological fractal

We prove that no family of two continuous self-maps witnesses that the circle is a topological fractal, answering a question of Karasová and the present author. Since three maps are known to suffice, this bound is optimal. In contrast, for every $\varepsilon>0$ there are two continuous self-maps of the circle, depending on $\varepsilon$, whose images cover the circle and an integer $N$ such that every composition of $N$ of them has image of diameter less than $\varepsilon$. Thus two maps suffice at any prescribed scale, but no fixed pair works at all scales.

math.GN

Finite-Point Metrizable Coarsenings: Compatible Gauges, Simplicial Metrics, and Hausdorff Lower Bounds

Let $(X,τ)$ be metrizable and let $F=\{a_1,\ldots,a_k\}\subseteq X$, where $2\le k<\infty$. We represent all metrizable topologies $σ\subseteqτ$ agreeing with $τ$ on $X\setminus F$ by compatible systems of continuous gauges $s_i:X\to[0,1]$ with $s_i^{-1}(0)=\{a_i\}$. The condition $\inf_X\max\{s_i,s_j\}>0$ for $i\ne j$ is equivalent to both Hausdorffness and metrizability of the prescribed gauge topology. A normalized product map into the standard simplex gives an explicit metric; its triangle inequality follows from a simplex slack inequality. This metric is complete whenever the auxiliary bounded compatible metric is complete. For two compatible systems, their coordinatewise minimum describes the intersection topology. It is compatible exactly when the two coarsenings have a common Hausdorff lower bound; in that case the intersection is metrizable and is their meet. Otherwise every common lower topology is non-Hausdorff. A closed-discrete construction produces such an obstructed pair for every noncompact metrizable space and every finite exceptional set with at least two points. Consequently, for these exceptional sets, the family is downward directed, or is a lattice, if and only if $(X,τ)$ is compact, in which case it consists only of $τ$.

math.GN

Journey into special $T_1$-spaces

In this survey, we review certain types of special \(T_{1}\) spaces and their associated fixed-point theorems. Kupka introduced the notion of a feeble topological contraction, which naturally generalizes Lipschitz contractions defined on metric spaces. Specifically, Kupka established a fixed-point theorem for feeble topological contractions possessing a closed graph within the product of arbitrary \(T_{0}\) spaces. Furthermore, the \(T_{1}\) separation axiom is shown to guaranty the uniqueness of such fixed points. Finally, we discuss peripheral Hausdorff and locally Hausdorff spaces within the context of these fixed-point results.

math.GN