Related papers: The aggregate path coupling method for the Potts m…

The paper presents some bipartite graph $L_{k,n}$, so called $(k,n)$-level graph, that arise by taking $k$-th and $(n-k)$-th levels of $n$-dimensional Boolean algebra. Two results are establised: (1) precise description of a distance (a…

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…

The Potts model has many applications. It is equivalent to some min-cut and max-flow models. Primal-dual algorithms have been used to solve these problems. Due to the special structure of the models, convergence proof is still a difficult…

Given a directed graph $G = (V, E)$, the $k$-path partition problem is to find a minimum collection of vertex-disjoint directed paths each of order at most $k$ to cover all the vertices of $V$. The problem has various applications in…

We examine the order of the phase transition in the Potts model by using the graph representation for the partition function, which allows treating a non-integer number of Potts states. The order of transition is determined by the analysis…

Let $S\subseteq V(G)$ and $\kappa_{G}(S)$ denote the maximum number $r$ of edge-disjoint trees $T_1, T_2, \cdots, T_r$ in $G$ such that $V(T_i)\bigcap V(T_{j})=S$ for any $i, j \in \{1, 2, \cdots, r\}$ and $i\neq j$. For an integer $k$ with…

We extend results on quadratic pressure and convergence of Gibbs mesures from previous joined work of the authors to the Curie-Weiss-Potts model. We define the notion of equilibrium state for the quadratic pressure and show that under some…

We find the asymptotic number of connected graphs with $k$ vertices and $k-1+l$ edges when $k,l$ approach infinity, reproving a result of Bender, Canfield and McKay. We use the {\em probabilistic method}, analyzing breadth-first search on…

In order to scale standard Gaussian process (GP) regression to large-scale datasets, aggregation models employ factorized training process and then combine predictions from distributed experts. The state-of-the-art aggregation models,…

Globally coupled doubling maps are studied in this paper. In this setting and for finitely many sites, two distinct bifurcation values of the coupling strength have been identified in the literature, corresponding to the emergence of…

Boundary critical phenomena are studied in the 3- State Potts model in 2 dimensions using conformal field theory, duality and renormalization group methods. A presumably complete set of boundary conditions is obtained using both fusion and…

Given the adjacency matrix of an undirected graph, we define a coupling of the spectral measures at the vertices, whose moments count the rooted closed paths in the graph. The resulting joint spectral measure verifies numerous interesting…

This paper presents a concise tutorial on spectral clustering for broad spectrum graphs which include unipartite (undirected) graph, bipartite graph, and directed graph. We show how to transform bipartite graph and directed graph into…

For given graphs $G$ and $H$, let $|Hom(G,H)|$ denote the set of graph homomorphisms from $G$ to $H$. We show that for any finite, $n$-regular, bipartite graph $G$ and any finite graph $H$ (perhaps with loops), $|Hom(G,H)|$ is maximum when…

We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchings. We generalise a result of Robertson, Seymour and Thomas…

Our work concerns algorithms for an unweighted variant of Maximum Flow. In the All-Pairs Connectivity (APC) problem, we are given a graph $G$ on $n$ vertices and $m$ edges, and are tasked with computing the maximum number of edge-disjoint…

We discuss a general parametrization for vertices of quantum graphs and show, in particular, how the $\delta'_s$ and $\delta'$ coupling at an $n$ edge vertex can be approximated by means of $n+1$ couplings of the $\delta$ type provided the…

In the present paper we obtain rates of convergence for the limit theorems of the density vector in the Curie-Weiss-Potts model via Stein's Method of exchangeable pairs. Our results include Kolmogorov bounds for multivariate normal…

We study the bond percolation problem in random graphs of $N$ weighted vertices, where each vertex $i$ has a prescribed weight $P_i$ and an edge can connect vertices $i$ and $j$ with rate $P_iP_j$. The problem is solved by the $q\to 1$…

We introduce a new method to generate duality relations for correlation functions of the Potts model on planar graphs. The method extends previously known results, by allowing the consideration of the correlation function for arbitrarily…