June 4, 2024
Similar papers 2
June 1, 2023
Graph Neural Networks (GNNs) have become essential for studying complex data, particularly when represented as graphs. Their value is underpinned by their ability to reflect the intricacies of numerous areas, ranging from social to biological networks. GNNs can grapple with non-linear behaviors, emerging patterns, and complex connections; these are also typical characteristics of complex systems. The renormalization group (RG) theory has emerged as the language for studying c...
February 14, 2022
Complex networks usually exhibit a rich architecture organized over multiple intertwined scales. Information pathways are expected to pervade these scales reflecting structural insights that are not manifest from analyses of the network topology. Moreover, small-world effects correlate with the different network hierarchies complicating the identification of coexisting mesoscopic structures and functional cores. We present a communicability analysis of effective information p...
August 1, 2008
Nowadays, scaling methods for general large-scale complex networks have been developed. We proposed a new scaling scheme called "two-site scaling". This scheme was applied iteratively to various networks, and we observed how the degree distribution of the network changes by two-site scaling. In particular, networks constructed by the BA algorithm behave differently from the networks observed in the nature. In addition, an iterative scaling scheme can define a new renormalizin...
January 27, 2020
Recently, the concept of geometric renormalization group provides a good approach for studying the structural symmetry and functional invariance of complex networks. Along this line, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that...
January 11, 2023
Heterogeneous and complex networks represent the intertwined interactions between real-world elements or agents. A fundamental problem of complex network theory involves finding inherent partitions, clusters, or communities. By taking advantage of the recent Laplacian Renormalization Group approach, we scrutinize information diffusion pathways throughout networks to shed further light on this issue. Based on inter-node communicability, our definition provides a unifying frame...
September 23, 2020
Systems with lattice geometry can be renormalized exploiting their coordinates in metric space, which naturally define the coarse-grained nodes. By contrast, complex networks defy the usual techniques, due to their small-world character and lack of explicit geometric embedding. Current network renormalization approaches require strong assumptions (e.g. community structure, hyperbolicity, scale-free topology), thus remaining incompatible with generic graphs and ordinary lattic...
March 25, 2008
Recently, it has been claimed that some complex networks are self-similar under a convenient renormalization procedure. We present a general method to study renormalization flows in graphs. We find that the behavior of some variables under renormalization, such as the maximum number of connections of a node, obeys simple scaling laws, characterized by critical exponents. This is true for any class of graphs, from random to scale-free networks, from lattices to hierarchical gr...
July 18, 2011
Discrete amorphous materials are best described in terms of arbitrary networks which can be embedded in three dimensional space. Investigating the thermodynamic equilibrium as well as non-equilibrium behavior of such materials around second order phase transitions call for special techniques. We set up a renormalization group scheme by expanding an arbitrary scalar field living on the nodes of an arbitrary network, in terms of the eigenvectors of the normalized graph Laplac...
May 14, 2024
The Koopman operator has entered and transformed many research areas over the last years. Although the underlying concept$\unicode{x2013}$representing highly nonlinear dynamical systems by infinite-dimensional linear operators$\unicode{x2013}$has been known for a long time, the availability of large data sets and efficient machine learning algorithms for estimating the Koopman operator from data make this framework extremely powerful and popular. Koopman operator theory allow...
November 26, 2007
What is a complex network? How do we characterize complex networks? Which systems can be studied from a network approach? In this text, we motivate the use of complex networks to study and understand a broad panoply of systems, ranging from physics and biology to economy and sociology. Using basic tools from statistical physics, we will characterize the main types of networks found in nature. Moreover, the most recent trends in network research will be briefly discussed.