Related papers: Crossing estimates for the Ising model on general …
We write exact renormalization-group recursion relations for nearest-neighbor ferromagnetic Ising models on Migdal-Kadanoff hierarchical lattices with a distribution of aperiodic exchange interactions according to a class of substitutional…
The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London…
The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition…
The Ising model is a celebrated example of a Markov random field, introduced in statistical physics to model ferromagnetism. This is a discrete exponential family with binary outcomes, where the sufficient statistic involves a quadratic…
We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…
This article investigates the asymptotic distribution of penalized estimators with non-differentiable penalties designed to recover low-dimensional pattern structures. Patterns play a central role in estimation, as they reveal the…
We study cross-graph charging schemes for graphs drawn in the plane. These are charging schemes where charge is moved across vertices of different graphs. Such methods have been recently applied to obtain various properties of…
We assume the direct sum <A> o <B> for the signal subspace. As a result of post- measurement, a number of operational contexts presuppose the a priori knowledge of the LB -dimensional "interfering" subspace <B> and the goal is to estimate…
The Russo-Seymour-Welsh Theorem for Z^2 bond or T (triangular lattice) site percolation states that at criticality, for all fixed real {\lambda}, the probability of the existence of a horizontal occupied crossing of each rectangle with size…
Kernel methods are learning algorithms that enjoy solid theoretical foundations while suffering from important computational limitations. Sketching, which consists in looking for solutions among a subspace of reduced dimension, is a well…
The Furstenberg-S\'ark\"ozy theorem asserts that the difference set $E-E$ of a subset $E \subset \mathbb{N}$ with positive upper density intersects the image set of any polynomial $P \in \mathbb{Z}[n]$ for which $P(0)=0$. Furstenberg's…
Let $\M$ be a smooth connected non-compact manifold endowed with a smooth measure $\mu$ and a smooth locally subelliptic diffusion operator $L$ satisfying $L1=0$, and which is symmetric with respect to $\mu$. We show that if $L$ satisfies,…
It is well known that if the power spectral density of a continuous time stationary stochastic process does not have a compact support, data sampled from that process at any uniform sampling rate leads to biased and inconsistent spectrum…
This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…
Bauschke and Moursi have recently obtained results that implicitly contain the fact that the composition of finitely many averaged mappings on a Hilbert space that have approximate fixed points also has approximate fixed points and thus is…
The planar-diagrammatic technique of large-$N$ random matrices is extended to evaluate averages over the circular ensemble of unitary matrices. It is then applied to study transport through a disordered metallic ``grain'', attached through…
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse and compressible signals. Many recovery algorithms are known to…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
Experimental data from Dunfield et al using random grid diagrams suggests that the genus of a knot grows linearly with respect to the crossing number. Using billiard table diagrams of Chebyshev knots developed by Koseleff and Pecker and a…
We consider the one-dimensional Littlewood-Offord problem for general Ising models. More precisely, we consider the concentration function \[Q_n(x,v)=P\left(\sum_{i=1}^{n}\varepsilon_iv_i\in(x-1,x+1)\right),\] where $x\in\mathbb{R}$,…