Related papers: KMS states, conformal measures and ends in digraph…
We study systems of {\sigma}-algebras ordered by refinement and introduce the notion of an endogenous probability measure, invariant under admissible refinement transformations. We prove existence and structural properties of such measures…
We review the state approach to toss juggling and extend the approach to spin juggling, a new concept. We give connections to current research on random juggling and describe a professional-level juggling performance that further…
Let $\varphi:X\to X$ be a homeomorphism of a compact metric space $X$. For any continuous function $F:X\to \mathbb{R}$ there is a one-parameter group $\alpha^{F}$ of automorphisms on the crossed product $C^*$-algebra…
We present a detailed exposition (for a Dynamical System audience) of the content of the paper: R. Exel and A. Lopes, $C^*$ Algebras, approximately proper equivalence relations and Thermodynamic Formalism, {\it Erg. Theo. and Dyn. Syst.},…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…
We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…
The aim of this paper is to describe efficient algorithms for computing Maass waveforms on subgroups of the modular group PSL(2,Z) with general multiplier systems and real weight. A selection of numerical results obtained with these…
Measurement plays a quintessential role in the control of quantum systems. Beyond initialization and readout which pertain to projective measurements, weak measurements in particular, through their back-action on the system, may enable…
Complex networks are universal, arising in fields as disparate as sociology, physics, and biology. In the past decade, extensive research into the properties and behaviors of complex systems has uncovered surprising commonalities among the…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Knowledge graph reasoning (KGR), aiming to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs), has become a fast-growing research direction. It has been proven to significantly benefit the…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…
A dynamical system of points moving along the edges of a graph could be considered as a geometrical discrete dynamical system or as a discrete version of a quantum graph with localized wave packets. We study the set of such systems over…
Transport and mixing processes in fluid flows can be studied directly from Lagrangian trajectory data, such as obtained from particle tracking experiments. Recent work in this context highlights the application of graph-based approaches,…
We study new relations between countable iterated function systems (IFS) with overlaps, Smale endomorphisms and random systems with complete connections. We prove that stationary measures for countable conformal IFS with overlaps and…
Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted…
We describe proper correspondences from graph C*-algebras to arbitrary C*-algebras by K-theoretic data. If the target C*-algebra is a graph C*-algebra as well, we may lift an isomorphism on a certain invariant to correspondences back and…