Corpus ID: 232320653

Mittag-Leffler functions and their applications in network science

@article{Arrigo2021MittagLefflerFA,
  title={Mittag-Leffler functions and their applications in network science},
  author={F. Arrigo and Fabio Durastante},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.12559}
}
We describe a complete theory for walk-based centrality indices in complex networks defined in terms of Mittag–Leffler functions. This overarching theory includes as special cases wellknown centrality measures like subgraph centrality and Katz centrality. The indices we introduce are parametrized by two numbers; by letting these vary, we show that Mittag–Leffler centralities interpolate between degree and eigenvector centrality, as well as between resolvent-based and exponential-based indices… Expand

References

SHOWING 1-10 OF 51 REFERENCES
On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
TLDR
This work considers a broad class of walk-based, parameterized node centrality measures for network analysis and shows that the parameter can be “tuned" to interpolate between degree and eigenvector centralities, which appear as limiting cases. Expand
A dynamical systems view of network centrality
  • P. Grindrod, D. Higham
  • Computer Science, Medicine
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2014
TLDR
A new mathematical framework where network evolution is handled over continuous time is developed, giving an elegant dynamical systems representation for the important concept of node centrality and explains why it is cheaper to track good receivers of information than good broadcasters. Expand
Generalized walks-based centrality measures for complex biological networks.
TLDR
It is shown here that the use of centrality indices based on the zooming in strategy identifies a larger number of essential proteins in the yeast PPI network than any of the other centrality measures studied. Expand
Subgraph centrality in complex networks.
TLDR
A new centrality measure that characterizes the participation of each node in all subgraphs in a network, C(S)(i), which is better able to discriminate the nodes of a network than alternate measures such as degree, closeness, betweenness, and eigenvector centralities. Expand
A new status index derived from sociometric analysis
TLDR
A new method of computation which takes into account who chooses as well as how many choose is presented, which introduces the concept of attenuation in influence transmitted through intermediaries. Expand
Beyond non-backtracking: non-cycling network centrality measures
TLDR
This work uses the Hashimoto matrix construction to characterize, generalize and study non-backtracking centrality measures, and devise a recursive extension that systematically removes triangles, squares and, generally, all cycles up to a given length. Expand
Fractional-order susceptible-infected model: Definition and applications to the study of COVID-19 main protease
TLDR
It is found that the perturbations produced by strong inhibitors of the protease are propagated far away from the binding site, confirming the long-range nature of intra-protein communication. Expand
Topological Analysis of SARS CoV-2 Main Protease
TLDR
There is an urgent necessity of effective medication against SARS CoV-2, which is producing the COVID-19 pandemic across the world, because its main protease (Mpro) represents an attractive pharmacological target due to its involvement in essential viral functions and the strongest inhibitors of this enzyme are those that produce the least change of this capacity of transmitting perturbations across the protein. Expand
Analysis of directed networks via the matrix exponential
TLDR
Some methods to identify important nodes in a directed network using the matrix exponential are discussed, taking into account that the notion of importance changes whether the authors consider the influence of a given node along the edge directions or how it is influenced by directed paths that point to it (upstream influence). Expand
Non-Backtracking Alternating Walks
TLDR
The combinatorics of walks on a graph is a key topic in network science and this work combines two features that have previously been considered in this area. Expand
...
1
2
3
4
5
...