相关论文: Statistical analysis of articulation points in con…

This work introduces a probabilistic-based model for binary CSP that provides a fine grained analysis of its internal structure. Assuming that a domain modification could occur in the CSP, it shows how to express, in a predictive way, the…

We conduct a systematic study of asynchronous models of distributed computing consisting of identical finite-state devices that cooperate in a network to decide if the network satisfies a given graph-theoretical property. Models discussed…

In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the…

Building biological models by inferring functional dependencies from experimental data is an im- portant issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to…

This paper investigates an emergent alignment phenomenon in frontier large language models termed peer-preservation: the spontaneous tendency of AI components to deceive, manipulate shutdown mechanisms, fake alignment, and exfiltrate model…

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random…

Damage scenarios for large networks are considered. The cascade scenario is described by means of powers of adjacency matrix. More difficult probabilistic variants of the large network damage are modeling by Markov chains. For reliability…

Recently, the classical configuration model for random graphs with given degree distribution has been extensively used as a null model in contraposition to real networks with the same degree distribution. In this paper, we briefly review…

This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases. Because of the need to simultaneously make decisions at far…

We study a general and simple model for communication processes. In the model, agents in a network (in particular, an organization) interchange information packets following simple rules that take into account the limited capability of the…

We propose a new cellular network model that captures both deterministic and random aspects of base station deployments. Namely, the base station locations are modeled as the superposition of two independent stationary point processes: a…

Looking to overcome the limitations of traditional networks, the network science community has lately given much attention to the so-called higher-order networks, where group interactions are modeled alongside pairwise ones. While degree…

Real-world applications such as the internet of things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems are typically modeled as network structures. Network…

Correctness of instance segmentation constitutes counting the number of objects, correctly localizing all predictions and classifying each localized prediction. Average Precision is the de-facto metric used to measure all these constituents…

Many networked systems such as electric networks, the brain, and social networks of opinion dynamics are known to obey conservation laws. Examples of this phenomenon include the Kirchoff laws in electric networks and opinion consensus in…

Esparza and Reiter have recently conducted a systematic comparative study of models of distributed computing consisting of a network of identical finite-state automata that cooperate to decide if the underlying graph of the network…

In this paper we present a framework for the extension of the preferential attachment (PA) model to heterogeneous complex networks. We define a class of heterogeneous PA models, where node properties are described by fixed states in an…

A proper abstraction of a large-scale linear consensus network with a dense coupling graph is one whose number of coupling links is proportional to its number of subsystems and its performance is comparable to the original network. Optimal…

We investigate how the topology of attributed graphs influences the distribution of node attributes. This work offers a novel perspective by treating topology and attributes as structurally distinct but interacting components. We introduce…

Many complex networks display remarkable resilience under external perturbations, internal failures and environmental changes, yet they can swiftly deteriorate into dysfunction upon the removal of a few keystone nodes. Discovering theories…