Related papers: Generalised oriented site percolation

We present the geometric optics expansion for circularly polarized gravitational waves on a curved spacetime background, to subleading order. We call spin optics to the subleading order geometric optics expansion, which involves modifying…

The properties of the absorbing states of non-equilibrium models belonging to the conserved directed percolation universality class are studied. We find that at the critical point the absorbing states are hyperuniform, exhibiting…

We propose Okapi, a simple, efficient, and general method for robust semi-supervised learning based on online statistical matching. Our method uses a nearest-neighbours-based matching procedure to generate cross-domain views for a…

We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical…

Interpolation of sparse pixel information towards a dense target resolution finds its application across multiple disciplines in computer vision. State-of-the-art interpolation of motion fields applies model-based interpolation that makes…

There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close…

Let G be a planar graph with polynomial growth and isoperimetric dimension bigger than 1. Then the critical p for Bernoulli percolation on G satisfies p<1.

We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…

We consider two-dimensional percolation in the scaling limit close to criticality and use integrable field theory to obtain universal predictions for the probability that at least one cluster crosses between opposite sides of a rectangle of…

Crystals and other condensed phases are defined primarily by their inherent symmetries, which play a crucial role in dictating their structural properties. In crystallization studies, local order parameters (OPs) that describe bond…

Here we explore the geometry of the osculating spaces to projective varieties of arbitrary dimension. In particular, we classify varieties having very degenerate higher order osculating spaces and we determine mild conditions for the…

This work presents a unified framework that combines global approximations with locally built models to handle challenging nonconvex and nonsmooth composite optimization problems, including cases involving extended real-valued functions. We…

In this paper we analyze the problem of uniqueness for spacelike hypersurfaces with constant higher order mean curvature in generalized Robertson-Walker spacetimes. We consider first the case of compact spacelike hypersurfaces, completing…

This paper presents a Monte-Carlo study of percolation in a distorted square lattice, in which, the adjacent sites are not equidistant. Starting with an undistorted lattice, the position of the lattice sites are shifted through a tunable…

We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…

We describe in detail a new and highly efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation…

We study directed rigidity percolation (equivalent to directed bootstrap percolation) on three different lattices: square, triangular, and augmented triangular. The first two of these display a first-order transition at p=1, while the…

We propose a general analytical framework for single-facility continuous location problems under spatial demand uncertainty. In contrast to classical formulations based on discrete or regionally aggregated demands, the proposed model…

We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…

That most deep learning models are purely data driven is both a strength and a weakness. Given sufficient training data, the optimal model for a particular problem can be learned. However, this is usually not the case and so instead the…