Related papers: A simple algorithm to test for linking to Wilson l…
Assessing the convergence of a biomolecular simulation is an essential part of any computational investigation. This is because many important quantities (e.g., free energy differences) depend on the relative populations of different…
In recent years, many variants of percolation have been used to study network structure and the behavior of processes spreading on networks. These include bond percolation, site percolation, $k$-core percolation, bootstrap percolation, the…
Concolic testing is a popular dynamic validation technique that can be used for both model checking and automatic test case generation. We have recently introduced concolic testing in the context of logic programming. In contrast to…
Motivated by a computer science algorithm known as `linear probing with hashing' we study a new type of percolation model whose basic features include a sequential `dropping' of particles on a substrate followed by their transport via a…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
We predict that self-bound clusters of particles exist in the supercritical phase of simple fluids. These clusters, whose internal temperature is lower than the global temperature of the system, define a percolation line that starts at the…
Particle filters are broadly used to approximate posterior distributions of hidden states in state-space models by means of sets of weighted particles. While the convergence of the filter is guaranteed when the number of particles tends to…
Within a truncated determinant algorithm, two alternatives are discussed for including systematically the remaining ultraviolet modes. Evidence is presented that these modes are accurately described by an effective action involving only…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
We present the loop algorithm, a new type of cluster algorithm that we recently introduced for the F model. Using the framework of Kandel and Domany, we show how to GENERALIZE the algorithm to the arrow flip symmetric 6 vertex model. We…
Epidemiologists use a variety of statistical algorithms for the early detection of outbreaks. The practical usefulness of such methods highly depends on the trade-off between the detection rate of outbreaks and the chances of raising a…
Standard agglomerative clustering suggests establishing a new reliable linkage at every step. However, in order to provide adaptive, density-consistent and flexible solutions, we study extracting all the reliable linkages at each step,…
Correlation clustering is a widely-used approach for clustering large data sets based only on pairwise similarity information. In recent years, there has been a steady stream of better and better classical algorithms for approximating this…
We consider percolation on interdependent locally treelike networks, recently introduced by Buldyrev et al., Nature 464, 1025 (2010), and demonstrate that the problem can be simplified conceptually by deleting all references to cascades of…
We introduce a new percolation model to describe and analyze the spread of an epidemic on a general directed and locally finite graph. We assign a two-dimensional random weight vector to each vertex of the graph in such a way that the…
Encodings or the proof of their absence are the main way to compare process calculi. To analyse the quality of encodings and to rule out trivial or meaningless encodings, they are augmented with quality criteria. There exists a bunch of…
In this communication with computer simulation we evaluate simple cubic random-site percolation thresholds for neighbourhoods including the nearest neighbours (NN), the next-nearest neighbours (2NN) and the next-next-nearest neighbours…
The present work proposes the concept of induced percolation over multiple-object systems, so that features such as the number of merged clusters can be used as a relevant measurement. The suggested approach involves the expansion of the…
Many cluster similarity indices are used to evaluate clustering algorithms, and choosing the best one for a particular task remains an open problem. We demonstrate that this problem is crucial: there are many disagreements among the…