Related papers: Reconstruction of symmetric Potts Models

The Stochastic Block Model (SBM) is a widely used random graph model for networks with communities. Despite the recent burst of interest in recovering communities in the SBM from statistical and computational points of view, there are still…

We note that it is possible to construct a bond vertex model that displays q-state Potts criticality on an ensemble of phi3 random graphs of arbitrary topology, which we denote as ``thin'' random graphs in contrast to the fat graphs of the…

We obtain the exact scale invariant scattering solutions for two-dimensional field theories with replicated permutational symmetry $\mathbb{S}_q$. After sending to zero the number of replicas they correspond to the renormalization group…

This paper is concerned with estimating the intersection point of two densities, given a sample of both of the densities. This problem arises in classification theory. The main results provide lower bounds for the probability of the…

Background: The reconstruction of the phylogenetic tree topology of four taxa is, still nowadays, one of the main challenges in phylogenetics. Its difficulties lie in considering not too restrictive evolutionary models, and correctly…

In order to study in a regularisation free manner the renormalisability of d=2 supersymmetric non-linear $\si$ models, one has to use the algebraic BRS methods ; moreover, in the absence of an off-shell formulation, one has often to deal…

We give the first {\sl reconstruction algorithm} for decision trees: given queries to a function $f$ that is $\mathrm{opt}$-close to a size-$s$ decision tree, our algorithm provides query access to a decision tree $T$ where: $\circ$ $T$ has…

In this paper we study asymptotic properties of random forests within the framework of nonlinear time series modeling. While random forests have been successfully applied in various fields, the theoretical justification has not been…

A fundamental theoretical question in network analysis is to determine under which conditions community recovery is possible in polynomial time in the Stochastic Block Model (SBM). When the number $K$ of communities remains smaller than…

This paper is motivated by the reconstruction problem on the sparse stochastic block model. Mossel, et. al. proved that a reconstruction algorithm that recovers an optimal fraction of the communities in the symmetric, 2-community case. The…

The intent of this paper is to describe the large scale asymptotic geometry of iteration stable (STIT) tessellations in $\mathbb{R}^d$, which form a rather new, rich and flexible class of random tessellations considered in stochastic…

We summarise the recent theoretical progress in few-body descriptions of the piNN system. Previous descriptions, both three- and four-dimensional, are shown to possess serious theoretical inconsistencies. We illustrate how three-dimensional…

We develop a formalism for performing real space renormalization group transformations of the "decimation type" using perturbation theory. The type of transformations beyond $d=1$ is nontrivial even for free theories. We check the formalism…

For a 3-manifold $M$ with boundary, we study the Kauffman module with indeterminate equal to $-1+\epsilon$ where $\epsilon^2=0$. We conjecture an explicit relation between this module and the Reidemeister torsion of $M$ which we prove in…

We construct supersymmetric conformal sigma models in three dimensions. Nonlinear sigma models in three dimensions are nonrenormalizable in perturbation theory. We use the Wilsonian renormalization group equation method, which is one of the…

The Nelson-Seiberg theorem dictates conditions for the spontaneous breaking of the supersymmetry in Wess-Zumino models with generic, possibly non-renormalizable, superpotential; the existence of the R-symmetry is necessary while the…

We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is…

Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees there exists a larger tree (called a supertree) that contains the topologies of all k input…

Motivated by the algorithmic study of 3-dimensional manifolds, we explore the structural relationship between the JSJ decomposition of a given 3-manifold and its triangulations. Building on work of Bachman, Derby-Talbot and Sedgwick, we…

We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…