We develop parametric classes of covariance functions on linear networks and their extension to graphs with Euclidean edges, that is, graphs with edges viewed as line segments or more general sets ...

We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, ...

The statistical physics of graphs and partition functions represents a vibrant intersection of graph theory, statistical mechanics and computational complexity. By summing over an ensemble of ...

For some of my current projects, I'm probably going to need to eventually estimate some models using Metropolis-Hastings sampling. I understand the basic concepts, and the software I use (R) has ...