Related papers: Amenability criterions and critical probabilities …
We consider a type of dependent percolation introduced by Aizenman and Grimmett, who showed that certain "enhancements" of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In…
Given a machine learning (ML) model and a prediction, explanations can be defined as sets of features which are sufficient for the prediction. In some applications, and besides asking for an explanation, it is also critical to understand…
For percolation on finite transitive graphs, Nachmias and Peres suggested a characterization of the critical probability based on the logarithmic derivative of the susceptibility. As a first test-case, we study their suggestion for the…
Reliability (survival analysis, to biostatisticians) is a key ingredient for mak- ing decisions that mitigate the risk of failure. The other key ingredient is utility. A decision theoretic framework harnesses the two, but to invoke this…
We study the interpretability of conditional probability estimates for binary classification under the agnostic setting or scenario. Under the agnostic setting, conditional probability estimates do not necessarily reflect the true…
In previous work ("Knowledge from Probability", TARK 2021) we develop a question-relative, probabilistic account of belief. On this account, what someone believes relative to a given question is (i) closed under entailment, (ii)…
Recently in Reference [ quant-ph/0202121] a computational criterion of separability induced by greatest cross norm is proposed by Rudolph. There, Rudolph conjectured that the new criterion is not weaker than positive partial transpose…
Consider a uniform expanders family G_n with a uniform bound on the degrees. It is shown that for any p and c>0, a random subgraph of G_n obtained by retaining each edge, randomly and independently, with probability p, will have at most one…
Inspired by Kesten's criterion for the amenability of groups, we establish a characterization of the amenability of discrete probability measure-preserving groupoids in terms of the operator norms of symmetric invariant Markov operators.
The main results of this note extend a theorem of Kesten for symmetric random walks on discrete groups to group extensions of topological Markov chains. In contrast to the result in probability theory, there is a notable asymmetry in the…
We consider Bernoulli bond percolation on the product graph of a regular tree and a line. Schonmann showed that there are a.s. infinitely many infinite clusters at $p=p_u$ by using a certain function $\alpha(p)$. The function $\alpha(p)$ is…
An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…
There exist many situations where an ordinary differential equation admits a movable critical singularity which the test of Kowalevski and Gambier fails to detect. Some possible reasons are: existence of negative Fuchs indices, insufficient…
Probability metrics constitute an important tool in probability theory and statistics \cite{DKS91}, \cite{R91}, \cite{Z83} as they are specific metrics on spaces of random variables which, by satisfying an extra condition, concord well with…
We prove that the value of the critical probability for percolation on an abelian Cayley graph is determined by its local structure. This is a partial positive answer to a conjecture of Schramm: the function pc defined on the set of Cayley…
Using the Kleisi category of the Giry monad the deterministic existential and universal quantifiers are generalized to incorporate nondeterminism. These probabilistic quantifiers are quantified over the points of the category which are…
The likelihood principle makes strong claims about the nature of statistical evidence but is controversial. Its claims are undermined by the existence of several examples that are assumed to show that it allows, with unity probability,…
Following H. Tomita and C. Murakami we propose an analytical model to predict critical probability of percolation. It is based on the excursion set theory which allows us to consider N-dimensional bounded regions. Details are given for the…
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
This paper relates comparative belief structures and a general view of belief management in the setting of deductively closed logical representations of accepted beliefs. We show that the range of compatibility between the classical…