Related papers: The Kesten-Stigum Reconstruction Bound Is Tight fo…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…
We consider the problem of optimally insulating a given domain $\Omega$ of ${\mathbb{R}}^d$; this amounts to solve a nonlinear variational problem, where the optimal thickness of the insulator is obtained as the boundary trace of the…
Artificial Neural Networks (ANN) comprise important symmetry properties, which can influence the performance of Monte Carlo methods in Neuroevolution. The problem of the symmetries is also known as the competing conventions problem or…
An argument against tolerating finetuning in the Higgs sector is presented, by emphasizing the difference between (well understood) quantum corrections to scalar masses and the (unsolved) problem of the cosmological constant. I also point…
We analyze the relaxation to equilibrium for kinetically constrained spin models (KCSM) when the initial distribution $\nu$ is different from the reversible one, $\mu$. This setting has been intensively studied in the physics literature to…
We break the symmetry in classical spectral bi-partitioning in order to incentivise the alignment of directed cut edges. We use this to generate acyclic bi-partitions and furthermore topological orders of directed acyclic graphs with superb…
Phylogenetic trees and networks are graphs used to model evolutionary relationships, with trees representing strictly branching histories and networks allowing for events in which lineages merge, called reticulation events. While the…
The Steiner tree problem is one of the most prominent problems in network design. Given an edge-weighted undirected graph and a subset of the vertices, called terminals, the task is to compute a minimum-weight tree containing all terminals…
We study when geometric simplicity of decision boundaries, used here as a notion of interpretability, can conflict with accurate approximation of axis-aligned decision trees by shallow neural networks. Decision trees induce rule-based,…
The boundary rigidity problem is a classical question from Riemannian geometry: if $(M, g)$ is a Riemannian manifold with smooth boundary, is the geometry of $M$ determined up to isometry by the metric $d_g$ induced on the boundary…
In distance query reconstruction, we wish to reconstruct the edge set of a hidden graph by asking as few distance queries as possible to an oracle. Given two vertices $u$ and $v$, the oracle returns the shortest path distance between $u$…
In this thesis we investigate the Renormalization Group (RG) approach in finite-dimensional glassy systems, whose critical features are still not well-established, or simply unknown. We focus on spin and structural-glass models built on…
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…
In the coming years, strong gravitational lens discoveries are expected to increase in frequency by two orders of magnitude. Lens-modelling techniques are being developed to prepare for the coming massive influx of new lens data, and blind…
We consider a robust analog of the planted clique problem. In this analog, a set $S$ of vertices is chosen and all edges in $S$ are included; then, edges between $S$ and the rest of the graph are included with probability $\frac{1}{2}$,…
We introduce a mathematical framework based on simple combinatorial arguments (Kernel Representation) that allows to deal successfully with spin glass problems, among others. Let $\Omega^{N}$ be the space of configurations of an $N-$ spins…
The field theory of a short range spin glass with Gaussian random interactions, is considered near the upper critical dimension six. In the glassy phase, replica symmetry breaking is accompanied with massless Goldstone modes, generated by…
We derive an explicit distribution for the threshold sequence of the symmetric binary perceptron with Gaussian disorder, proving that the critical window is of constant width.
We derive all possible symmetry breaking patterns for all possible Higgs fields that can occur in intersecting brane models: bi-fundamentals and rank-2 tensors. This is a field-theoretic problem that was already partially solved in 1973 by…