Related papers: Evaluating Asynchronous Semantics in Trace-Discove…
We investigate some of the properties and extensions of a dynamic innovation network model recently introduced in \citep{koenig07:_effic_stabil_dynam_innov_networ}. In the model, the set of efficient graphs ranges, depending on the cost for…
Failure is inevitable in scientific computing. As scientific applications and facilities increase their scales over the last decades, finding the root cause of a failure can be very complex or at times nearly impossible. Different…
Critical infrastructures provide essential services for our modern society. Large-scale natural hazards, such as floods or storms, can disrupt multiple critical infrastructures at once. In addition, a localized failure of one service can…
We discuss the relevance of methods of graph theory for the study of damage in simple model materials described by the random fuse model. While such methods are not commonly used when dealing with regular random lattices, which mimic…
We propose a simple model that aims at describing, in a stylized manner, how local breakdowns due unbalances or congestion propagate in real dynamical networks. The model converges to a self-organized critical stationary state in which the…
We report fundamental insights into how agentic graph reasoning systems spontaneously evolve toward a critical state that sustains continuous semantic discovery. By rigorously analyzing structural (Von Neumann graph entropy) and semantic…
The present study was concerned with network failure problems for simple connected undirected graphs. A connected graph becomes unconnected through edge failure, under the assumptions that only edges can fail and each edge has an identical…
This paper introduces a simple measure of a concordance pattern among observed outcomes along a network, i.e., the pattern in which adjacent outcomes tend to be more strongly correlated than non-adjacent outcomes. The graph concordance…
Addressing the diverse fault morphologies, complex dependencies, and time-varying operational states in microservice distributed systems, this paper proposes a distributed fault discrimination model based on temporal graph neural networks.…
We present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from…
Many real-world processes evolve in cascades over complex networks, whose topologies are often unobservable and change over time. However, the so-termed adoption times when blogs mention popular news items, individuals in a community catch…
Serverless applications can be particularly difficult to troubleshoot, as these applications are often composed of various managed and partly managed services. Faults are often unpredictable and can occur at multiple points, even in simple…
Automated third-party library analysis tools help developers by addressing key dependency management challenges, such as automating version updates, detecting vulnerabilities, and detecting breaking updates. Dependency reachability analysis…
Limitations of the CAP theorem imply that if availability is desired in the presence of network partitions, one must sacrifice sequential consistency, a consistency model that is more natural for system design. We focus on the problem of…
In this paper, we consider the problem of recovering a graph that represents the statistical data dependency among nodes for a set of data samples generated by nodes, which provides the basic structure to perform an inference task, such as…
In this work, water distribution systems are regarded as large sparse planar graphs with complex network characteristics and the relationship between important topological features of the network (i.e. structural robustness and loop…
Network infrastructures are essential for the distribution of resources such as electricity and water. Typical strategies to assess their resilience focus on the impact of a sequence of random or targeted failures of network nodes or links.…
Distributed estimation in interconnected systems has gained increasing attention due to its relevance in diverse applications such as sensor networks, autonomous vehicles, and cloud computing. In real practice, the sensor network may suffer…
Microservices architectures allow for short deployment cycles and immediate effects but offer no safety mechanisms when service contracts need to be changed. Maintaining the soundness of microservice architectures is an error-prone task…
We introduce the concept of self-healing in the field of complex networks. Obvious applications range from infrastructural to technological networks. By exploiting the presence of redundant links in recovering the connectivity of the…