Searcharxiv⌕ Search

arXiv · math/0401070

Random subgraphs of finite graphs: II. The lace expansion and the triangle condition

Abstract

In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper, we use a new and simplified approach to the lace expansion to prove quite generally that for finite graphs that are tori the triangle condition for percolation is implied by a certain triangle condition for simple random walks on the graph. The latter is readily verified for several graphs with vertex set $\{0,1,..., r-1\}^n$, including the Hamming cube on an alphabet of $r$ letters (the $n$-cube, for $r=2$), the $n$-dimensional torus with nearest-neighbor bonds and $n$ sufficiently large, and the $n$-dimensional torus with $n>6$ and sufficiently spread-out (long range) bonds. The conclusions of our previous paper thus apply to the percolation phase transition for each of the above examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Borgs, Jennifer T. Chayes, Remco van der Hofstad, Gordon Slade, Joel Spencer. 2004-01-08. Random subgraphs of finite graphs: II. The lace expansion and the triangle condition. https://searcharxiv.com/abs/math/0401070

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Approximation of the Lévy-driven stochastic heat equation on the sphere

The stochastic heat equation on the sphere driven by an additive square-integrable Lévy process is approximated by a spectral method in space and forward and backward Euler-Maruyama schemes in time. New sharp regularity results are proven for its solution. The spectral approximation is based on a truncation of the series expansion with respect to the spherical harmonic functions. For a given regularity of the initial condition and two different settings of regularity for the driving noise, strong convergence rates for the spectral approximation and for the Euler-Maruyama methods are proven. Moreover, weak rates of up to twice the strong rates are shown for Wiener noise and for Lévy noise with independent and up to a deterministic decay rate factor identically distributed components, while for general square-integrable Lévy noise the weak rate depends explicitly on the polynomial order of the test function. Numerical simulations confirm the theoretical results.

math.PR↗

A Multivariate Generalized Cox Model for Dependent and Simultaneous Default Times

We propose a framework for dependent default times where each name defaults when an increasing driver crosses an independent unit exponential threshold. As in Gueye and Jeanblanc (2022), the drivers may jump, so defaults may occur at stopping times of the reference filtration, including predictable ones, and a common jump may cause no, one or several simultaneous defaults. For general drivers, we derive the conditional joint survival law by a backward recursion; it is an explicit product of survival functions if and only if, for every set of names, the predictable reduction of the compensator of their first default time is deterministic. If, moreover, defaults avoid predictable stopping times, the law is a fatal shock law with hazards identified from the drivers; predictable default atoms can rule this out. Examples include Lévy subordinators and, with random reductions but explicit laws, Liu's model and shot-noise drivers with memory.

math.PR↗

Concentration Inequalities for Branching Random Walks

Motivated by phase transition problems in CSPs, we prove a more general concentration inequality that retains classical sub-Gaussian tails under a mild global linear-growth condition $|S_n| < Cn$, relaxing the bounded-increment assumption to finite exponential moments and requiring neither independence nor the martingale property. We further extend it to branching random walks (BRWs), obtaining the first concentration inequality for BRWs.

math.PR↗