Related papers: The two-star model: exact solution in the sparse r…
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$,…
The two-dimensional (2D) XY model plays a crucial role in statistical and condensed matter physics. With the introduction of long-range interactions, the system exhibits a richer set of physical phenomena and a crossover between…
Convolutional network are the de-facto standard for analysing spatio-temporal data such as images, videos, 3D shapes, etc. Whilst some of this data is naturally dense (for instance, photos), many other data sources are inherently sparse.…
Social networks as a representation of relational data, often possess multiple types of dependency structures at the same time. There could be clustering (beyond homophily) at a macro level as well as transitivity (a friend's friend is more…
The Ising model is well-known for illustrating the fundamental characteristics of phase transitions in closed systems. In this article, we propose a generalization of the two-dimensional Ising model to open systems, considering the…
Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…
In a graph, a vertex dominates itself and its neighbors, and a dominating set is a set of vertices that together dominate the entire graph. Given a graph and two dominating sets of equal size $k$, the {\em Dominating Set Reconfiguration…
The evoSIR model is a modification of the usual SIR process on a graph $G$ in which $S-I$ connections are broken at rate $\rho$ and the $S$ connects to a randomly chosen vertex. The evoSI model is the same as evoSIR but recovery is…
We discuss striped phases as a state of matter intermediate between two extreme states: a crystalline state and a segregated state. We argue that this state is very sensitive to weak interactions, compared to those stabilizing a crystalline…
We study the survival/extinction phase transition for contact processes with quenched disorder. The disorder is given by a locally finite random graph with vertices indexed by the integers that is assumed to be invariant under index shifts…
Inspired by "quantum graphity" models for spacetime, a statistical model of graphs is proposed to explore possible realizations of emergent manifolds. Graphs with given numbers of vertices and edges are considered, governed by a very…
Hypergraphs model higher-order interactions, but realistic hypergraph generation remains difficult because incidence, hyperedge-size heterogeneity, and overlap structure are not faithfully captured by pairwise reductions. We propose \HEDGE,…
We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show that (i) there is a bounded-error randomized algorithm that computes edge connectivity with $O(n)$ cut queries, and (ii) there is a…
The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…
We propose two classes of dynamic versions of the classical Erd\H{o}s-R\'enyi graph: one in which the transition rates are governed by an external regime process, and one in which the transition rates are periodically resampled. For both…
Exponential random graph models, or ERGMs, are a flexible and general class of models for modeling dependent data. While the early literature has shown them to be powerful in capturing many network features of interest, recent work…
A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…
Phase behaviors of two-dimensional (2D) systems constitute a fundamental topic in condensed matter and statistical physics. Although hard polygons and interactive point-like particles are well studied, the phase behaviors of more realistic…
Transition points mark qualitative changes in the macroscopic properties of large complex systems. Explosive transitions, exhibiting properties of both continuous and discontinuous phase transitions, have recently been uncovered in network…
We study a blind deconvolution problem on graphs, which arises in the context of localizing a few sources that diffuse over networks. While the observations are bilinear functions of the unknown graph filter coefficients and sparse input…