Related papers: Topological complexity of n points on a tree
Triadic closure, the formation of a connection between two nodes in a network sharing a common neighbor, is considered a fundamental mechanism determining the clustered nature of many real-world topologies. In this work we define a static…
Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…
Given a finite graph G and a topological space Z, the graphical configuration space Conf(G, Z) is the space of functions V(G) -> Z so that adjacent vertices map to distinct points. We provide a homotopy decomposition of Conf(G, X x Y) in…
A space $X$ is $n$-arc connected (respectively, $n$-circle connected) if for any choice of at most $n$ points there is an arc (respectively, a circle) in $X$ containing the specified points. We study $n$-arc connectedness and $n$-circle…
The Lusternik-Schnirelmann category $cat(X)$ is a homotopy invariant which is a numerical bound on the number of critical points of a smooth function on a manifold. Another similar invariant is the topological complexity $TC(X)$ (a la…
Geographic space is better understood through the topological relationship of the underlying streets (note: entire streets rather than street segments), which enables us to see scaling or fractal or living structure of far more…
The topology of any complex system is key to understanding its structure and function. Fundamentally, algebraic topology guarantees that any system represented by a network can be understood through its closed paths. The length of each path…
Given a graph $G$ rooted at a vertex $r$ and weight functions, $\gamma, \tau: E(G) \rightarrow \mathbb{R}$, the generalized cable-trench problem (CTP) is to find a single spanning tree that simultaneously minimizes the sum of the total edge…
Many networks in natural and human-made systems exhibit scale-free properties and are small worlds. Now we show that people's understanding of complex systems in their cognitive maps also follow a scale-free topology. People focus on a few…
Topological data analysis (TDA), while abstract, allows a characterization of time-series data obtained from nonlinear and complex dynamical systems. Though it is surprising that such an abstract measure of structure - counting pieces and…
In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
If $X$ is a (topological) space, the $n$th finite subset space of $X$, denoted by $X(n)$, consists of $n$-point subsets of $X$ (i.e., nonempty subsets of cardinality at most $n$) with the quotient topology induced by the unordering map…
We study the topological structure of random geometric forests $G$ in the Euclidean plane under mild assumptions: non-crossing edges, stationarity, and finite edge intensity. The framework covers a broad range of constructions, including…
Although random cell complexes occur throughout the physical sciences, there does not appear to be a standard way to quantify their statistical similarities and differences. The various proposals in the literature are usually motivated by…
Topological landscape is introduced for networks with functions defined on the nodes. By extending the notion of gradient flows to the network setting, critical nodes of different indices are defined. This leads to a concise and…
Network topology is a fundamental aspect of network science that allows us to gather insights into the complicated relational architectures of the world we inhabit. We provide a first specific study of neighbourhood degree sequences in…
We study the higher (or sequential) topological complexity $\mathrm{TC}_s$ of manifolds with abelian fundamental group. We give sufficient conditions for $\mathrm{TC}_s$ to be non-maximal in both the orientable and non-orientable cases. In…
A common approach for describing classes of functions and probability measures on a topological space $\mathcal{X}$ is to construct a suitable map $\Phi$ from $\mathcal{X}$ into a vector space, where linear methods can be applied to address…
For any simplicial complex $X$ with a total ordering of its vertices, one can construct a chain complex $\mathbb{L}_\bullet(X)$ generated by necklaces of simplices in $X$, which computes the homology of the free loop space of the geometric…
A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an {\it opportunity…