Related papers: Optimization of random high-dimensional functions:…
We consider two non-mean-field models of structural glasses built on a hierarchical lattice. First, we consider a hierarchical version of the random energy model (HREM), and we prove the existence of the thermodynamic limit and…
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size $n$ distributed among the leaves of a balanced hierarchically separated tree. We consider {\it monochromatic} and…
What is the effectiveness of local search algorithms for geometric problems in the plane? We prove that local search with neighborhoods of magnitude $1/\epsilon^c$ is an approximation scheme for the following problems in the Euclidian…
We study random constraint satisfaction problems (CSPs) in the unsatisfiable regime. We relate the structure of near-optimal solutions for any Max-CSP to that for an associated spin glass on the hypercube, using the Guerra-Toninelli…
A general concept for the derivation of symmetry-based pseudo spin Hamiltonians is described. It systematically bridges the gap between the atomistic basis and various pseudo spin models presented in literature. It thus allows the…
We review the results of several of our papers about the procedure of extension of Hamiltonians, allowing the construction of families of superintegrable systems with non-trivial polynomial first integrals (or symmetry operators) of…
We investigate the relationship between algorithmic fractal dimensions and the classical local fractal dimensions of outer measures in Euclidean spaces. We introduce global and local optimality conditions for lower semicomputable outer…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We consider the problem of estimating the maximal energy of quantum $p$-local spin glass random Hamiltonians, the quantum analogues of widely studied classical spin glass models. Denoting by $E^*(p)$ the (appropriately normalized) maximal…
We establish a connection between the cascading of gluon momenta modeled with the diffusive approximation of the Balitsky-Fadin-Kuraev-Lipatov kernel and the thermodynamics of directed polymers on a tree with disorder. Using known results…
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…
In the critical beta-splitting model of a random $n$-leaf binary tree, leaf-sets are recursively split into subsets, and a set of $m$ leaves is split into subsets containing $i$ and $m-i$ leaves with probabilities proportional to…
In this paper, we study the optimal transport problem induced by separable cost functions. In this framework, transportation can be expressed as the composition of two lower-dimensional movements. Through this reformulation, we prove that…
We provide efficient constant factor approximation algorithms for the problems of finding a hierarchical clustering of a point set in any metric space, minimizing the sum of minimimum spanning tree lengths within each cluster, and in the…
Zeros of the $n$th moment of the partition function $[Z^n]$ are investigated in a vanishing temperature limit $\beta \to \infty$, $n \to 0$ keeping $y=\beta n \sim O(1)$. In this limit, the moment parameterized by $y$ characterizes the…
In this paper, we investigate the finite connectivity spin-glass problem. Our work is focused on the expansion around the point of infinite connectivity of the free energy of a spin glass on a graph with Poissonian distributed connectivity:…
A basic issue in optimization, inverse theory,neural networks, computational chemistry and many other problems is the geometrical characterization of high dimensional functions. In inverse calculations one aims to characterize the set of…
We introduce heap automata, a formalism for automatic reasoning about robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability,…
By numerical simulations of the $3d$ Ising spin glass we find evidence that spontaneous replica symmetry breaking theory and not the droplet model describes with good accuracy the equilibrium behavior of the system.