相关论文: Potential energy of complex networks: a novel pers…

Discriminating between correct and incorrect substrates is a core process in biology but how is energy apportioned between the conflicting demands of accuracy ($\mu$), speed ($\sigma$) and total entropy production rate ($P$)? Previous…

An anomalous mean-field solution is known to capture the non trivial phase diagram of the Ising model in annealed complex networks. Nevertheless the critical fluctuations in random complex networks remain mean-field. Here we show that a…

Heterogeneous networks play a key role in the evolution of communities and the decisions individuals make. These networks link different types of entities, for example, people and the events they attend. Network analysis algorithms usually…

In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is…

This paper proves endpoint Strichartz estimates for the linear Schroedinger equation in $R^3$, with a time-dependent potential that keeps a constant profile and is subject to a rough motion, which need not be differentiable and may be large…

Power grids are undergoing major changes from a few large producers to smart grids build upon renewable energies. Mathematical models for power grid dynamics have to be adapted to capture, when dynamic nodes can achieve synchronization to a…

We study the spreading of renewable power fluctuations through grids with Ohmic losses on the lines. By formulating a network adapted linear response theory, we find that vulnerability patterns are linked to the left Laplacian eigenvectors…

We have developed different network approaches to analyze complex patterns of frictional interfaces (contact area developments). Network theory is a fundamental tool for the modern understanding of complex systems in which, by a simple…

We analyze critical phenomena on networks generated as the union of hidden variables models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small-worlds similar to those a` la Watts and…

We study an inverse scattering problem associated with a Schr\"odinger system where both the potential and source terms are random and unknown. The well-posedness of the forward scattering problem is first established in a proper sense. We…

In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with $n$ randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the…

A fundamental problem in studying and modeling economic and financial systems is represented by privacy issues, which put severe limitations on the amount of accessible information. Here we introduce a novel, highly nontrivial method to…

We propose a new measure to characterize the dimension of complex networks based on the ergodic theory of dynamical systems. This measure is derived from the correlation sum of a trajectory generated by a random walker navigating the…

In many real complex networks, the fractal and self-similarity properties have been found. The fractal dimension is a useful method to describe fractal property of complex networks. Fractal analysis is inadequate if only taking one fractal…

A benchmark-quality potential energy curve is reported for the H$_3$ system in collinear nuclear configurations. The electronic Schr\"odinger equation is solved using explicitly correlated Gaussian (ECG) basis functions using an optimized…

Theoretical treatments of strong-field physics have long relied on the numerical solution of the time-dependent Schr\"odinger equation. The most effective such treatments utilize a discrete spatial representation---a grid. Since most…

In recent years complex networks have gained increasing attention in different fields of science and engineering. The problem of controlling these networks is an interesting and challenging problem to investigate. In this paper we look at…

In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open…

A variety of metrics have been proposed to measure the relative importance of nodes in a network. One of these, alpha-centrality [Bonacich, 2001], measures the number of attenuated paths that exist between nodes. We introduce a normalized…

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping…