Planar reinforced k-out percolation

Gideon Amir, Markus Heydenreich and Christian Hirsch

Stochastic Processes and their Applications, 2025, vol. 189, issue C

Abstract: We investigate the percolation properties of a planar reinforced network model. In this model, at every time step, every vertex chooses k⩾1 incident edges, whose weight is then increased by 1. The choice of this k-tuple occurs proportionally to the product of the corresponding edge weights raised to some power α>0.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304414925001474
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:189:y:2025:i:c:s0304414925001474

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.spa.2025.104706

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().