English
Related papers

Related papers: Percolation for the Gaussian free field on the cab…

200 papers

Let G_n be a sequence of finite transitive graphs with vertex degree d=d(n) and |G_n|=n. Denote by p^t(v,v) the return probability after t steps of the non-backtracking random walk on G_n. We show that if p^t(v,v) has quasi-random…

Probability · Mathematics 2008-11-25 Asaf Nachmias

Given a graph $G$, we consider a model for a random cover of $G$ by taking two parallel copies of $G$ and crossing every pair of parallel edges randomly with probability $q$ independently of each other. The resulting graph $G_q$, is a…

Probability · Mathematics 2025-06-03 Paul Drouvillé

Consider a discrete locally finite subset $\Gamma$ of $R^d$ and the complete graph $(\Gamma,E)$, with vertices $\Gamma$ and edges $E$. We consider Gibbs measures on the set of sub-graphs with vertices $\Gamma$ and edges $E'\subset E$. The…

Probability · Mathematics 2010-09-17 Pablo A. Ferrari , Eugene A. Pechersky , Valentin V. Sisko , Anatoly A. Yambartsev

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in $\bbR ^2$ of intensities $\lambda$ and $\lambda_E$…

Information Theory · Computer Science 2013-08-15 Rahul Vaze , Srikanth Iyer

It has been recently shown that the percolation transition is discontinuous in Erd\H{o}s-R\'enyi networks and square lattices in two dimensions under the Achlioptas Process (AP). Here, we show that when the structure is highly heterogeneous…

Statistical Mechanics · Physics 2015-05-13 Y. S. Cho , J. S. Kim , J. Park , B. Kahng , D. Kim

We prove that the set of possible values for the percolation threshold $p_c$ of Cayley graphs has a gap at 1 in the sense that there exists $\varepsilon_0>0$ such that for every Cayley graph $G$ one either has $p_c(G)=1$ or $p_c(G) \leq…

Probability · Mathematics 2021-11-02 Christoforos Panagiotis , Franco Severo

Weak multiplex percolation generalizes percolation to multi-layer networks, represented as networks with a common set of nodes linked by multiple types (colors) of edges. We report a novel discontinuous phase transition in this problem.…

Physics and Society · Physics 2022-03-15 R. A. da Costa , G. J. Baxter , S. N. Dorogovtsev , J. F. F. Mendes

We prove that the phase transition for the Gaussian free field (GFF) is sharp. In comparison to a previous argument due to Rodriguez in 2017 which characterized a $0-1$ law for the Massive Gaussian Free Field by analyzing crossing…

Probability · Mathematics 2024-08-08 Pete Rigas

We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…

Probability · Mathematics 2024-04-23 Peter Gracar , Lukas Lüchtrath , Peter Mörters

We study the bond percolation on finite graphs induced by the level-sets of zero-average Gaussian free field on the associated metric graph above a given height (level) parameter $h \in \mathbb{R}$. We characterize the near- and…

Probability · Mathematics 2026-01-13 Subhajit Goswami , Dipranjan Pal

Consider an infinite, rooted, connected graph where each vertex is labelled with an independent and identically distributed Uniform(0,1) random variable, plus a parameter $\theta$ times its distance from the root $\rho$. That is, we label…

Probability · Mathematics 2026-05-15 Diana De Armas Bellon , Matthew I. Roberts

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…

Probability · Mathematics 2024-12-10 Benedikt Jahnel , Lukas Lüchtrath

Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and…

Information Theory · Computer Science 2011-04-07 Rahul Vaze

We consider bond percolation on high-dimensional product graphs $G=\square_{i=1}^tG^{(i)}$, where $\square$ denotes the Cartesian product. We call the $G^{(i)}$ the base graphs and the product graph $G$ the host graph. Very recently, Lichev…

Combinatorics · Mathematics 2024-01-29 Sahar Diskin , Joshua Erde , Mihyun Kang , Michael Krivelevich

We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…

Probability · Mathematics 2026-04-21 Kazuki Okamura

Given a collection $\mathcal{G}=(G_1,\dots, G_h)$ of graphs on the same vertex set $V$ of size $n$, an $h$-edge graph $H$ on the vertex set $V$ is a $\mathcal{G}$-transversal if there exists a bijection $\lambda : E(H) \rightarrow [h]$ such…

Combinatorics · Mathematics 2023-02-21 Debsoumya Chakraborti , Seonghyuk Im , Jaehoon Kim , Hong Liu

This work studies the typical structure of sparse $H$-free graphs, that is, graphs that do not contain a subgraph isomorphic to a given graph $H$. Extending the seminal result of Osthus, Pr\"omel, and Taraz that addressed the case where $H$…

Combinatorics · Mathematics 2025-02-13 Oren Engelberg , Wojciech Samotij , Lutz Warnke

The nature of level set percolation in the two-dimension Gaussian Free Field has been an elusive question. Using a loop-model mapping, we show that there is a nontrivial percolation transition, and characterize the critical point. In…

Statistical Mechanics · Physics 2021-03-31 Xiangyu Cao , Raoul Santachiara

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

Physics and Society · Physics 2015-07-10 Filippo Radicchi

Consider a graph $G$ and an initial random configuration, where each node is black with probability $p$ and white otherwise, independently. In discrete-time rounds, each node becomes black if it has at least $r$ black neighbors and white…

Probability · Mathematics 2019-04-24 Ahad N. Zehmakan
‹ Prev 1 3 4 5 6 7 10 Next ›