Related papers: Some Conditional Correlation Inequalities for Perc…
We find evidence for a continuum limit of a particular causal set dynamics which depends on only a single ``coupling constant'' $p$ and is easy to simulate on a computer. The model in question is a stochastic process that can also be…
Independent sets in graphs are sets of vertices containing no neighbors, and they represent a canonical spin system with hardcore constraints. Of particular interest is the setting of the boolean hypercube, where counting independent sets…
We introduce and study a new percolation model, inspired by recent works on jigsaw percolation, graph bootstrap percolation, and percolation in polluted environments. Start with an oriented graph $G_0$ of initially occupied edges on $n$…
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
The classical causal relations between a set of variables, some observed and some latent, can induce both equality constraints (typically conditional independences) as well as inequality constraints (Instrumental and Bell inequalities being…
It is suggested and demonstrated that two specific 2-dimensional correlation patterns, fixed-to-arbitrary bin and neighboring bin correlation patterns, are efficient for identifying various random multiplicative cascade processes. A…
Percolation theory dictates an intuitive picture depicting correlated regions in complex systems as densely connected clusters. While this picture might be adequate at small scales and apart from criticality, we show that highly correlated…
We show that there is a general, informative and reliable procedure for discovering causal relations when, for all the investigator knows, both latent variables and selection bias may be at work. Given information about conditional…
Following the approach outlined in [18], convergence to SLE6 of the Exploration Processes for the correlated bond-triangular type models studied in [7] is established. This puts the said models in the same universality class as the standard…
The classical definitions of the Incipient Infinite Cluster (IIC) of percolation consist in conditioning the origin on being connected to radius $n$ and letting $n$ go to infinity. We provide a short proof of that convergence in the planar…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
This paper concerns the assessment of the effects of actions from a combination of nonexperimental data and causal assumptions encoded in the form of a directed acyclic graph in which some variables are presumed to be unobserved. We provide…
Connectedness percolation phenomena in two-dimensional packings of elongated particles (discorectangles) were studied numerically. The packings were produced using random sequential adsorption (RSA) off-lattice model with preferential…
A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…
We study level-set percolation of the Gaussian free field on the infinite $d$-regular tree for fixed $d\geq 3$. Denoting by $h_\star$ the critical value, we obtain the following results: for $h>h_\star$ we derive estimates on conditional…
We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: First, we introduce the problem of correlation clustering…
In this paper we consider a discrete or continuous landscape with correlations and we consider a source of light (a sun) at infinity emitting parallel rays of light making a slope l with the horizontal plane. Depending on the value of l…
We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…
We provide an interpretation of entanglement based on classical correlations between measurement outcomes of complementary properties: states that have correlations beyond a certain threshold are entangled. The reverse is not true, however.…
Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of…