相关论文: Mesoscopic scales in hierarchical configuration mo…
We introduce a class of random graphs with a community structure, which we call the hierarchical configuration model. On the inter-community level, the graph is a configuration model, and on the intra-community level, every vertex in the…
We investigate the component sizes of the critical configuration model, as well as the related problem of critical percolation on a supercritical configuration model. We show that, at criticality, the finite third moment assumption on the…
Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…
Most random graph models are locally tree-like - do not contain short cycles - rendering them unfit for modeling networks with a community structure. We introduce the hierarchical configuration model (HCM), a generalization of the…
In this paper, we study the critical behavior of percolation on a configuration model with degree distribution satisfying an infinite second-moment condition, which includes power-law degrees with exponent $\tau \in (2,3)$. It is well known…
We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…
We propose a novel finite size scaling analysis for percolation transition observed in complex networks. While it is known that cooperative systems in growing networks often undergo an infinite order transition with inverted…
A key topic in network science is the detection of intermediate or meso-scale structures. Community, core-periphery, disassortative and other partitions allow us to understand the organisation and function of large networks. In this work we…
We analyse the scaling limit of the sizes of the largest components of the Random Intersection Graph $G(n,m,p)$ close to the critical point $p=\frac{1}{\sqrt{nm}}$, when the numbers $n$ of individuals and $m$ of communities have different…
We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…
We identify the scaling limits for the sizes of the largest components at criticality for inhomogeneous random graphs when the degree exponent $\tau$ satisfies $\tau>4$. We see that the sizes of the (rescaled) components converge to the…
We study two models having an infinite-disorder critical point --- the zero temperature random transverse-field Ising model and the random contact process --- on a star-like network composed of $M$ semi-infinite chains connected to a common…
Many natural and engineered complex networks have intricate mesoscopic organization, e.g., the clustering of the constituent nodes into several communities or modules. Often, such modularity is manifested at several different hierarchical…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
Based on a rigorous extension of classical statistical mechanics to networks, we study a specific microscopic network Hamiltonian. The form of this Hamiltonian is derived from the assumption that individual nodes increase/decrease their…
For graphs $H$, we study the extremal function $M_H(n)$ which is the maximum running time (until stabilisation) of an $H$-bootstrap percolation process on $n$ vertices. Building on previous work in the clique case $H=K_k$, we develop a…
Many networks in nature, society and technology are characterized by a mesoscopic level of organization, with groups of nodes forming tightly connected units, called communities or modules, that are only weakly linked to each other.…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
Random non-commutative geometries are a novel approach to taking a non-perturbative path integral over geometries. They were introduced in arxiv.org/abs/1510.01377, where a first examination was performed. During this examination we found…
Uncovering structural properties of ecological networks is a crucial starting point of studying the system's stability in response to various types of perturbations. We analyze pollination and seed disposal networks, which are…