Related papers: The contact process on dynamical scale-free networ…
The stacked contact process is a stochastic model for the spread of an infection within a population of hosts located on the $d$-dimensional integer lattice. Regardless of whether they are healthy or infected, hosts give birth and die at…
Scale-free (SF) networks and small world networks have been found to occur in very diverse contexts. It is this striking universality which makes one look for widely applicable mechanisms which lead to the formation of such networks. In…
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in- and…
Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including small world and scale free networks). They model a variety of phenomena, including the…
Dynamic temporal graphs represent evolving relations between entities, e.g. interactions between social network users or infection spreading. We propose an extension of graph echo state networks for the efficient processing of dynamic…
In a random graph model based on 3-interactions we give the joint asymptotic distribution of weights and degrees and prove scale-free property for the model. Moreover, we determine the asymptotics of the maximal weight and the maximal…
We investigate the generalized contact process with two absorbing states in one space dimension by means of large-scale Monte-Carlo simulations. Treating the creation rate of active sites between inactive domains as an independent parameter…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…
Graphs are widely used for modeling various types of interactions, such as email communications and online discussions. Many of such real-world graphs are temporal, and specifically, they grow over time with new nodes and edges. Counting…
Topology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest neighbors, the 4-th and the 5-th neighbors are calculated.…
We investigate the steady-state phases of the one-dimensional quantum contact process model. We present the Liouvillian gap in the thermodynamic limit and uncover the metastability of the system. Exploiting the mean-field approximations…
We consider weakly interacting jump processes on time-varying random graphs with dynamically changing multi-color edges. The system consists of a large number of nodes in which the node dynamics depends on the joint empirical distribution…
We performed Monte Carlo simulations of the symbiotic contact process on different spatial dimensions ($d$). On the complete and random graphs (infinite dimension), we observe hysteresis cycles and bistable regions, what is consistent with…
We study a zero-range process with system-size dependent jump rates, which is known to exhibit a discontinuous condensation transition. Metastable homogeneous phases and condensed phases coexist in extended phase regions around the…
The transmission dynamics of some infectious diseases is related to the contact structure between individuals in a network. We used five algorithms to generate contact networks with different topological structure but with the same…
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…
There is proposed a model of scale-free random graphs which are locally close to the uncorrelated complex random networks with divergent $\langle k^2 \rangle$ studied in e.g. S. N. Dorogovtsev {\it et al}, Rev. Mod. Phys. {\bf 80}, 1275…
Temporal gene expression data (Wen, et. al.) was analyzed using the recently introduced inverse modeling technique of Embedded Complex Logistic Maps (ECLM). Preliminary results indicate scale-free structure in the gene regulatory network…
A great variety of systems in nature, society and technology -- from the web of sexual contacts to the Internet, from the nervous system to power grids -- can be modeled as graphs of vertices coupled by edges. The network structure,…
We deal with a random graph model where at each step, a vertex is chosen uniformly at random, and it is either duplicated or its edges are deleted. Duplication has a given probability. We analyse the limit distribution of the degree of a…