相关论文: Nonconventional averages along arithmetic progress…

Phase transitions are a central theme of statistical mechanics, and of probability more generally. Lattice spin models represent a general paradigm for phase transitions in finite dimensions, describing ferromagnets and even some fluids…

We describe a convergence acceleration technique for unconstrained optimization problems. Our scheme computes estimates of the optimum from a nonlinear average of the iterates produced by any optimization method. The weights in this average…

Let $e_v(n)$ denote the number of occurrences of a fixed pattern $v$ in the binary expansion of $n \in \mathbb{N}$. In this paper we study monochromatic arithmetic progressions in the class of binary words $(e_v(n) \bmod{2})_{n \geq 0}$,…

A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…

The behaviour of the mean Euler-Poincar\'{e} characteristic and mean Betti's numbers in the Ising model with arbitrary spin on $\mathbbm{Z}^2$ as functions of the temperature is investigated through intensive Monte Carlo simulations. We…

A system of linear equations $L$ over $\mathbb{F}_q$ is common if the number of monochromatic solutions to $L$ in any two-colouring of $\mathbb{F}_q^n$ is asymptotically at least the expected number of monochromatic solutions in a random…

Under a fourth order moment condition on the branching and a second order moment condition on the immigration mechanisms, we show that an appropriately scaled projection of a supercritical and irreducible continuous state and continuous…

In many data structure settings, it has been shown that using "double hashing" in place of standard hashing, by which we mean choosing multiple hash values according to an arithmetic progression instead of choosing each hash value…

Relative colour constancy is an essential requirement for many scientific imaging applications. However, most digital cameras differ in their image formations and native sensor output is usually inaccessible, e.g., in smartphone camera…

We study the repetition of patches in self-affine tilings in R^d. In particular, we study the existence and non-existence of arithmetic progressions. We first show that an arithmetic condition of the expansion map for a self-affine tiling…

In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…

After having introduced the notion of universality in statistical mechanics and its importance for our comprehension of the macroscopic behavior of interacting systems, I review recent progress in the understanding of the scaling limit of…

We develop the theory of the edge coloring of infinite lattice graphs, proving a necessary and sufficient condition for a proper edge coloring of a patch of a lattice graph to induce a proper edge coloring of the entire lattice graph by…

Given positive integers $n$ and $k$, a $k$-term semi-progression of scope $m$ is a sequence $(x_1,x_2,...,x_k)$ such that $x_{j+1} - x_j \in \{d,2d,\ldots,md\}, 1 \le j \le k-1$, for some positive integer $d$. Thus an arithmetic progression…

We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…

Statistical models are widely used for the investigation of complex system's behavior. Most of the models considered in the literature are formulated on regular lattices with nearest-neighbor interactions. The models with non-local…

We develop a statistical-mechanical formulation for image restoration and error-correcting codes. These problems are shown to be equivalent to the Ising spin glass with ferromagnetic bias under random external fields. We prove that the…

We analyze the $L^1$-mixing of a generalization of the Averaging process introduced by Aldous. The process takes place on a growing sequence of graphs which we assume to be finite-dimensional, in the sense that the random walk on those…

In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach…

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…