Related papers: Optimal corrector estimates on percolation cluster…
We consider the random cluster model with parameter $q<1$, for which the FKG inequalities are not valid. On the square lattice, stochastic comparison with Bernoulli percolation implies that the model is subcritical (respectively…
In this paper, we analyze the capacity of super-resolution of one-dimensional positive sources. In particular, we consider the same setting as in [arXiv:1904.09186v2 [math.NA]] and generalize the results there to the case of super-resolving…
We present percolation thresholds calculated numerically with the eigenvalue formulation of the method of critical polynomials; developed in the last few years, it has already proven to be orders of magnitude more accurate than traditional…
This paper studies growth, percolation, and correlations in disordered fiber networks. We start by introducing a 2D continuum deposition model with effective fiber-fiber interactions represented by a parameter $p$ which controls the degree…
Consider nearest-neighbor oriented percolation in $d+1$ space-time dimensions. Let $\rho,\eta,\nu$ be the critical exponents for the survival probability up to time $t$, the expected number of vertices at time $t$ connected from the…
This paper derives an a posteriori error estimator for the nonlinear first-order optimality conditions associated with the electrically and flexoelectrically coupled Frank-Oseen model of liquid crystals, building on previous results for…
High-mass diffractive production of protons on the deuteron target is studied in the perturbative QCD in the BFKL approach. Leading order rearrangement contribution and the standard triple pomeron (the impulse approximation) are studied. In…
We study the number $N\_n$ of open paths of length $n$ in supercritical oriented percolation on $\Zd \times \N$, with $d \ge 1$. We prove that on the percolation event $\{\inf N\_n\textgreater{}0\}$, $N\_n^{1/n}$ almost surely converges to…
We extend approximate next-to-next-to-leading order results for top-pair production to include the semi-leptonic decays of top quarks in the narrow-width approximation. The new hard-scattering kernels are implemented in a fully differential…
The issue of single-grid discretization error estimator, operating in the postprocessor mode, is addressed in the paper. An ensemble of numerical solutions, obtained using solvers of different accuracy, is shown to provide an upper estimate…
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete $H^1$ norm best approximation error…
A normalized batch gradient descent optimizer is proposed to improve the first-order regular perturbation coefficients of the Manakov equation, often referred to as kernels. The optimization is based on the linear parameterization offered…
Internal Diffusion Limited Aggregation (IDLA) is a model that describes the growth of a random aggregate of particles from the inside out. Shellef proved that IDLA processes on supercritical percolation clusters of integer-lattices fill…
A two parameter percolation model with nucleation and growth of finite clusters is developed taking the initial seed concentration \rho and a growth parameter g as two tunable parameters. Percolation transition is determined by the final…
In this work we consider the steady state scaling behavior of directed percolation around the upper critical dimension. In particular we determine numerically the order parameter, its fluctuations as well as the susceptibility as a function…
We consider bond and site Bernoulli Percolation in both the oriented and the non-oriented cases on $\mathbb{Z}^d$ and obtain rigorous upper bounds for the critical points in those models for every dimension $d \geq 3$.
For percolating systems, we propose a universal exponent relation connecting the leading corrections to scaling of the cluster size distribution with the dynamic corrections to the asymptotic transport behaviour at criticality. Our…
Optimal control problems are inherently hard to solve as the optimization must be performed simultaneously with updating the underlying system. Starting from an initial guess, Howard's policy improvement algorithm separates the step of…
In many statistical linear inverse problems, one needs to recover classes of similar curves from their noisy images under an operator that does not have a bounded inverse. Problems of this kind appear in many areas of application.…
We consider the further development of the formalism of the estimates of higher-order perturbative corrections in the Euclidean region, which is based on the application of the scheme-invariant methods, namely the principle of minimal…