Related papers: An efficient algorithm for solving elliptic proble…
We study a Dirichlet problem in the entire space for some nonlocal degenerate elliptic operators with internal nonlinearities. With very mild assumptions on the boundary datum, we prove existence and uniqueness of the solution in the…
We present a detailed description of the idea and procedure for the newly proposed Monte Carlo algorithm of tuning the critical point automatically, which is called the probability-changing cluster (PCC) algorithm [Y. Tomita and Y. Okabe,…
We study Bernoulli percolations on random lattices of the half-plane obtained as local limit of uniform planar triangulations or quadrangulations. Using the characteristic spatial Markov property or peeling process of these random lattices…
We solve the Dirichlet problem for $k$-Hessian equations on compact complex manifolds with boundary, given the existence of a subsolution. Our method is based on a second order a priori estimate of the solution on the boundary with a…
We present a perturbed subspace iteration algorithm to approximate the lowermost eigenvalue cluster of an elliptic eigenvalue problem. As a prototype, we consider the Laplace eigenvalue problem posed in a polygonal domain. The algorithm is…
In this paper we study the Perron method for solving the p-harmonic Dirichlet problem on the topologist's comb. For functions which are bounded and continuous at the accessible points, we obtain invariance of the Perron solutions under…
Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as "percolation of words". We give a positive answer to their Open Problem 2: almost surely, all…
A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical…
We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…
We consider long-range Bernoulli bond percolation on the $d$-dimensional hierarchical lattice in which each pair of points $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta\|x-y\|^{-d-\alpha})$, where $0<\alpha<d$ is…
We develop a new approach to the $L^p$ Dirichlet problem via $L^2$ estimates and reverse Holder inequalities. We apply this approach to second order elliptic systems and the polyharmonic equation on a bounded Lipschitz domain $\Omega$ in…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
In this note we set up the elliptic and the parabolic Dirichlet problem for linear nonlocal operators. As opposed to the classical case of second order differential operators, here the "boundary data" are prescribed on the complement of a…
We show that on a Cayley graph of a nonamenable group, almost surely the infinite clusters of Bernoulli percolation are transient for simple random walk, that simple random walk on these clusters has positive speed, and that these clusters…
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.
This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…
The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem. We observe that the previously known method for showing that…
We study the existence and the properties of solutions to the Dirichlet problem for uniformly elliptic second-order Hamilton-Jacobi-Bellman operators, depending on the principal eigenvalues of the operator.
We introduce a diffuse interface box method (DIBM) for the numerical approximation on complex geometries of elliptic problems with Dirichlet boundary conditions. We derive a priori $H^1$ and $L^2$ error estimates highlighting the r\^{o}le…
We consider the numerical solution of large-scale M-matrix algebraic Riccati equations with low-rank structures. We derive a new doubling iteration, decoupling the four original iteration formulae in the alternating-directional doubling…