Related papers: Harmonic analysis on graphs via Bratteli diagrams …
Generalized Bratteli diagrams with a countable set of vertices in every level are models for aperiodic Borel automorphisms. This paper is devoted to the description of all ergodic probability tail invariant measures on the path spaces of…
We propose the use of non-parametric, graph-based tests to assess the distributional balance of covariates in observational studies with multi-valued treatments. Our tests utilize graph structures ranging from Hamiltonian paths that connect…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…
In our study of electrical networks we develop two themes: finding explicit formulas for special classes of functions defined on the vertices of a transient network, namely monopoles, dipoles, and harmonic functions. Secondly, our interest…
The main goal of this paper is to build a measurable analogue to the theory of weighted networks on infinite graphs. Our basic setting is an infinite $\sigma$-finite measure space $(V, \mathcal B, \mu)$ and a symmetric measure $\rho$ on…
We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like construction, tailored to the…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…
This paper introduces graphemes for constructing and analyzing stochastic processes that describe the evolution of large dynamic graphs. Unlike graphons, which capture the static properties of dense graphs via exchangeability or subgraph…
We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows…
This paper proposes a framework to ensure the existence of dynamical system trajectories in the state space of labeled, weighted, and attributed graphs. The evolution of such a system exhibits hybrid behavior: discrete jumps affecting the…
For a Bratteli diagram $B$, we study the simplex $\mathcal{M}_1(B)$ of probability measures on the path space of $B$ which are invariant with respect to the tail equivalence relation. Equivalently, $\mathcal{M}_1(B)$ is formed by…
Graphs are irregular structures which naturally account for data integrity, however, traditional approaches have been established outside Signal Processing, and largely focus on analyzing the underlying graphs rather than signals on graphs.…
Graph signal processing (GSP) is a key tool for satisfying the growing demand for information processing over networks. However, the success of GSP in downstream learning and inference tasks is heavily dependent on the prior identification…
We study ergodic finite and infinite measures defined on the path space $X_B$ of a Bratteli diagram $B$ which are invariant with respect to the tail equivalence relation on $X_B$. Our interest is focused on measures supported by vertex and…
Networks and graphs provide a simple but effective model to a vast set of systems which building blocks interact throughout pairwise interactions. Unfortunately, such models fail to describe all those systems which building blocks interact…
A Bratteli diagram is a type of graph in which the vertices are split into finite subsets occupying an infinite sequence of levels, starting with a bottom level and moving to successively higher levels along edges connecting consecutive…
In this paper we propose and study a class of simple, nonparametric, yet interpretable measures of association between two random variables $X$ and $Y$ taking values in general topological spaces. These nonparametric measures -- defined…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…