中文
相关论文

相关论文: Existence and percolation results for stopped germ…

200 篇论文

Let $G$ be the product of finitely many trees $T_1\times T_2 \times \cdots \times T_N$, each of which is regular with degree at least three. We consider Bernoulli bond percolation and the Ising model on this graph, giving a short proof that…

概率论 · 数学 2019-01-11 Tom Hutchcroft

A Gilbert tessellation arises by letting linear segments (cracks) in the plane unfold in time with constant speed, starting from a homogeneous Poisson point process of germs in randomly chosen directions. Whenever a growing edge hits an…

概率论 · 数学 2010-05-04 Tomasz Schreiber , Natalia Soja

Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…

概率论 · 数学 2018-09-12 Souvik Dhara

Spontaneous stratification of granular mixtures has been reported by Makse et al. [Nature 386, 379 (1997)] when a mixture of grains differing in size and shape is poured in a quasi-two-dimensional heap. We study this phenomenon using two…

统计力学 · 物理学 2009-10-31 Pierre Cizeau , Hernan A. Makse , H. Eugene Stanley

We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph…

概率论 · 数学 2021-06-08 Benedikt Jahnel , András Tóbiás

We consider a (one-dimensional) branching Brownian motion process with a general offspring distribution having at least two moments, and in which all particles have a drift towards the origin where they are immediately absorbed. It is…

概率论 · 数学 2018-09-13 Oren Louidor , Santiago Saglietti

We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…

统计力学 · 物理学 2011-11-16 E. Ben-Naim , P. L. Krapivsky

We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…

组合数学 · 数学 2007-05-23 Nikolaos Fountoulakis

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

Random sets with long-range dependence can be generated using a Boolean model with power-law grain sizes. We study thinnings of such Boolean models which have the hard-core property that no grains overlap in the resulting germ-grain model.…

概率论 · 数学 2016-12-26 Mikko Kuronen , Lasse Leskelä

Consider the model where nodes are initially distributed as a Poisson point process with intensity $\lambda$ over $\mathbb{R}^d$ and are moving in continuous time according to independent Brownian motions. We assume that nodes are capable…

概率论 · 数学 2015-09-10 Alexandre Stauffer

We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…

概率论 · 数学 2019-06-24 François Bienvenu , Florence Débarre , Amaury Lambert

We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…

概率论 · 数学 2008-04-02 Oskar Sandberg

We consider Gaussian approximation in a variant of the classical Johnson--Mehl birth-growth model with random growth speed. Seeds appear randomly in $\mathbb{R}^d$ at random times and start growing instantaneously in all directions with a…

概率论 · 数学 2023-11-02 Chinmoy Bhattacharjee , Ilya Molchanov , Riccardo Turin

We consider the following dynamic Boolean model introduced by van den Berg, Meester and White (1997). At time 0, let the nodes of the graph be a Poisson point process in R^d with constant intensity and let each node move independently…

概率论 · 数学 2010-12-22 Yuval Peres , Alistair Sinclair , Perla Sousi , Alexandre Stauffer

We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a…

概率论 · 数学 2020-04-03 Srikanth K. Iyer , Sanjoy Kr. Jhawar

In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…

We consider a dynamic network in continuum time and space in which nodes, with initial locations given by a Poisson point process, move according to i.i.d. isotropic $\alpha$-stable processes. Each node is additionally equipped with an…

概率论 · 数学 2026-02-26 Peter Gracar , Benedikt Jahnel , Lukas Lüchtrath , Anh Duc Vu

We define two general classes of nonabelian sandpile models on directed trees (or arborescences) as models of nonequilibrium statistical phenomena. These models have the property that sand grains can enter only through specified reservoirs,…

概率论 · 数学 2015-03-17 Arvind Ayyer , Anne Schilling , Benjamin Steinberg , Nicolas M. Thiery

We study the Poisson Boolean model where the grains are random convex bodies with a rotation-invariant distribution. We say that a grain distribution is dense if the union of the grains covers the entire space and robust if the union of the…

概率论 · 数学 2024-10-18 Peter Gracar , Marilyn Korfhage , Peter Mörters