English
Related papers

Related papers: Transitive closure in a polluted environment

200 papers

We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a…

Physics and Society · Physics 2024-07-31 Minsuk Kim , Filippo Radicchi

The theme of this paper is the analysis of bootstrap percolation processes on random graphs generated by preferential attachment. This is a class of infection processes where vertices have two states: they are either infected or…

Probability · Mathematics 2014-12-23 Mohammed Amin Abdullah , Nikolaos Fountoulakis

Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…

Probability · Mathematics 2025-12-18 Remco van der Hofstad

In the polluted modified bootstrap percolation model, sites in the square lattice are independently initially occupied with probability $p$ or closed with probability $q$. A site becomes occupied at a subsequent step if it is not closed and…

Probability · Mathematics 2025-03-21 Janko Gravner , Alexander Holroyd , Sangchul Lee , David Sivakoff

A bootstrap percolation process on a graph $G$ is an "infection" process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round each uninfected node which has at least $r$ infected neighbours…

Probability · Mathematics 2013-08-15 Hamed Amini , Nikolaos Fountoulakis

We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…

Probability · Mathematics 2018-11-27 Mark Holmes , Thomas S. Salisbury

We consider independent edge percolation models on Z, with edge occupation probabilities p_<x,y> = p if |x-y| = 1, 1 - exp{- beta / |x-y|^2} otherwise. We prove that oriented percolation occurs when beta > 1 provided p is chosen…

Probability · Mathematics 2013-04-26 D. H. U. Marchetti , V. Sidoravicius , M. E. Vares

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é

In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the…

Probability · Mathematics 2018-06-12 Irina Cristali , Matthew Junge , Rick Durrett

In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is…

Probability · Mathematics 2020-09-09 Thomas Beekenkamp

Bootstrap Percolation is a process defined on a graph which begins with an initial set of infected vertices. In each subsequent round, an uninfected vertex becomes infected if it is adjacent to at least $r$ previously infected vertices. If…

Combinatorics · Mathematics 2023-09-26 Hudson LaFayette , Rayan Ibrahim , Kevin McCall

Semi-transitive graphs, defined in \cite{hps98} as examples where ``uniform percolation" holds whenever $p>p_c$, are a large class of graphs more general than quasi-transitive graphs. Let $G$ be a semi-transitive graph with one end which…

Combinatorics · Mathematics 2023-07-21 Zhongyang Li

Intercellular exchange networks are essential for the adaptive capabilities of populations of cells. While diffusional exchanges have traditionally been difficult to map, recent advances in nanotechnology enable precise probing of exchange…

Statistical Mechanics · Physics 2024-12-13 Luís C. F. Latoski , Andrea De Martino , Daniele De Martino

We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph…

Probability · Mathematics 2017-11-09 Daniel Ahlberg , Maria Deijfen , Svante Janson

Transition out of a topological phase is typically characterized by discontinuous changes in topological invariants along with bulk gap closings. However, as a clean system is geometrically punctured, it is natural to ask the fate of an…

Disordered Systems and Neural Networks · Physics 2023-12-15 Saikat Mondal , Subrata Pachhal , Adhip Agarwala

Bootstrap percolation is a type of cellular automaton on graphs, introduced as a simple model of the dynamics of ferromagnetism. Vertices in a graph can be in one of two states: `healthy' or `infected' and from an initial configuration of…

Probability · Mathematics 2015-06-01 Tom Coker , Karen Gunderson

Bootstrap percolation is a well-known activation process in a graph, in which a node becomes active when it has at least $r$ active neighbors. Such process, originally studied on regular structures, has been recently investigated also in…

Social and Information Networks · Computer Science 2016-03-16 Michele Garetto , Emilio Leonardi , Giovanni Luca Torrisi

In this Letter, we show that the explosive percolation is a novel continuous phase transition. The order-parameter-distribution histogram at the percolation threshold is studied in Erd\H{o}s-R\'{e}nyi networks, scale-free networks, and…

Disordered Systems and Neural Networks · Physics 2012-02-22 Liang Tian , Da-Ning Shi

Percolation phenomena are pervasive in nature, ranging from capillary flow, crack propagation, ionic transport, fluid permeation, etc. Modeling percolation in highly-branched media requires the use of numerical solutions, as problems can…

Chemical Physics · Physics 2019-04-09 Asghar Aryanfar , William A. Goddard , Jaime Marian

We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…

Probability · Mathematics 2023-07-10 David Corlin Marchand