Related papers: Recovering the boundary path space of a topologica…

We show that the Hilbert bimodule associated to a compact topological graph can be recovered from the C*-algebraic triple consisting of the Toeplitz algebra of the graph, its gauge action and the commutative subalgebra of functions on the…

The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

We construct a locally compact Hausdorff topology on the path space of a finitely aligned $k$-graph $\Lambda$. We identify the boundary-path space $\partial\Lambda$ as the spectrum of a commutative $C^*$-subalgebra $D_\Lambda$ of…

Spatial graphs are particular graphs for which the nodes are localized in space (e.g., public transport network, molecules, branching biological structures). In this work, we consider the problem of spatial graph reduction, that aims to…

We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has been highly successful. But it was unclear how the original…

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

We construct a locally compact Hausdorff topology on the path space of a directed graph $E$, and identify its boundary-path space $\partial E$ as the spectrum of a commutative $C^*$-subalgebra $D_E$ of $C^*(E)$. We then show that $\partial…

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

We consider finite approximations of a topological space $M$ by noncommutative lattices of points. These lattices are structure spaces of noncommutative $C^*$-algebras which in turn approximate the algebra $\cc(M)$ of continuous functions…

We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…

We introduce a compactification construction for abstract quasi-local C*-algebras over countable metric spaces equipped with an isometric group action which is functorial with respect to bounded spread isomorphisms. In $1$D, the…

We introduce fibrewise compactifications in both the setting of locally compact Hausdorff spaces and continuous maps, and the parallel setting of $C^*$-algebras and nondegenerate multiplier-valued $*$-homomorphisms. In both situations, we…

This paper is intended as an introductory survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

Let $E = (E^0, E^1, r, s)$ be a topological graph with no sinks such that $E^0$ and $E^1$ are compact. We show that when $C^*(E)$ is finite, there is a natural isomorphism $C^*(E) \cong C(E^\infty) \rtimes \mathbb{Z}$, where $E^\infty$ is…

In this paper, two sufficient and necessary conditions are given. The first one characterizes when the boundary path groupoid of a topological graph without singular vertices has closed interior of its isotropy group bundle, and the second…

In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…

A communication network can be modeled as a directed connected graph with edge weights that characterize performance metrics such as loss and delay. Network tomography aims to infer these edge weights from their pathwise versions measured…