Related papers: Giant component in the configuration model under g…
We prove a moderate deviations principles for the size of the largest connected component in a random $d$-uniform hypergraph. The key tool is a version of the exploration process, that is also used to investigate the giant component of an…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and…
In this paper we study the threshold model of \emph{geometric inhomogeneous random graphs} (GIRGs); a generative random graph model that is closely related to \emph{hyperbolic random graphs} (HRGs). These models have been observed to…
We analyse the largest eigenvalue of the adjacency matrix of the configuration model with large degrees, where the latter are treated as hard constraints. In particular, we compute the expectation of the largest eigenvalue for degrees that…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges…
We prove a law of large numbers for the order and size of the largest strongly connected component in the directed configuration model. Our result extends previous work by Cooper and Frieze.
We introduce a simple geometric model which describes the kinetics of fragmentation of d-dimensional objects. In one dimension our model coincides with the random scission model and show a simple scaling behavior in the long-time limit. For…
A two-dimensional lattice of oscillators with identical (zero) intrinsic frequencies and Kuramoto type of interactions with randomly frustrated couplings is considered. Starting the time evolution from slightly perturbed synchronized…
This work is inspired by a recent study of a two-dimensional stochastic fragmentation model. We show that the configurational entropy of this model exhibits log-periodic oscillations as a function of the sample size, by exploiting an exact…
As suggested by Itai Benjamini, we introduced a variant of the Erd\"os- R\'enyi random graph process with a forbidden degree $k$, in which every edge adjacent to a vertex $v$ is removed when the degree of $v$ reaches $k$ (but the removed…
We study the high-velocity regime mode-I fracture instability when small microbranches start to appear near the main crack, using large scale simulations. Some of the features of those microbranches have been reproduced qualitatively in…
We model two-dimensional crystals by a configuration space in which every admissible configuration is a hard disk configuration and a perturbed version of some triangular lattice with side length one. In this model we show that, under the…
Encouraged by the AdS/CFT correspondence, we study emergent local geometry in large N multi-matrix models from the perspective of a strong coupling expansion. By considering various solvable interacting models we show how the emergence or…
We study the sizes of connected components according to their excesses during a random graph process built with $n$ vertices. The considered model is the continuous one defined in Janson 2000. An ${\ell}$-component is a connected component…
We consider percolation on high-dimensional product graphs, where the base graphs are regular and of bounded order. In the subcritical regime, we show that typically the largest component is of order logarithmic in the number of vertices.…
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an arc depends on the labels of its endpoints and its…
In this paper we study the mixing time of the simple random walk on the giant component of supercritical $d$-dimensional random geometric graphs generated by the unit intensity Poisson Point Process in a $d$-dimensional cube of volume $n$.…