The mean first-passage time (MFPT), which refers to the expected time it takes for a system
to reach a state j given its current state i, that is t ji, falls under the fundamental theory of …

The Katz centrality of a node in a complex network is a measure of the node's importance as
far as the flow of information across the network is concerned. For ensembles of locally tree …

The advent of memristive devices offers a promising avenue for efficient and scalable
analog computing, particularly for linear algebra operations essential in various scientific …

This paper is concerned with upstreamness and downstreamness of industries and
countries in global value chains. Upstreamness and downstreamness measure respectively …

Many complex systems exhibit a natural hierarchy in which elements can be ranked
according to a notion of “influence”. While the complete and accurate knowledge of the …

Ranking sectors and countries within global value chains is of paramount importance to
estimate risks and forecast growth in large economies. However, this task is often nontrivial …

Random walks are a common model for the exploration and discovery of complex networks.
While numerous algorithms have been proposed to map out an unknown network, a …

In this work we propose a novel method to calculate mean first-passage times (MFPTs) for
random walks on graphs, based on a dimensionality reduction technique for Markov state …

We compute analytically the distribution and moments of the largest eigenvalues/singular
values and resolvent statistics for random matrices with (i) non-negative entries,(ii) small …

Random assemblies of magnetic nanowires represent a unique class of materials with
promising applications in spintronics and information storage. These assemblies exhibit …