Related papers: Amenability criterions and critical probabilities …
In 1999, Benjamini, Lyons, Peres, and Schramm introduced a notion of weighted-amenability for transitive graphs that is equivalent to the amenability of its automorphism group. For unimodular graphs this notion coincides with classical…
We describe characteristic physical properties of the recently introduced class of deconfined quantum critical points. Using some simple models, we highlight observables which clearly distinguish such critical points from those described by…
We answer a question of Ahlberg and Steif (2014) by finding the tail behaviour of the crossing probability in near-critical planar percolation. Interestingly, this superexponentially small behaviour is different from the case of dynamical…
In the interpretation of experimental data, one is actually looking for plausible explanations. We look for a measure of plausibility, with which we can compare different possible explanations, and which can be combined when there are…
The PCP Theorem is one of the most stunning results in computational complexity theory, a culmination of a series of results regarding proof checking it exposes some deep structure of computational problems. As a surprising side-effect, it…
When studying convergence of measures, an important issue is the choice of probability metric. In this review, we provide a summary and some new results concerning bounds among ten important probability metrics/distances that are used by…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
Conditions for positive and polynomial recurrence have been proposed for a class of reliability models of two elements with transitions from working state to failure and back. As a consequence, uniqueness of stationary distribution of the…
In [1], Sinopoli et al. analyze the problem of optimal estimation for linear Gaussian systems where packets containing observations are dropped according to an i.i.d. Bernoulli process, modeling a memoryless erasure channel. In this case…
The explicit criteria for several types of ergodicity of one-dimensional diffusions or birth-death processes have been found out recently in a surprisingly short period. One of the criteria is for exponential ergodicity of birth-death…
We are interested in the recursive model $(Y_n, \, n\ge 0)$ studied by Collet, Eckmann, Glaser and Martin [9] and by Derrida and Retaux [12]. We prove that at criticality, the probability ${\bf P}(Y_n>0)$ behaves like $n^{-2 + o(1)}$ as $n$…
In a new type of percolation phase transition, which was observed in a set of non-equilibrium models, each new connection between vertices is chosen from a number of possibilities by an Achlioptas-like algorithm. This causes preferential…
We describe the fundamental constructions and properties of determinantal probability measures and point processes, giving streamlined proofs. We illustrate these with some important examples. We pose several general questions and…
In this paper, we shall prove that the irreducibility in the sense of fine topology implies the uniqueness of invariant probability measures. It is also proven that this irreducibility is strictly weaker than the strong Feller property plus…
Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…
The methods of conformal field theory are used to compute the crossing probabilities between segments of the boundary of a compact two-dimensional region at the percolation threshold. These probabilities are shown to be invariant not only…
We develop a phenomenological theory of critical phenomena in networks with an arbitrary distribution of connections $P(k)$. The theory shows that the critical behavior depends in a crucial way on the form of $P(k)$ and differs strongly…
We argue that that the folding criterion suggested by Klimov and Thirumalai is similar to the one published earlier and that their conclusion of invalidity of the ``gap criterion'' is due to misunderstanding of previous work
A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…
This paper considers the notion of possible events which are insignificant in probabilistic analysis (i.e. events that have zero probability). The paper discusses the method of modal logic based on "possible worlds" and discusses a…