Related papers: Harmonic analysis on graphs via Bratteli diagrams …
Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…
In this paper, we develop a theory of equipped graded graphs (or Bratteli diagrams) and an alternative theory of projective limits of finite-dimensional simplices. An equipment is an additional structure on the graph, namely, a system of…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
Bratteli-Vershik models have been very successfully applied to the study of various dynamical systems, in particular, in Cantor dynamics. In this paper, we study dynamics on the path spaces of generalized Bratteli diagrams that form models…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
The purpose of the paper is a general analysis of path space measures. Our focus is a certain path space analysis on generalized Bratteli diagrams. We use this in a systematic study of systems of self-similar measures (the term ``IFS…
This paper is a survey on general (simple and non-simple) Bratteli diagrams which focuses on the following topics: finite and infinite tail invariant measures on the path space $X_B$ of a Bratteli diagram $B$, existence of continuous…
Statistical physics models with hard constraints, such as the discrete hard-core gas model (random independent sets in a graph), are inherently combinatorial and present the discrete mathematician with a relatively comfortable setting for…
Bratteli diagrams with countably infinite levels exhibit a new phenomenon: they can be horizontally stationary. The incidence matrices of these horizontally stationary Bratteli diagrams are infinite banded Toeplitz matrices. In this paper,…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
The area of Data Analytics on graphs promises a paradigm shift as we approach information processing of classes of data, which are typically acquired on irregular but structured domains (social networks, various ad-hoc sensor networks).…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Hilbert-space fragmentation provides a mechanism for ergodicity breaking in quantum many-body systems even in the absence of disorder, leading to dynamically disconnected sectors and strong memory of initial conditions. However, identifying…
This paper presents bounds for the variation of the spectral radius $\lambda(G)$ of a graph $G$ after some perturbations or local vertex/edge modifications of $G$. The perturbations considered here are the connection of a new vertex with,…
We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…
We introduce a novel harmonic analysis for functions defined on the vertices of a strongly connected directed graph of which the random walk operator is the cornerstone. As a first step, we consider the set of eigenvectors of the random…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
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…