English
Related papers

Related papers: Hypercube percolation

200 papers

We study the percolation of strongly connected clusters (SCCs), in which sites are mutually reachable through directed paths, in systems with randomly oriented bonds by extensive simulations on hypercubic lattices from dimension $d=2$ to…

Statistical Mechanics · Physics 2026-05-19 Qi Wang , Ming Li

Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…

Probability · Mathematics 2018-04-18 Jan Czajkowski

Consider critical bond percolation on a large 2n by 2n box on the square lattice. It is well-known that the size (i.e. number of vertices) of the largest open cluster is, with high probability, of order n^2 \pi(n), where \pi(n) denotes the…

Probability · Mathematics 2013-12-13 Jacob van den Berg , Rene Conijn

We study the conductivity of a class of disordered continuum systems represented by the Swiss-cheese model, where the conducting medium is the space between randomly placed spherical holes, near the percolation threshold. This model can be…

Statistical Mechanics · Physics 2009-11-07 Olaf Stenull , Hans-Karl Janssen

Start with a large convex polygon and add all other edges inside independently with probability $p$. At what critical threshold $p_c$ do triangulations of the polygon begin to appear? The first author and Gravner asked this question, and…

Probability · Mathematics 2025-09-15 Brett Kolesnik , Georgii Zakharov , Maksim Zhukovskii

An upper bound for the critical probability of long range bond percolation in $d=2$ and $d=3$ is obtained by connecting the bond percolation with the SIR epidemic model, thus complementing the lower bound result in Frei and Perkins…

Probability · Mathematics 2021-07-30 Jieliang Hong

We show that in the random hyperbolic graph model as formalized by Gugelmann et al. in the most interesting range of $\frac12 < \alpha < 1$ the size of the second largest component is $\Theta((\log n)^{1/(1-\alpha)})$, thus answering a…

Probability · Mathematics 2019-11-20 Marcos Kiwi , Dieter Mitsche

We demonstrate the effect of bandstructure on the superconducting properties of Pb by calculating the strong-coupling features in the optical conductivity, $\sigma(\omega)$, due to the electron-phonon interaction. The importance of momentum…

Superconductivity · Physics 2009-11-11 Nicolas Bock , Dermot Coffey

Series expansion methods are used to study directed bond percolation clusters on the square lattice whose lateral growth is restricted by a wall parallel to the growth direction. The percolation threshold $p_c$ is found to be the same as…

Condensed Matter · Physics 2019-08-15 J W Essam , A J Guttmann , I Jensen , D TanlaKishani

We consider (near-)critical percolation on the square lattice. Let M_n be the size of the largest open cluster contained in the box [-n,n]^2, and let pi(n) be the probability that there is an open path from O to the boundary of the box. It…

Probability · Mathematics 2012-08-23 Jacob van den Berg , Rene Conijn

We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest component is of order logarithmic in the number of vertices.…

Combinatorics · Mathematics 2024-04-11 Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich

Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.

Probability · Mathematics 2009-10-13 Massimo Campanino , Dmitry Ioffe , Oren Louidor

We study random subgraphs of an arbitrary finite connected transitive graph $\mathbb G$ obtained by independently deleting edges with probability $1-p$. Let $V$ be the number of vertices in $\mathbb G$, and let $\Omega$ be their degree. We…

Probability · Mathematics 2007-05-23 Christian Borgs , Jennifer T. Chayes , Remco van der Hofstad , Gordon Slade , Joel Spencer

The superconducting upper critical field $H_{c2}(T)$ of a two dimensional BCS superconductor is calculated in the vicinity of a van-Hove singularity. The zero temperature upper critical field is strongly enhanced at weak coupling when the…

Condensed Matter · Physics 2009-10-28 R. G. Dias , J. M. Wheatley

Consider $S$, a set of $n$ points chosen uniformly at random and independently from the unit hypercube of dimension $t>2$. Order $S$ by using the Cartesian product of the $t$ standard orders of $[0,1]$. We determine a constant $\bar x(t)<e$…

Combinatorics · Mathematics 2025-07-15 Boris Pittel

We determine the dimensional dependence of the percolative exponents of the jamming transition via numerical simulations in four and five spatial dimensions. These novel results complement literature ones, and establish jamming as a mixed…

Soft Condensed Matter · Physics 2021-02-03 Antonio Piscitelli , Antonio Coniglio , Annalisa Fierro , Massimo Pica Ciamarra

We present exact solutions for the size of the giant connected component (GCC) of graphs composed of higher-order homogeneous cycles, including weak cycles and cliques, following bond percolation. We use our theoretical result to find the…

Physics and Society · Physics 2021-08-11 Peter Mann , V Anne Smith , John Mitchell , Christopher Jefferson , Simon Dobson

We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…

Statistical Mechanics · Physics 2014-08-01 Vijay Singh , Stefan Boettcher

In this paper, we study independent (Bernoulli) bond percolation in dimensions $d \ge 2$, focusing on the maximum diameter of finite clusters in the non-critical regime ($p\neq p_c$). We prove that the maximum diameter $R_n$ satisfies $R_n…

Probability · Mathematics 2026-01-22 Kaito Kobayashi

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…

Probability · Mathematics 2024-02-21 Geoffrey R. Grimmett , Zhongyang Li