Sep 2026· Concurrency and Computation· 0 citations· 21 references
TL;DR
Two new methods for efficiently computing the influence of all nodes under the SIR model are proposed, BS and BI, which removes the REP and MCP pruning techniques from BSRM and extends BS by integrating SCC assignment and reachability computation.
Abstract
We study the problem of efficiently computing the influence of all nodes under the SIR model. In our previous work, we proposed the burn‐Out extracted LC (BELC) technique and combined it with existing techniques to develop the BSRM method. In this paper, we propose two new methods, BS and BI. BS removes the REP and MCP pruning techniques from BSRM. BI extends BS by integrating SCC assignment and reachability computation. Experiments on four large‐scale networks show that the proposed methods are faster while producing the same influence values. We also analyze how network structure affects their performance.
Braess paradox is a well-known phenomenon that originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges. The possibility of having the paradox was called vulnerability by Roughgarden in 2006 and was characterized later on by graph-theoretical notions, both for undirected an...
The results show that GNNV provides tighter robustness guarantees than CORA on graph classification models with ReLU-based activations and, for the first time, delivers edge-aware robustness guarantees for GINE-based PF and OPF models under joint node and edge perturbations.
Anne M. Tumlin, Ben Wooding, Zhenxuan Shao et al.· SAIV· 1 citation
Process discovery is one of the central challenges in process mining. Petri nets are particularly attractive because simple local constructs can express complex behavior, including concurrency. While their global behavior may be difficult to analyze, individual places can be efficiently characterized using monotonic pr...
Leah Tacke genannt Unterberg, L. Mannel, W. V. D. van der Aalst· 0 citations
Structural analysis is a core method in Petri Net (PN) research, offering a perspective complementary to state-space techniques while avoiding many of their limitations. It is well studied for classical PNs but far less for High-Level Petri Nets (HLPN). Symmetric Nets (SN), a common HLPN formalism, use compact annotati...
Lorenzo Capra· Electronic Proceedings in Th...· 0 citations
In this work, we introduce the generalized reach-avoid (GRA) task, which both extends and unifies the canonical tasks of Hamilton-Jacobi Reachability (HJR). We show that the GRA not only serves as a common primitive in this class of fundamental tasks, but also strictly extends the fundamental tasks that can be solved w...
Dylan Hirsch, Will Sharpless, Donggun Lee et al.· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
