Related papers: Frequency clustering and disaggregation in idealiz…
A random network model which allows for tunable, quite general forms of clustering, degree correlation and degree distribution is defined. The model is an extension of the configuration model, in which stubs (half-edges) are paired to form…
Neuronal dendrites form densely branched tree architectures through which mitochondria must be distributed to supply the cell's energetic needs. Dendritic mitochondria circulate through the tree, undergoing fusion and fission to form…
We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…
We consider the observability model in networks with arbitrary topologies. We introduce a system of coupled nonlinear equations, valid under the locally tree-like ansatz, to describe the size of the largest observable cluster as a function…
The rigidity transition occurs when, as the density of microscopic components is increased, a disordered medium becomes able to transmit and ensure macroscopic mechanical stability, owing to the appearance of a space-spanning rigid…
Recent evidence indicates that the abundance of recurring elementary interaction patterns in complex networks, often called subgraphs or motifs, carry significant information about their function and overall organization. Yet, the…
Decompositions of networks are useful not only for structural exploration. They also have implications and use in analysis and computational solution of processes (such as the Ising model, percolation, SIR model) running on a given network.…
Networks growing according to the rule that every new node has a probability p_k of being attached to k preexisting nodes, have a universal phase diagram and exhibit power law decays of the distribution of cluster sizes in the…
We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent $2<\gamma<3$. Degree heterogeneity increases the presence of triangles in…
We explore the concepts of self-similarity, dimensionality, and (multi)scaling in a new family of recursive scale-free nets that yield themselves to exact analysis through renormalization techniques. All nets in this family are self-similar…
Globally conserved interface-controlled coarsening of fractal clusters exhibits dynamic scale invariance and normal scaling. This is demonstrated by a numerical solution of the Ginzburg-Landau equation with a global conservation law. The…
We investigate whether the dynamical status of clusters is related to the large-scale structure of the Universe. We find that cluster substructure is strongly correlated with the tendency of clusters to be aligned with their nearest…
This paper investigates whether nonlinear gravitational instability can account for the clustering of galaxies on large and small scales, and for the evolution of clustering with epoch. No CDM-like spectrum is consistent with the shape of…
A fractal is in essence a hierarchy with cascade structure, which can be described with a set of exponential functions. From these exponential functions, a set of power laws indicative of scaling can be derived. Hierarchy structure and…
We show that an intricate relation of cluster properties and optimal bipartitions, which takes place in undirected random graphs, extends to directed and mixed random graphs. In particular, the satisfability threshold coincides with the…
Percolation processes on random networks have been the subject of intense research activity over the last decades: the overall phenomenology of standard percolation on uncorrelated and unclustered topologies is well known. Still some…
An analytical approach to calculating bond percolation thresholds, sizes of $k$-cores, and sizes of giant connected components on structured random networks with non-zero clustering is presented. The networks are generated using a…
We study the scaling of the average cluster size and percolation strength of geometrical clusters for the two-dimensional Ising model. By means of Monte Carlo simulations and a finite-size scaling analysis we discuss the appearance of…
Fractals represent one of the fundamental manifestations of complexity, and fractal networks serve as tools for characterizing and investigating the fractal structures and properties of large-scale systems. Higher-order networks have…
A thorough discussion of the statistical ensemble of scale-free connected random tree graphs is presented. Methods borrowed from field theory are used to define the ensemble and to study analytically its properties. The ensemble is…