Related papers: Phase transition in random intersection graphs wit…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…
We study here the social network generated by the asynchronous visits, to a fixed set of sites, of mobile agents modelled as independent random walks on the plane lattice. The social network is constructed by assuming that a group of agents…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the…
Jigsaw percolation is a model for the process of solving puzzles within a social network, which was recently proposed by Brummitt, Chatterjee, Dey and Sivakoff. In the model there are two graphs on a single vertex set (the `people' graph…
Although ubiquitous, interactions of groups of individuals (e.g., modern messaging applications, group meetings, or even a parliament discussion) are not yet thoroughly studied. Frequently, single-groups are modeled as critical-mass…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks. Here we propose a framework based on statistical inference to…
Random intersection graphs (RIGs) are an important random structure with applications in social networks, epidemic networks, blog readership, and wireless sensor networks. RIGs can be interpreted as a model for large randomly formed…
We focus on the majority model in a topology consisting of two coupled fully-connected networks, thereby mimicking the existence of communities in social networks. We show that a transition takes place at a value of the inter-connectivity…
We consider robustness and percolation properties of the networks of networks, in which random nodes in different individual networks (layers) can be interdependent. We explore the emergence of the giant mutually connected component,…
A class of random graph models is considered, combining features of exponential-family models and latent structure models, with the goal of retaining the strengths of both of them while reducing the weaknesses of each of them. An open…
We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…
Recently much attention has been paid to the study of the robustness of interdependent and multiplex networks and, in particular, networks of networks. The robustness of interdependent networks can be evaluated by the size of a mutually…
Multiplex networks describe a large variety of complex systems including infrastructures, transportation networks and biological systems. Most of these networks feature a significant link overlap. It is therefore of particular importance to…
We discuss numerically the non-perturbative effects in exponential random graphs which are analogue of eigenvalue instantons in matrix models. The phase structure of exponential random graphs with chemical potential for 4-cycles and degree…
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…
In epidemiological modelling, dynamics on networks, and in particular adaptive and heterogeneous networks have recently received much interest. Here we present a detailed analysis of a previously proposed model that combines heterogeneity…
Let $\mathcal{V}$ and $\mathcal{U}$ be the point sets of two independent homogeneous Poisson processes on $\mathbb{R}^d$. A graph $\mathcal{G}_\mathcal{V}$ with vertex set $\mathcal{V}$ is constructed by first connecting pairs of points…