Related papers: Renormalization group for link percolation on plan…
We report on parallel observations in two seemingly unrelated areas of dynamical network research. The one is the so-called small world phenomenon and/or the observation of scale freeness in certain types of large (empirical) networks and…
Higher order networks are able to characterize data as different as functional brain networks, protein interaction networks and social networks beyond the framework of pairwise interactions. Most notably higher order networks include…
Complex networks are characterized by latent geometries induced by their topology or by the dynamics on the top of them. In the latter case, different network-driven processes induce distinct geometric features that can be captured by…
Comments: 4 pages RevTeX, 4 Postscript figures. References added. We study a two-dimensional granular superconducting network at the percolation threshold under the influence of an external perpendicular magnetic field. By numerical…
On a geometric model for complex networks (introduced by Krioukov et al.) we investigate the bootstrap percolation process. This model consists of random geometric graphs on the hyperbolic plane having $N$ vertices, a dependent version of…
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction function of two vertices denotes the similarity or proximity of the…
We continue the study of the renormalization group and decoupling of massive fields in curved space, started in the previous article and analyse the higher derivative sector of the vacuum metric-dependent action of the Standard Model. The…
Majority bootstrap percolation is a model of infection spreading in networks. Starting with a set of initially infected vertices, new vertices become infected once half of their neighbours are infected. Balogh, Bollob\'{a}s and Morris…
The permutation model is a classical spin system where elements of the symmetric group interact with one another. The partition function of this model is directly related to the entanglement structure of random quantum circuits and random…
We study Linial-Meshulam random 2-complexes, which are two-dimensional analogues of Erd\H{o}s-R\'enyi random graphs. We find the threshold for simple connectivity to be p = n^{-1/2}. This is in contrast to the threshold for vanishing of the…
Diffusion over networks has recently been used to define spatiotemporal scales and extend Kadanoff block spins of Euclidean space to supernodes of networks in the Laplacian renormalization group (LRG). Yet, its ad hoc coarse-graining…
Irreversible aggregation is revisited in view of recent work on renormalization of complex networks. Its scaling laws and phase transitions are related to percolation transitions seen in the latter. We illustrate our points by giving the…
We classify the polycyclic totally ordered simple dimension groups, i.e. dimension groups given by a dense embedding of n-dimensional lattice into the real line. Our method is based on the geometry of simple geodesics on the hyperbolic…
We study the quantum diffusion in quasiperiodic tight-binding models in one, two, and three dimensions. First, we investigate a class of one-dimensional quasiperiodic chains, in which the atoms are coupled by weak and strong bonds aligned…
We introduce a novel percolation model that generalizes the classical Random Connection Model (RCM) to a random simplicial complex, allowing for a more refined understanding of connectivity and emergence of large-scale structures in random…
Geometric and structural constraints greatly restrict the selection of folds adapted by protein backbones, and yet, folded proteins show an astounding diversity in functionality. For structure to have any bearing on function, it is thus…
We analyze a model that interpolates between scale-free and Erdos-Renyi networks. The model introduced generates a one-parameter family of networks and allows to analyze the role of structural heterogeneity. Analytical calculations are…
In this article, we investigate both site and bond percolation on a weighted planar stochastic lattice (WPSL) which is a multi-multifractal and whose dual is a scale-free network. The characteristic properties of percolation is that it…
Recent years have shown a promising progress in understanding geometric underpinnings behind the structure, function, and dynamics of many complex networks in nature and society. However these promises cannot be readily fulfilled and lead…
A new position-space renormalization group approach is investigated for bond directed percolation in two dimensions. The threshold value for the bond occupation probabilities is found to be $p_c=0.6443$. Correlation length exponents on time…