Related papers: Continuous percolation phase transitions of random…
Predicting labels of nodes in a network, such as community memberships or demographic variables, is an important problem with applications in social and biological networks. A recently-discovered phase transition puts fundamental limits on…
We consider the simple random walk on the infinite cluster of a general class of percolation models on $\mathbb{Z}^d$, $d\geq 3$, including Bernoulli percolation as well as models with strong, algebraically decaying correlations. For almost…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
Consider a critical Erd\"os-R\'enyi random graph: $n$ is the number of vertices, each one of the $\binom{n}{2}$ possible edges is kept in the graph independently from the others with probability $n^{-1}+\lambda n^{-4/3}$, $\lambda$ being a…
Networks composed from both connectivity and dependency links were found to be more vulnerable compared to classical networks with only connectivity links. Their percolation transition is usually of a first order compared to the second…
We consider the totally asymmetric simple exclusion process, a model in the KPZ universality class. We focus on the fluctuations of particle positions starting with certain deterministic initial conditions. For large time t, one has regions…
The use of machine learning techniques in classical and quantum systems has led to novel techniques to classify ordered and disordered phases, as well as uncover transition points in critical phenomena. Efforts to extend these methods to…
We propose an approach to calculate the critical percolation threshold for finite-sized Erdos-Renyi digraphs using minimal Hamiltonian cycles. We obtain an analytically exact result, valid non-asymptotically for all graph sizes, which…
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Renyi graph of N vertices we…
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…
We consider a growing network in which an incoming node gets attached to the $i^{th}$ existing node with the probability $\Pi_i \propto {k_i}^{\beta}\tau_i^{\alpha}$, where $k_{i}$ is the degree of the $i^{th}$ node and $\tau_i$ its present…
We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…
We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…
We investigate the growth of connectivity in a network. In our model, starting with a set of disjoint nodes, links are added sequentially. Each link connects two nodes, and the connection rate governing this random process is proportional…
We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…
In this paper we consider two models in the Kardar-Parisi-Zhang (KPZ) universality class, the asymmetric simple exclusion process (ASEP) and the stochastic six-vertex model. We introduce a new class of initial data (which we call {\itshape…
The renowned general epidemic process describes the stochastic evolution of a population of individuals which are either susceptible, infected or dead. A second order phase transition belonging to the universality class of dynamic isotropic…
We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…
We study a system composed from two interdependent networks A and B, where a fraction of the nodes in network A depends on the nodes of network B and a fraction of the nodes in network B depends on the nodes of network A. Due to the…
Percolation on networks is a common framework to model a wide range of processes, from cascading failures to epidemic spreading. Standard percolation assumes short-range interactions, implying that nodes can merge into clusters only if they…