Related papers: Measure Theory on Graphs
We introduce a family of atomic measures on free groups generated by no-return random walks. These measures are shown to be very convenient for comparing "relative sizes" of subgroups, context-free and regular subsets (that, subsets…
A marked metric measure space (mmm-space) is a triple (X,r,mu), where (X,r) is a complete and separable metric space and mu is a probability measure on XxI for some Polish space I of possible marks. We study the space of all (equivalence…
Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold graphs by forbidden induced subgraphs. Other theorems…
Typed metagraphs are defined as hypergraphs with types assigned to hyperedges and their targets, and the potential to have targets of hyperedges connect to whole links as well as targets. Directed typed metagraphs (DTMGs) are introduced via…
The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are. Here it is shown how to extend that definition, and in particular the…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
We define a new integer invariant of a finite graph G, the freeness index, that measures the extent to which G can be embedded in the 3-sphere so that it and its subgraphs have ``simple" complements, i.e., complements which are homeomorphic…
The paper presents a general duality theory for vector measure spaces taking its origin in the author's papers written in the 1960s. The main result establishes a direct correspondence between the geometry of a measure in a vector space and…
We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…
The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…
This paper introduces some tools from graph theory and distributed consensus algorithms to construct an optimal, yet robust, hierarchical information sharing structure for large-scale decision making and control problems. The proposed…
Conditional independence and graphical models are well studied for probability distributions on product spaces. We propose a new notion of conditional independence for any measure $\Lambda$ on the punctured Euclidean space $\mathbb…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…
A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…
We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…
Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric symmetries in a drawing. In this paper, we design and…
In this book, we study Gromov's metric geometric theory on the space of metric measure spaces, based on the idea of concentration of measure phenomenon due to L\'evy and Milman. Although most of the details are omitted in the original…