Related papers: Graph W*-probability Theory
We consider the infinite directed graph with vertices the set of integers ...,-2,-1,0,1,2,... . Let v be a random variable taking either finite values or value "minus infinity". Consider random weights v(j,k), indexed by pairs (j,k) of…
We give a sufficient and necessary condition for a Praeger-Xu graph to be a Cayley graph.
We review the theory of Cheeger constants for graphs and quantum graphs and their present and envisaged applications.
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
We formulate Aubry-Mather theory for Hamiltonians/Lagrangians defined on graphs and discuss its relationship with weak KAM theory developed in [24].
Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review…
We study the class of edge-coloured graphs arising from the graph-theoretic representation of quantum photonic experiments that generate multipartite W-states. Abstracting away physical amplitudes and phases, we introduce W-state graphs:…
We introduce a new class of C^*-algebras, which is a generalization of both graph algebras and homeomorphism C^*-algebras. This class is very large and also very tractable. We prove the so-called gauge-invariant uniqueness theorem and the…
We give a definition of hypergraph C*-algebras. These generalize the well-known graph C*-algebras as well as ultragraph C*-algebras. In contrast to those objects, hypergraph C*-algebras are not always nuclear. We provide a number of…
A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this…
We show that the method to construct C^*-algebras from topological graphs, introduced in our previous paper, generalizes many known constructions. We give many ways to make new topological graphs from old ones, and study the relation of…
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…
This survey presents some combinatorial problems with number-theoretic flavor. Our journey starts from a simple graph coloring question, but at some point gets close to a dangerous territory of the Riemann Hypothesis. We will mostly focus…
Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…
The theory of graphons comes with a natural sampling procedure, which results in an inhomogeneous variant of the Erd\H{o}s--R\'enyi random graph, called $W$-random graphs. We prove, via the method of moments, a limit theorem for the number…
In the paper we consider a graph model of message passing processes and present a method verification of message passing processes. The method is illustrated by an example of a verification of sliding window protocol.
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…