Related papers: Directed Percolation Criticality in Eternal Inflat…
We study a lattice model where the coupling stochastically switches between repulsive (subtractive) and attractive (additive) at each site with probability p at every time instance. We observe that such kind of coupling stabilizes the local…
We investigate if the observed small and nearly scale-invariant primordial cosmic perturbation, i.e. the perturbation amplitude $P_\zeta\sim10^{-9}$ and the spectral index $n_s \simeq 0.965$, is typical in the landscape of vacua after…
We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…
In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…
We study the behavior of scale-free networks, having connectivity distribution P(k) k^-a, close to the percolation threshold. We show that for networks with 3<a<4, known to undergo a transition at a finite threshold of dilution, the…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
While for standard percolation directionality is known to increase the combinatorial complexity of percolation, here we show that when connectivity is ensured by paths of length $R\geq 2$, network directionality, impeding backtracking, can…
The much-discussed swampland conjectures suggest significant constraints on the properties of string theory landscape and on the nature of the multiverse that this landscape can support. The conjectures are especially constraining for…
The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the…
Disorder on the string theory landscape may significantly affect dynamics of eternal inflation leading to the possibility for some vacua on the landscape to become dynamically preferable over others. We systematically study effects of a…
Generic models of cosmological inflation and the recently proposed scenarios of a recycling universe and the string theory landscape predict spacetimes whose global geometry is a stochastic, self-similar fractal. To visualize the…
We study site and bond percolation on directed simple random graphs with a given degree distribution and derive the expressions for the critical value of the percolation probability above which the giant strongly connected component emerges…
We consider propagation models that describe the spreading of an attribute, called "damage", through the nodes of a random network. In some systems, the average fraction of nodes that remain undamaged vanishes in the large system limit, a…
Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local…
We consider the model of ``Chain Inflation,'' in which the period of inflation in our universe took the form of a long sequence of quantum tunneling events. We find that in the simplest such scenario, in which the tunneling processes are…
We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
Suppose each site independently and randomly chooses some sites around it, and it is weakly (strongly) connected with them (if there choose each other). What is the probability that the weak (strong) connected cluster is infinite? We…
We consider a first-passage percolation model on a Delaunay triangulation of the plane. In this model each edge is independently equipped with a nonnegative random variable, with distribution function F, which is interpreted as the time it…
The random percolation model can be viewed as the dual of a well defined confining gauge theory; since this theory, having no Monte Carlo dynamics at all, is simple to simulate, it is possible to study the properties of the flux tube with…