Related papers: Random walks on simplicial complexes
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \textit{OCF}-vertices), simplicial paths, and their common…
Hodge Laplacians have been previously proposed as a natural tool for understanding higher-order interactions in networks and directed graphs. Here we introduce a Hodge-theoretic approach to spectral theory and dimensionality reduction for…
Incorporating higher-order interactions in information processing enables us to build more accurate models, gain deeper insights into complex systems, and address real-world challenges more effectively. However, existing methods, such as…
Separating multiple graph signals from a single observed mixture is an inherently ill-posed problem that traditionally relies on restrictive and handcrafted priors. This letter addresses this challenge by proposing an unsupervised learnable…
This paper is inspired by the problem of understanding in a mathematical sense the Liouville quantum gravity on surfaces. Here we show how to define a stationary random metric on self-similar spaces which are the limit of nice finite…
A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles…
Given a Poisson process on a $d$-dimensional torus, its random geometric simplicial complex is the complex whose vertices are the points of the Poisson process and simplices are given by the \u{C}ech complex associated to the coverage of…
The Laplacian matrix and its pseudo-inverse for a strongly connected directed graph is fundamental in computing many properties of a directed graph. Examples include random-walk centrality and betweenness measures, average hitting and…
We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…
We study linear equations in combinatorial Laplacians of $k$-dimensional simplicial complexes ($k$-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacians play a crucial role in homology and are a central tool in…
We introduce two exotic lattice models on a general spatial graph. The first one is a matter theory of a compact Lifshitz scalar field, while the second one is a certain rank-2 $U(1)$ gauge theory of fractons. Both lattice models are…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
The goal of this paper is to establish the fundamental tools to analyze signals defined over a topological space, i.e. a set of points along with a set of neighborhood relations. This setup does not require the definition of a metric and…
Determining whether an abstract simplicial complex, a discrete object often approximating a manifold, contains multi-dimensional holes is a task deeply connected to quantum mechanics and proven to be QMA1-hard by Crichigno and Kohler. This…
This paper provides a unified framework connecting dynamical systems with tools from topological data analysis and geometric topology and inspires new interactions among dynamical systems, topology, and nonlinear analysis. To this end, we…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…