Zobrazeno 1 - 10
of 53
pro vyhledávání: '"60K35, 05C80"'
We study inhomogeneous random graphs with a finite type space. For a natural generalization of the model as a dynamic network-valued process, the paper achieves two objectives: (a) We establish functional central limit theorems for the infinite vecto
Externí odkaz:
http://arxiv.org/abs/2412.13672
Autor:
Gladkov, Nikita
The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and other inequ
Externí odkaz:
http://arxiv.org/abs/2408.08457
We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed radius and each
Externí odkaz:
http://arxiv.org/abs/2404.13730
Let $Q^d$ be the $d$-dimensional binary hypercube. We say that $P=\{v_1,\ldots, v_k\}$ is an increasing path of length $k-1$ in $Q^d$, if for every $i\in [k-1]$ the edge $v_iv_{i+1}$ is obtained by switching some zero coordinate in $v_i$ to a one coo
Externí odkaz:
http://arxiv.org/abs/2311.16631
We study degree-penalized contact processes on Galton-Watson trees (GW) and the configuration model. The model we consider is a modification of the usual contact process on a graph. In particular, each vertex can be either infected or healthy. When i
Externí odkaz:
http://arxiv.org/abs/2310.07040
Autor:
van der Hofstad, Remco, Shneer, Seva
We study a model for the spread of fake news, where first a piece of fake news is spread from a location in a network, followed by a correction to the news. We assume that both the fake as well as correct news travel as first-passage percolations or
Externí odkaz:
http://arxiv.org/abs/2304.09958
Autor:
Seiler, Marco, Sturm, Anja
In this paper we introduce a contact process on a dynamical long range percolation (CPDLP) defined on a complete graph $(V,\mathcal{E})$. A dynamical long range percolation is a Feller process defined on the edge set $\mathcal{E}$, which assigns to e
Externí odkaz:
http://arxiv.org/abs/2210.08907
Autor:
Richthammer, Thomas
Let $G = (V,E)$ be a simple finite graph. The corresponding bunkbed graph $G^\pm$ consists of two copies $G^+ = (V^+,E^+),G^- = (V^-,E^-)$ of $G$ and additional edges connecting any two vertices $v_+ \in V_+,v_- \in V_-$ that are the copies of a vert
Externí odkaz:
http://arxiv.org/abs/2204.12931
Autor:
Seiler, Marco, Sturm, Anja
In this paper we introduce a contact process in an evolving random environment (CPERE) on a connected and transitive graph with bounded degree, where we assume that this environment is described through an ergodic spin systems with finite range. We s
Externí odkaz:
http://arxiv.org/abs/2203.16270
We propose a general class of co-evolving tree network models driven by local exploration where new vertices attach to the current network via randomly sampling a vertex and then exploring the graph for a random number of steps in the direction of th
Externí odkaz:
http://arxiv.org/abs/2203.11877