Related papers: Shape Theorem for the Contact Process in a Dynamic…
We prove a shape theorem for the set of infected individuals in a spatial epidemic model with 3 states (susceptible-infected-recovered) on ${\mathbb Z}^d,d\ge 3$, when there is no extinction of the infection. For this, we derive percolation…
Contact processes describe the transmission of distinct properties of nodes via the links of a network. They provide a simple framework for many phenomena, such as epidemic spreading and opinion formation. Combining contact processes with…
We investigate invariant random fields on the sphere using a new type of spherical wavelets, called needlets. These are compactly supported in frequency and enjoy excellent localization properties in real space, with quasi-exponentially…
In this paper we study the metastability of the contact process on a random regular graph. We show that the extinction time of the contact process, when initialized so that all vertices are infected at time 0, grows exponentially with the…
In this paper, we study exponential random graph models subject to certain constraints. We obtain some general results about the asymptotic structure of the model. We show that there exists non-trivial regions in the phase plane where the…
It is known that the limiting behavior of the contact process strongly depends upon the geometry of the graph on which particles evolve: while the contact process on the regular lattice exhibits only two phases, the process on homogeneous…
Non-Hermitian models describe the physics of ubiquitous open systems with gain and loss. One intriguing aspect of non-Hermitian models is their inherent topology that can produce intriguing boundary phenomena like resilient higher-order…
In this paper we are concerned with the contact process with random recovery rates and edge weights on complete graph with $n$ vertices. We show that the model has a critical value which is inversely proportional to the product of the mean…
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…
We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
Taking a multidimensional time-homogeneous dynamical system and adding a randomly perturbed time-dependent deterministic signal to some of its components gives rise to a high-dimensional system of stochastic differential equations which is…
Molecular dynamics simulations are used to study different definitions of contact at the atomic scale. The roles of temperature, adhesive interactions and atomic structure are studied for simple geometries. An elastic, crystalline substrate…
This article proposes methods to model nonstationary temporal graph processes. This corresponds to modelling the observation of edge variables (relationships between objects) indicating interactions between pairs of nodes (or objects)…
In this paper, the leading term of the asymptotics of the number of possible final positions of a random walk on a directed Hamiltonian metric graph is found. Consideration of such dynamical systems could be motivated by problems of…
Many environmental processes exhibit weakening spatial dependence as events become more extreme. Well-known limiting models, such as max-stable or generalized Pareto processes, cannot capture this, which can lead to a preference for models…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…