Related papers: Parameter estimation in a subcritical percolation …
In this paper, we initiate the study of the vertex coloring problem of a graph in the semi streaming model. In this model, the input graph is defined by a stream of edges, arriving in adversarial order and any algorithm must process the…
Monte Carlo simulations of the 4d O(4) model in the broken phase are performed to determine the parameters of a resonance. The standard method for extracting them on the lattice is through L\"uscher's formula; recently a new method, based…
Monte Carlo simulations using entropic sampling to estimate the number of configurations of a given energy are a valuable alternative to traditional methods. We introduce {\it tomographic} entropic sampling, a scheme which uses multiple…
The percolation threshold for flow or conduction through voids surrounding randomly placed spheres is rigorously calculated. With large scale Monte Carlo simulations, we give a rigorous continuum treatment to the geometry of the…
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…
A mixture of experts models the conditional density of a response variable using a mixture of regression models with covariate-dependent mixture weights. We extend the finite mixture of experts model by allowing the parameters in both the…
We propose a new framework for how to use sequential Monte Carlo (SMC) algorithms for inference in probabilistic graphical models (PGM). Via a sequential decomposition of the PGM we find a sequence of auxiliary distributions defined on a…
An efficient simulation-based methodology is proposed for the rolling window estimation of state space models, called particle rolling Markov chain Monte Carlo (MCMC) with double block sampling. In our method, which is based on Sequential…
We study site- and bond-percolation on a class of lattices referred to as Lieb lattices. In two dimensions the Lieb lattice (LL) is also known as the decorated square lattice, or as the CuO$_2$ lattice; in three dimensions it can be…
We demonstrate that the recently proposed pruned-enriched Rosenbluth method PERM (P.~Grassberger, Phys.~Rev.~{\bf E 56} (1997) 3682) leads to very efficient algorithms for the folding of simple model proteins. We test it on several models…
In this work, we present a new algorithm to approximate the percolation centrality of every node in a graph. Such a centrality measure quantifies the importance of the vertices in a network during a contagious process. In this paper, we…
Several strategies have been recently proposed in order to improve Monte Carlo sampling efficiency using machine learning tools. Here, we challenge these methods by considering a class of problems that are known to be exponentially hard to…
A C-coloring of a hypergraph ${\cal H}=(X,{\cal E})$ is a vertex coloring $\varphi: X\to {\mathbb{N}}$ such that each edge $E\in{\cal E}$ has at least two vertices with a common color. The related parameter $\overline{\chi}({\cal H})$,…
We study statistical model checking of continuous-time stochastic hybrid systems. The challenge in applying statistical model checking to these systems is that one cannot simulate such systems exactly. We employ the multilevel Monte Carlo…
A range of percolation models of cluster systems of composites is discussed. In the models the parameters of the clusters of a substance and inner boundaries were obtained by the Monte Carlo method, and the possibility of affecting the…
Markov Chain Monte Carlo (MCMC) methods are employed to sample from a given distribution of interest, whenever either the distribution does not exist in closed form, or, if it does, no efficient method to simulate an independent sample from…
We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove…
The off-resonant hyperpolarizability is calculated using the dipole-free sum-over-stats expression from a randomly chosen set of energies and transition dipole moments that are forced to be consistent with the sum rules. The process is…
In the random $r$-neighbour bootstrap percolation process on a graph $G$, a set of initially infected vertices is chosen at random by retaining each vertex of $G$ independently with probability $p\in (0,1)$, and "healthy" vertices get…
Sequential Monte Carlo (SMC) methods are widely used to draw samples from intractable target distributions. Particle degeneracy can hinder the use of SMC when the target distribution is highly constrained or multimodal. As a motivating…