Related papers: An efficient algorithm for solving elliptic proble…
We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the…
In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical…
We study spherically symmetric spacetimes for matter distributions with isotropic pressures. We generate new exact solutions to the Einstein field equations which also contains isotropic pressures. We develop an algorithm that produces a…
We consider the Bernoulli Boolean discrete percolation model on the d-dimensional integer lattice. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of…
Let $L$ be an infinitely degenerate second-order linear operator defined on a bounded smooth Euclidean domain. Under weaker conditions than those of H\"ormander, we show that the Dirichlet problem associated with $L$ has a unique smooth…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
We give a probabilistic representation of the solution to a semilinear elliptic Dirichlet problem with general (discontinuous) boundary data. The boundary behaviour of the solution is in the sense of the controlled convergence initiated by…
We generalize the standard site percolation model on the $d$-dimensional lattice to a model on random tessellations of $\mathbb R^d$. We prove the uniqueness of the infinite cluster by adapting the Burton-Keane argument…
We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…
The purpose of this article is to study extrapolation of solvability for boundary value problems of elliptic systems in divergence form on the upper half-space assuming De Giorgi type conditions. We develop a method allowing to treat each…
The invaded cluster approach is extended to 2D Potts model with annealed vacancies by using the random-cluster representation. Geometrical arguments are used to propose the algorithm which converges to the tricritical point in the…
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate the link between iterative decoding and classical…
We prove optimal quantitative estimates on the first-order correctors on supercritical percolation clusters: we show that they are bounded in $d\geq 3$ and have logarithmic growth in $d = 2$, in the sense of stretched exponential moments.…
We derive exact expressions for the excess number of clusters b and the excess cumulants b_n of a related quantity at the 2-D percolation point. High-accuracy computer simulations are in accord with our predictions. b is a finite-size…
In this paper, we introduce a novel parallel contact algorithm designed to run efficiently in High-Performance Computing based supercomputers. Particular emphasis is put on its computational implementation in a multiphysics finite element…
We present an extension of an algorithm for the classical scalar $p$-Laplace Dirichlet problem to the vector-valued $p$-Laplacian with mixed boundary conditions in order to solve problems occurring in shape optimization using a $p$-harmonic…
A robust, fast and accurate method for solving the Colebrook-like equations is presented. The algorithm is efficient for the whole range of parameters involved in the Colebrook equation. The computations are not more demanding than…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
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…