Related papers: Spatial mixing and approximation algorithms for gr…
We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…
We study the design of robust subexponential algorithms for classical connectivity problems on intersection graphs of similarly sized fat objects in $\mathbb{R}^d$. In this setting, each vertex corresponds to a geometric object, and two…
For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…
Many models for undirected graphs are based on factorizing the graph's adjacency matrix; these models find a vector representation of each node such that the predicted probability of a link between two nodes increases with the similarity…
We present a Weitz-type FPTAS for the ferromagnetic Ising model across the entire Lee--Yang zero-free region, without relying on the strong spatial mixing (SSM) property. Our algorithm is Weitz-type for two reasons. First, it expresses the…
We propose an association between the phase-space mixing level of a self-gravitating system and the indistinguishability of its constituents (stars or dark matter particles). This represents a refinement in the study of systems exhibiting…
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and can be easily parallelized. Based on an analysis of the…
We present a novel graph embedding space (i.e., a set of measures on graphs) for performing statistical analyses of networks. Key improvements over existing approaches include discovery of "motif-hubs" (multiple overlapping significant…
Bayesian nonparametric mixtures and random partition models are powerful tools for probabilistic clustering. However, standard independent mixture models can be restrictive in some applications such as inference on cell lineage due to the…
It has been shown by van den Berg and Steif that the sub-critical and critical Ising model on $\mathbb{Z}^d$ is a finitary factor of an i.i.d. process (ffiid), whereas the super-critical model is not. In fact, they showed that the latter is…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
\Graph similarity computation is an essential task in many real-world graph-related applications such as retrieving the similar drugs given a query chemical compound or finding the user's potential friends from the social network database.…
Spatial models for areal data are often constructed such that all pairs of adjacent regions are assumed to have near-identical spatial autocorrelation. In practice, data can exhibit dependence structures more complicated than can be…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
We study the Gibbs statistics of high-density hard-core configurations on a unit square lattice $\mathbb{Z}^2$, for a general Euclidean exclusion distance $D$. As a by-product, we solve the disk-packing problem on $\mathbb{Z}^2$ for disks…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
We give structured proofs for five mathematical propositions governing synchronous peer-to-peer computation on a finite grid graph embedded in $\mathbb{Z}^2$. Proposition 1 gives three lower bounds: a transport-work bound $\sum_i a_i \ell_i…
In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$,…
Spatiotemporal graph represents a crucial data structure where the nodes and edges are embedded in a geometric space and can evolve dynamically over time. Nowadays, spatiotemporal graph data is becoming increasingly popular and important,…
A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains…