相关论文: Invasion percolation and global optimization

The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…

We parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.

Influence Diagrams (ID) are a flexible tool to represent discrete stochastic optimization problems, including Markov Decision Process (MDP) and Partially Observable MDP as standard examples. More precisely, given random variables considered…

Given a hypergraph $H$, the Minimum Connectivity Inference problem asks for a graph on the same vertex set as $H$ with the minimum number of edges such that the subgraph induced by every hyperedge of $H$ is connected. This problem has…

Recombining trinomial trees are a workhorse for modeling discrete-event systems in option pricing, logistics, and feedback control. Because each node stores a state-dependent quantity, a depth-$D$ tree naively yields $\mathcal{O}(3^{D})$…

A new method (`explosive immunization' (EI)) is proposed for immunization and targeted destruction of networks. It combines the explosive percolation (EP) paradigm with the idea of maintaining a fragmented distribution of clusters. The…

We present percolation strategies based on multipartite measurements to propagate entanglement in quantum networks. We consider networks spanned on regular lattices whose bonds correspond to pure but non-maximally entangled pairs of qubits,…

Spanning tree problems with specialized constraints can be difficult to solve in real-world scenarios, often requiring intricate algorithmic design and exponential time. Recently, there has been growing interest in end-to-end deep neural…

Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order…

We consider percolation on interdependent locally treelike networks, recently introduced by Buldyrev et al., Nature 464, 1025 (2010), and demonstrate that the problem can be simplified conceptually by deleting all references to cascades of…

Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…

The recently developed atom-bond sum-connection (ABS) index is a variation of the well-studied graph-based molecular descriptors connectivity (Randic), atom-bond connectivity, and sum-connectivity indices.We present the minimum ABS index of…

Several approaches to mitigating the Forwarding Information Base (FIB) overflow problem were developed and software solutions using FIB aggregation are of particular interest. One of the greatest concerns to deploy these algorithms to real…

This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…

Given an undirected, weighted graph, the minimum spanning tree (MST) is a tree that connects all of the vertices of the graph with minimum sum of edge weights. In real world applications, network designers often seek to quickly find a…

We study the SIR ("susceptible, infected, removed/recovered") model on directed graphs with heterogeneous transmission probabilities within the message-passing approximation. We characterize the percolation transition, predict cluster size…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…

For a given graph $G$, a maximum internal spanning tree of $G$ is a spanning tree of $G$ with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem is to find a maximum internal spanning tree of the given…

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square,…

We study the problem of efficient adversarial attacks on tree based ensembles such as gradient boosting decision trees (GBDTs) and random forests (RFs). Since these models are non-continuous step functions and gradient does not exist, most…