3.8k citations · 4k across the 21 of their papers we have counts for
21 papers
Flow Subgraphs and Flow Network Design under End-to-End Power Dissipation Constraints
Zhihao Qiu, Xinhan Liu, Rogier Noldus +1
We investigate how the underlying graph of a network supports a flow between a source node and a destination node and propose to compute the expected number of nodes and links that…
Geometric Organization and Inference of Shortest Path Nodes in Soft Random Geometric Graphs
Zhihao Qiu, Sámuel G. Balogh, Xinhan Liu +2
The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the…
Corrigendum to "Degree-Based Approximations for Network Reliability Polynomials". Comment on J. Complex Networks 2025, 13, cnaf001
Xinhan Liu, Piet Van Mieghem
Our original paper \cite{VanMieghem2025} described the stochastic approximation in \cite[eq. (2.2)]{VanMieghem2025} and the first-o…
Some Laplacian eigenvalues can be computed by matrix perturbation
Piet Van Mieghem, Yingyue Ke
Based on matrix perturbation theory, closed-form analytic expansions are studied for a Laplacian eigenvalue of an undirected, possibly weighted graph, which is close to a unique de…
The spectral degree exponent of a graph
Massimo A. Achterberg, Piet Van Mieghem
We propose the spectral degree exponent as a novel graph metric. Although Hofmeister \cite{HofmeisterThesis} has studied the same metric, we generalise Hofmeister's work to weighte…
Node Reliability: Approximation, Upper Bounds, and Applications to Network Robustness
Xinhan Liu, Robert Kooij, Piet Van Mieghem
This paper discusses the reliability of a graph in which the links are perfectly reliable but the nodes may fail with certain probability p. Calculating graph node reliability is a…