Related papers: Mesoscopic scales in hierarchical configuration mo…
We investigate percolation on growing networks where the evolution of connected components resembles a non-equilibrium version of the multiplicative coalescent. The supercritical $\pi> \pi_c$ regime for a host of such models was conjectured…
Hierarchical networks actually have many applications in the real world. Firstly, we propose a new class of hierarchical networks with scale-free and fractal structure, which are the networks with triangles compared to traditional…
Real-world networks exhibit universal structural properties such as sparsity, small-worldness, heterogeneous degree distributions, high clustering, and community structures. Geometric network models, particularly Random Hyperbolic Graphs…
Meso-scale structures in signed networks have been studied under the limiting assumption of the validity of social balance theory, which predicts positive connections within groups and negative connections between groups. Here, we propose…
Network science plays an increasingly important role to model complex data in many scientific disciplines. One notable feature of network organization is community structure, which refers to clusters of tightly interconnected nodes. A…
We consider analytically as well as numerically the finite-size scaling behavior in the stationary state near the non-equilibrium phase transition of directed percolation within the mean field regime, i.e., above the upper critical…
Adaptive transport networks in biological and physical systems exhibit hierarchical organization, characteristic channel spacing, and robust scaling relations. Existing adaptive network models, formulated on a lattice, successfully…
The critical dynamics of conformal field theories on random surfaces is investigated beyond the previously studied dynamics of the overall area and the genus. It is found that the evolution of the order parameter in physical time performs a…
To characterize the dynamical features of seismicity as a complex phenomenon, the seismic data is mapped to a growing random graph, which is a small-world scale-free network. Here, hierarchical and mixing properties of such a network are…
Community structures have been identified in various complex real-world networks, for example, communication, information, internet and shareholder networks. The scaling of community size distribution indicates the heterogeneity in the…
Hypergraphs are widely adopted tools to examine systems with higher-order interactions. Despite recent advancements in methods for community detection in these systems, we still lack a theoretical analysis of their detectability limits.…
Adaptive dynamical networks appear in various real-word systems. One of the simplest phenomenological models for investigating basic properties of adaptive networks is the system of coupled phase oscillators with adaptive couplings. In this…
The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…
Exponential-family random graph models (ERGMs) provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without…
The lecture delivered at the \emph{Current Developments in Mathematics} conference (Harvard-MIT, 2021) focused on the recent proof of the Gaussian structure of the scaling limits of the critical Ising and $\varphi^4$ fields in the marginal…
One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…
We consider cumulative merging percolation (CMP), a long-range percolation process describing the iterative merging of clusters in networks, depending on their mass and mutual distance. For a specific class of CMP processes, which…
Simplicial complex (SC) representation is an elegant mathematical framework for representing the effect of complexes or groups with higher-order interactions in a variety of complex systems ranging from brain networks to social…
In this paper, we introduce a hierarchical extension of the stochastic blockmodel to identify multilevel community structures in networks. We also present a Markov chain Monte Carlo (MCMC) and a variational Bayes algorithm to fit the model…
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches…