Related papers: Graph codes and local systems

Learning the graph topology of a complex network is challenging due to limited data availability and imprecise data models. A common remedy in existing works is to incorporate priors such as sparsity or modularity which highlight on the…

Using intersection theory in the context of Hilbert manifolds and geometric homology we show how to recover the main operations of string topology built by M. Chas and D. Sullivan. We also study and build an action of the homology of…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

Locally checkable labeling problems (LCLs) form the foundation of the modern theory of distributed graph algorithms. First introduced in the seminal paper by Naor and Stockmeyer [STOC 1993], these are graph problems that can be described by…

In this work, which was inspired by the article [2] by M. V. Velasco and A. R. Villena, we obtain a characterization for probably continuous operators and show that the probability of a linear random operator being continuous coincides with…

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…

We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful bridge between network science and topology. Indeed, it has…

The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander…

In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter…

Tree codes, introduced by Schulman, are combinatorial structures essential to coding for interactive communication. An infinite family of tree codes with both rate and distance bounded by positive constants is called asymptotically good.…

We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose existence we prove using high dimensional expanders. The…

This note attempts to understand graph limits as defined by Lovasz and Szegedy (2006)} in terms of harmonic analysis on semigroups. This is done by representing probability distributions of random exchangeable graphs as mixtures of…

The neighborhood complex of a graph was introduced by Lov\'asz to provide topological lower bounds on chromatic number. More general homomorphism complexes of graphs were further studied by Babson and Kozlov. Such `Hom complexes' are also…

We define persistent homology groups over any set of spaces which have inclusions defined so that the corresponding directed graph between the spaces is acyclic, as well as along any subgraph of this directed graph. This method…

In this note, we show that the twisted Grassmann graph constructed by van Dam and Koolen is the block graph of the design constructed by Jungnickel and Tonchev. We also show that the full automorphism group of the design is isomorphic to…

In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…

Persistent homology (PH) has been widely applied to graph data to extract topological features. However, little attention has been paid to how different distance functions on a graph affect the resulting persistence barcodes and their…

Arone and Turchin defined graph-complexes computing the rational homotopy of the spaces of long embeddings. The graph-complexes split into a direct sum by the number of loops in graphs. In this paper we compute the homology of its two-loop…

Link prediction is an important learning task for graph-structured data. In this paper, we propose a novel topological approach to characterize interactions between two nodes. Our topological feature, based on the extended persistent…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…