Related papers: The Kesten-Stigum Reconstruction Bound Is Tight fo…
Random instances of Constraint Satisfaction Problems (CSP's) appear to be hard for all known algorithms, when the number of constraints per variable lies in a certain interval. Contributing to the general understanding of the structure of…
We consider the problem of reconstructing binary images from their horizontal and vertical projections. For any reconstruction we define the length of the boundary of the image. In this paper we assume that the projections are monotone, and…
We consider the problem of reconstructing binary images from their horizontal and vertical projections. We present a condition that the projections must necessarily satisfy when there exist two disjoint reconstructions from those…
Replica symmetry breaking postulates that near optima of spin glass Hamiltonians have an ultrametric structure. Namely, near optima can be associated to leaves of a tree, and the Euclidean distance between them corresponds to the distance…
We study the natural problem of Triplet Reconstruction (also Rooted Triplets Consistency or Triplet Clustering), originally motivated in computational biology and relational databases (Aho, Sagiv, Szymanski, and Ullman, 1981): given $n$…
Understanding the glassy nature of neural networks is pivotal both for theoretical and computational advances in Machine Learning and Theoretical Artificial Intelligence. Keeping the focus on dense associative Hebbian neural networks, the…
Two, replica symmetry breaking specific, quantities of the Ising spin glass --- the breakpoint x1 of the order parameter function and the Almeida-Thouless line --- are calculated in six dimensions (the upper critical dimension of the…
While in the fully-connected limit the solution of the spin-glass model is known, with the existence of a complex transition on a critical line in the temperature-external field phase diagram, in finite dimensions we don't know if a…
We prove the impossibility of recent attempts to decouple the Replica Symmetry Breaking (RSB) picture for finite-dimensional spin glasses from the existence of many thermodynamic (i.e., infinite-volume) pure states while preserving another…
A \emph{binary tanglegram} is a drawing of a pair of rooted binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential…
We study the weak recovery problem on the $r$-uniform hypergraph stochastic block model ($r$-HSBM) with two balanced communities. In this model, $n$ vertices are randomly divided into two communities, and size-$r$ hyperedges are added…
This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these…
We study the community detection problem in the non-uniform hypergraph stochastic block model (HSBM), where hyperedges of varying sizes coexist. This setting captures higher-order and multi-view interactions and raises a fundamental…
We consider the problem of clustering (or reconstruction) in the stochastic block model, in the regime where the average degree is constant. For the case of two clusters with equal sizes, recent results by Mossel, Neeman and Sly, and by…
We show that, contrary to popular belief, non only diffraction-free beams may reconstruct themselves after hitting an opaque obstacle but also, for example, Gaussian beams. We unravel the mathematics and the physics underlying the…
We discuss how the Gross-Siebert reconstruction theorem applies to the local mirror symmetry of Chiang, Klemm, Yau and Zaslow. The reconstruction theorem associates to certain combinatorial data a degeneration of (log) Calabi-Yau varieties.…
We perform the replica symmetry breaking (RSB) in the vicinity of the point of instability of the replica symmetric solution in the model of axial quadrupolar glass. It is shown that the solution with the first stage RSB is stable against…
We consider mean-field vector spin glasses with possibly non-convex interactions. Up to a small perturbation of the parameters defining the model, the asymptotic behavior of the Gibbs measure is described in terms of a critical point of an…
We study the weak recovery problem on the $r$-uniform hypergraph stochastic block model ($r$-HSBM) with two balanced communities. In HSBM a random graph is constructed by placing hyperedges with higher density if all vertices of a hyperedge…
The sequence reconstruction problem for insertion/deletion channels has attracted significant attention owing to their applications recently in some emerging data storage systems, such as racetrack memories, DNA-based data storage. Our goal…