Related papers: Criticality on networks with topology-dependent in…
Some epidemics have been empirically observed to exhibit outbreaks of all possible sizes, i.e., to be scalefree or scale-invariant. Different explanations for this finding have been put forward; among them there is a model for "accidental…
The analysis of networks characterized by links with heterogeneous intensity or weight suffers from two long-standing problems of arbitrariness. On one hand, the definitions of topological properties introduced for binary graphs can be…
We establish the theory of critical transport in amorphous Chern insulators and show that it lies beyond the current paradigm of topological criticality epitomized by the quantum Hall transitions. We consider models of Chern insulators on…
This study introduces a pore morphology algorithm that emphasizes the central role of topology in multiphase flow through porous media. Analysis of drainage in lattice-based pore networks identifies two key quantities, the percolation…
The dynamics based on information transfer is proposed as an underlying mechanism for the scale-invariant dynamic critical behavior observed in a variety of systems. We apply the dynamics to the globally-coupled Ising model, which is…
Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
We analyze the degree distribution's cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices $N$ is ruled by the topological constraints induced by the connectivity structure of the network.…
In this work we investigate non-Hermitian topological phase transitions using real-space edge states as a paradigmatic tool. We focus on the simplest non-Hermitian variant of the Su-Schrieffer-Hegger model, including a parameter that…
Random walks on simple graphs in connection with electrical resistor networks lead to the definition of Markov chains with transition probability matrix in terms of electrical conductances. We extend this definition to an effective…
We use mathematical methods from the theory of tailored random graphs to study systematically the effects of sampling on topological features of large biological signalling networks. Our aim in doing so is to increase our quantitative…
Unlike classical centrality measures, recently developed community-aware centrality measures use a network's community structure to identify influential nodes in complex networks. This paper investigates their relationship on a set of fifty…
Real-world complex systems exhibit multiple levels of relationships. In many cases, they require to be modeled by interconnected multilayer networks, characterizing interactions on several levels simultaneously. It is of crucial importance…
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…
We study how the opinions of a group of individuals determine their spatial distribution and connectivity, through an agent-based model. The interaction between agents is described by a Potts-like Hamiltonian in which agents are allowed to…
As the understanding of the importance of social contact networks in the spread of infectious diseases has increased, so has the interest in understanding the feedback process of the disease altering the social network. While many studies…
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…
Methods connecting dynamical systems and graph theory have attracted increasing interest in the past few years, with applications ranging from a detailed comparison of different kinds of dynamics to the characterisation of empirical data.…
Most networks encountered in nature, society, and technology have weighted edges, representing the strength of the interaction/association between their vertices. Randomizing the structure of a network is a classic procedure used to…
The dynamics of critical slope self-organized critical models is studied, using a previous mapping into a linear interface depinning model dragged at one end. The model is solved obtaining the complete set of scaling exponents. Some results…