Related papers: Spanning tree modulus for secure broadcast games
Methods for learning Bayesian network structure can discover dependency structure between observed variables, and have been shown to be useful in many applications. However, in domains that involve a large number of variables, the space of…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning…
We continue our studies of burn-off chip-firing games from [Discrete Math. Theor. Comput. Sci. 15 (2013), no. 1, 121-132; MR3040546] and [Australas. J. Combin. 68 (2017), no. 3, 330-345; MR3656659]. The latter article introduced randomness…
For a family of multidimensional gambler models we provide formulas for the winning probabilities (in terms of parameters of the system) and for the distribution of game duration (in terms of eigenvalues of underlying one-dimensional…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…
The problem of probabilistic verification of a neural network investigates the probability of satisfying the safe constraints in the output space when the input is given by a probability distribution. It is significant to answer this…
A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this…
Many packing, scheduling and covering problems that were previously considered by computer science literature in the context of various transportation and production problems, appear also suitable for describing and modeling various…
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…
Feature-based SPL analysis and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominent example is mu-calculus model checking, which is generally…
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance. In particular, the incidence graph of the CSP instance…
A secure set $S$ in a graph is defined as a set of vertices such that for any $X\subseteq S$ the majority of vertices in the neighborhood of $X$ belongs to $S$. It is known that deciding whether a set $S$ is secure in a graph is…
Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of moments approach that can be used to fit a…
Network structure is a mechanism for promoting cooperation in social dilemma games. In the present study, we explore graph surgery, i.e., to slightly perturb the given network, towards a network that better fosters cooperation. To this end,…
Two-player games on graphs is central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can…
Formal analyses of incentives for compliance with network protocols often appeal to game-theoretic models and concepts. Applications of game-theoretic analysis to network security have generally been limited to highly stylized models, where…
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…
We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of…