Related papers: Correlations for the Novak process
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
We consider inhomogeneous percolation on a hierarchical configuration model with a heavy-tailed degree distribution. This graph is the configuration model where all the half-edges are colored either black or white, and edges are formed by…
The fluctuations of lozenge tilings of hexagons with one or several cuts (nonconvexities) along opposite sides are governed by the (discrete-continuous) tacnode kernel ${\mathbb L}^{\mbox{\tiny dTac}}$, upon letting the hexagon become very…
The reconnection process in the dynamics of cubic nontwist maps, introduced in [3], is studied. The present paper extends the work presented in [8]. As in that work, in order to describe the route to reconnection of the involved…
We present an iterative root finding method for harmonic mappings in the complex plane, which is a generalization of Newton's method for analytic functions. The complex formulation of the method allows an analysis in a complex variables…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…
We study the convergence properties of a general inertial first-order proximal splitting algorithm for solving nonconvex nonsmooth optimization problems. Using the Kurdyka--\L ojaziewicz (KL) inequality we establish new convergence rates…
We perform extensive Monte Carlo simulations of a two-dimensional bent hard-needle model in both its chiral zig-zag and its achiral bow-shape configurations and present their phase diagrams. We find evidence for a variety of stable phases:…
This paper concerns the cohomological aspects of Donaldson-Thomas theory for Jacobi algebras and the associated cohomological Hall algebra, introduced by Kontsevich and Soibelman. We prove the Hodge-theoretic categorification of the…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
The paper considers variable selection in linear regression models where the number of covariates is possibly much larger than the number of observations. High dimensionality of the data brings in many complications, such as (possibly…
In this paper, by combining the algorithm New Q-Newton's method - developed in previous joint work of the author - with Armijo's Backtracking line search, we resolve convergence issues encountered by Newton's method (e.g. convergence to a…
Given $n$ i.i.d. observations of a random vector $(X,Z)$, where $X$ is a high-dimensional vector and $Z$ is a low-dimensional index variable, we study the problem of estimating the conditional inverse covariance matrix $\Omega(z) =…
Kontsevich's work on Airy matrix integrals has led to explicit results for the intersection numbers of the moduli space of curves. In this article we show that a duality between k-point functions on $N\times N$ matrices and N-point…
We search for new superhard B-N-O compounds with an iterative machine learning (ML) procedure, where ML models are trained using sample crystal structures from evolutionary algorithm. We first use cohesive energy to evaluate the…
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph A_n, or more generally calculating the sum of the weights…
In this article we define a generalization of the domino shuffling algorithm for tilings of the Aztec diamond to the interacting $k$-tilings recently introduced by S. Corteel, A. Gitlin, and the first author. We describe the algorithm both…
This paper is motivated by computing correlations for domino tilings of the Aztec diamond. It is inspired by two of the three distinct methods that have recently been used in the simplest case of a doubly periodic weighting, that is the…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…