相关论文: Equal relation between the extra connectivity and …

Network reliability measures the probability that a target node is reachable from a source node in an uncertain graph, i.e., a graph where every edge is associated with a probability of existence. In this paper, we investigate the novel and…

During major power system disturbances, when multiple component outages occur in rapid succession, it becomes crucial to quickly identify the transmission interconnections that have limited power transfer capability. Understanding the…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

In a networked system, functionality can be seriously endangered when nodes are infected, due to internal random failures or a contagious virus that develops into an epidemic. Given a snapshot of the network representing the nodes' states…

Prompt learning has demonstrated impressive efficacy in the fine-tuning of multimodal large models to a wide range of downstream tasks. Nonetheless, applying existing prompt learning methods for the diagnosis of neurological disorder still…

We study the epidemic source detection problem in contact tracing networks modeled as a graph-constrained maximum likelihood estimation problem using the susceptible-infected model in epidemiology. Based on a snapshot observation of the…

In this paper we present an elaborated graph-based algorithmic technique for efficient malware detection. More precisely, we utilize the system-call dependency graphs (or, for short ScD graphs), obtained by capturing taint analysis traces…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…

The stochastic block model is a canonical model of communities in random graphs. It was introduced in the social sciences and statistics as a model of communities, and in theoretical computer science as an average case model for graph…

For two integers $r\geq 2$ and $h\geq 0$, the $h$-extra $r$-component connectivity of a graph $G$, denoted by $c\kappa_{r}^{h}$, is defined as the minimum number of vertices whose removal produces a disconnected graph with at least $r$…

This paper considers the conditional fault tolerance, $h$-super connectivity $\kappa^{h}$ and $h$-super edge-connectivity $\lambda^{h}$ of the hierarchical cubic network $HCN_n$, an attractive alternative network to the hypercube, and shows…

Consider a graph $\Gamma$. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic vertex cutset, then it…

Probabilistic computers built from p-bits offer a promising path for combinatorial optimization, but the dense connectivity required by real-world problems scales poorly in hardware. Here, we address this through graph sparsification with…

In an earlier work, finite groups whose power graphs are minimally edge connected have been classified. In this article, first we obtain a necessary and sufficient condition for an arbitrary graph to be minimally edge connected.…

We consider the task of estimating a high-dimensional directed acyclic graph, given observations from a linear structural equation model with arbitrary noise distribution. By exploiting properties of common random graphs, we develop a new…

Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…

This paper studies the problem of jointly estimating multiple network processes driven by a common unknown input, thus effectively generalizing the classical blind multi-channel identification problem to graphs. More precisely, we model…

Optimizing parameters of Two-Prover-One-Round Game (2P1R) is an important task in PCPs literature as it would imply a smaller PCP with the same or stronger soundness. While this is a basic question in PCPs community, the connection between…

Uncovering anomalies in attributed networks has recently gained popularity due to its importance in unveiling outliers and flagging adversarial behavior in a gamut of data and network science applications including {the Internet of Things…

We introduce a measure of {\em greedy connectivity} for geographical networks (graphs embedded in space) and where the search for connecting paths relies only on local information, such as a node's location and that of its neighbors.…