Related papers: Logarithmic corrections in (4+1)-dimensional direc…
This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of…
We review some of the recent progress on the scaling limit of two-dimensional critical percolation; in particular, the convergence of the exploration path to chordal SLE(6) and the "full" scaling limit of cluster interface loops. The…
I consider a one dimensional system of particles which interact through a hard core of diameter $\si$ and can connect to each other if they are closer than a distance $d$. The mean cluster size increases as a function of the density $\rho$…
The first part of this report describes the following result that, logarithmic approximation factor for hard capacitated set cover can be achieved from Wolsey's work [9], using a simpler and more intuitive analysis. We further show in our…
The concept of midpoint percolation has recently been applied to characterize the double percolation transitions in negatively curved structures. Regular $d$-dimensional hypercubic lattices are in the present work investigated using the…
The standard approximation of a natural logarithm in statistical analysis interprets a linear change of \(p\) in \(\ln(X)\) as a \((1+p)\) proportional change in \(X\), which is only accurate for small values of \(p\). I suggest…
Hyperbolic lattices interpolate between finite-dimensional lattices and Bethe lattices and are interesting in their own right with ordinary percolation exhibiting not one, but two, phase transitions. We study four constraint percolation…
In many areas of research it is interesting how lattices can be filled with particles that have no nearest neighbors, or they are in limited quantities. Examples may be found in statistical physics, chemistry, materials science, discrete…
We formulate the problem of probabilistic predictions of global failure in the simplest possible model based on site percolation and on one of the simplest model of time-dependent rupture, a hierarchical fiber bundle model. We show that…
Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…
Various applications involve assigning discrete label values to a collection of objects based on some pairwise noisy data. Due to the discrete---and hence nonconvex---structure of the problem, computing the optimal assignment (e.g.~maximum…
Objective-The main purpose of this paper is to construct a distributed clustering algorithm such that each distributed cluster can perform the data accuracy at their respective cluster head node before data aggregation and transmit the data…
Theoretical attempts proposed so far to describe ordinary percolation processes on real-world networks rely on the locally tree-like ansatz. Such an approximation, however, holds only to a limited extent, as real graphs are often…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
Higher order scrambled digital nets are randomized quasi-Monte Carlo rules which have recently been introduced in [J. Dick, Ann. Statist., 39 (2011), 1372--1398] and shown to achieve the optimal rate of convergence of the root mean square…
We consider critical site percolation on the triangular lattice in the upper half-plane. Let $u_1, u_2$ be two sites on the boundary and $w$ a site in the interior of the half-plane. It was predicted by Simmons, Kleban and Ziff in a paper…
We consider the densities of clusters, at the percolation point of a two-dimensional system, which are anchored in various ways to an edge. These quantities are calculated by use of conformal field theory and computer simulations. We find…
We use invasion percolation to compute highly-accurate numerical values for bond and site percolation thresholds p_c on the hypercubic lattice Z^d for d = 4,,,,,13. We also compute the Fisher exponent tau governing the cluster size…
Macroscopic properties of heterogeneous media are frequently modelled by regular lattice models, which are based on a relatively small basic cluster of lattice sites. Here, we extend one of such models to any cluster's size kxk. We also…
Supervised learning with Earth observation inputs is often limited by the sparsity of high-quality labeled or in-situ measured data to use as training labels. With the abundance of geographic data products, in many cases there are variables…