Related papers: Matching with shift for one-dimensional Gibbs meas…

Let $G$ be a graph on $n$ vertices of maximum degree $\Delta$. We show that, for any $\delta > 0$, the down-up walk on independent sets of size $k \leq (1-\delta)\alpha_c(\Delta)n$ mixes in time $O_{\Delta,\delta}(k\log{n})$, thereby…

We characterise the convergence of the Gibbs sampler which samples from the joint posterior distribution of parameters and missing data in hierarchical linear models with arbitrary symmetric error distributions. We show that the convergence…

Let $G$ be a compact connected Lie group and $H$ a closed subgroup of $G$. Suppose the homogeneous space $G/H$ is effective and has dimension 3 or higher. Consider a $G$-invariant, symmetric, positive-semidefinite, nonzero (0,2)-tensor…

Gibbs samplers are popular algorithms to approximate posterior distributions arising from Bayesian hierarchical models. Despite their popularity and good empirical performances, however, there are still relatively few quantitative results…

Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum size of a matching of each of these types, whether some given…

We study the Maximum Balanced Biclique (MBB) problem: Given a bipartite graph $G$ with $n$ vertices on each side, find a balanced biclique in $G$ with maximum size. We give a polynomial-time $\left(\frac{n}{\widetilde{\Omega}\left((\log…

This paper presents an $O(\log\log \bar{d})$ round massively parallel algorithm for $1+\epsilon$ approximation of maximum weighted $b$-matchings, using near-linear memory per machine. Here $\bar{d}$ denotes the average degree in the graph…

It is known that if the underlying iterated function system satisfies the open set condition, then the upper box dimension of an inhomogeneous self-similar set is the maximum of the upper box dimensions of the homogeneous counterpart and…

Chaining algorithms aim to form a semi-global alignment of two sequences based on a set of anchoring local alignments as input. Depending on the optimization criteria and the exact definition of a chain, there are several $O(n \log n)$ time…

We study the numerical range of an $n\times n$ cyclic shift matrix, which can be viewed as the adjacency matrix of a directed cycle with $n$ weighted arcs. In particular, we consider the change in the numerical range if the weights are…

We analyze the Block Averaging Transformation applied to the two--dimensional Ising model in the uniqueness region. We discuss the Gibbs property of the renormalized measure and the convergence of renormalized potential under iteration of…

The damage spreading method (DS) provided a useful tool to obtain analytical results of the thermodynamics and stability of the 2D Ising model --amongst many others--, but it suffered both from ambiguities in its results and from large…

Let $G = (V,E)$ be a connected directed graph on $n$ vertices. Assign values from the set $\{1,2,\dots,n\}$ to the vertices of $G$ and update the values according to the following rule: uniformly at random choose a vertex and update its…

We are interested in Sobolev type inequalities and their relationship with concentration properties on higher dimensions. We consider unbounded spin systems on the d-dimensional lattice with interactions that increase slower than a…

A lattice system of interacting temperature loops, which is used in the Euclidean approach to describe equilibrium thermodynamic properties of an infinite system of interacting quantum particles performing anharmonic oscillations (quantum…

We consider the complex case of the so-called S-inequality. It concerns the behaviour of the Gaussian measures of dilations of convex and rotationally symmetric sets in C^n (rotational symmetry is invariance under the multiplication by…

Given two convex polygons $P$ and $Q$ with $n$ and $m$ edges, the maximum overlap problem is to find a translation of $P$ that maximizes the area of its intersection with $Q$. We give the first randomized algorithm for this problem with…

We consider models with nearest-neighbor interactions and with the set $[0,1]$ of spin values, on a Cayley tree of order $k\geq 1$. It is known that the "splitting Gibbs measures" of the model can be described by solutions of a nonlinear…

We study the problem of continuum percolation in infinite volume Gibbs measures for particles with an attractive pair potential, with a focus on low temperatures (large $\beta$). The main results are bounds on percolation thresholds…

In this paper, we show that the replica symmetry of the Gibbs measure of spherical spin systems is a property of the eigenvalue spacing at the edge of the interaction matrix. In particular, our interaction matrix has \textbf{two} large…