Related papers: Are giants in random digraphs `almost' local?
We study the joint components in a random `double graph' that is obtained by superposing red and blue binomial random graphs on $n$~vertices. A joint component is a maximal set of vertices, which contains both a red and a blue spanning…
We consider high-order connectivity in $k$-uniform hypergraphs defined as follows: Two $j$-sets are $j$-connected if there is a walk of edges between them such that two consecutive edges intersect in at least $j$ vertices. We describe the…
We show that large critical multi-type Galton-Watson trees, when conditioned to be large, converge locally in distribution to an infinite tree which is analoguous to Kesten's infinite monotype Galton-Watson tree. This is proven when we…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
Scale-free networks arise from power-law degree distributions. Due to the finite size of real-world networks, the power law inevitably has a cutoff at some maximum degree $\Delta$. We investigate the relative size of the giant component $S$…
Finding a maximum cut is a fundamental task in many computational settings. Surprisingly, it has been insufficiently studied in the classic distributed settings, where vertices communicate by synchronously sending messages to their…
Social networks are rarely observed in full detail. In many situations properties are known for only a sample of the individuals in the network and it is desirable to induce global properties of the full social network from this…
Motivated in part by understanding average case analysis of fundamental algorithms in computer science, and in part by the wide array of network data available over the last decade, a variety of random graph models, with corresponding…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
A graph $G$ is said to be ubiquitous, if every graph $\Gamma$ that contains arbitrarily many disjoint $G$-minors automatically contains infinitely many disjoint $G$-minors. The well-known Ubiquity conjecture of Andreae says that every…
We study the size of the largest biconnected components in sparse Erd\H{o}s-R\'enyi graphs with finite connectivity and Barab\'asi-Albert graphs with non-integer mean degree. Using a statistical-mechanics inspired Monte Carlo approach we…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
Social studies researchers use graphs to model group activities in social networks. An important property in this context is the centrality of a vertex: the inverse of the average distance to each other vertex. We describe a randomized…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
We study the inhomogeneous random graphs in the subcritical case. We derive an exact formula for the size of the largest connected component scaled to $\log n$ where $n$ is the size of the graph. This generalizes the recent result for the…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
Random K-out graphs, denoted $\mathbb{H}(n;K)$, are generated by each of the $n$ nodes drawing $K$ out-edges towards $K$ distinct nodes selected uniformly at random, and then ignoring the orientation of the arcs. Recently, random K-out…
This paper presents an empirical study of the relationship between the density of small-medium sized random graphs and their planarity. It is well known that, when the number of vertices tends to infinite, there is a sharp transition…
We introduce probability-graphons which are probability kernels that generalize graphons to the case of weighted graphs. Probability-graphons appear as the limit objects to study sequences of large weighted graphs whose distribution of…