Related papers: Weighted dependency graphs and the Ising model
A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. Following analogous studies in the literature related to independent sets, dominating sets, and total dominating sets, we study in this…
In a multiplex network, a set of nodes is connected by different types of interactions, each represented as a separate layer within the network. Multiplexes have emerged as a key instrument for modeling large-scale complex systems, due to…
Inspired by scientific collaboration networks, especially our empirical analysis of the network of econophysicists, an evolutionary model for weighted networks is proposed. Both degree-driven and weight-driven models are considered.…
This article presents an extended model of gravity obtained by gauging the AdS-Mawell algebra. It involves additional fields that shift the spin connection, leading effectively to theory of two independent connections. Extension of…
A variety of statistical graphical models have been defined to represent the conditional independences underlying a random vector of interest. Similarly, many different graphs embedding various types of preferential independences, as for…
We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…
Let $p$ be a prime number and let $d$ be a positive integer. In this paper, we generalize Iwasawa theory for graphs initiated by Gonet and Valli\`{e}res to weighted graphs. In particular, we prove an analogue of Iwasawa's class number…
Even though classic theories and models of discrete choice pose man as a rational being, it has been shown extensively that people persistently violate rationality in their actual choices. Recent models of decision-making take these…
An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…
In this article we study algorithmic synthesis of the class of stabilizing switching signals for discrete-time switched linear systems proposed in [12]. A weighted digraph is associated in a natural way to a switched system, and the…
By applying a recently proposed mapping, we derive exactly the upper phase boundary of several Ising spin glass models defined over static graphs and random graphs, generalizing some known results and providing new ones.
We study the two-dimensional Ising model on a network with a novel type of quenched topological (connectivity) disorder. We construct random lattices of constant coordination number and perform large scale Monte Carlo simulations in order…
In the first part of this paper, we consider weighted domination in the case where the vertices of the complete graph on~\(n\) vertices are equipped with independent and identically distributed (i.i.d.) weights. We use the probabilistic…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…
We solve a 4-(bond)-vertex model on an ensemble of 3-regular Phi3 planar random graphs, which has the effect of coupling the vertex model to 2D quantum gravity. The method of solution, by mapping onto an Ising model in field, is inspired by…
In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…
A graph is $\mathcal{R}_d$-independent (resp. $\mathcal{R}_d$-connected) if its $d$-dimensional generic rigidity matroid is free (resp. connected). A result of Maxwell from 1867 implies that every $\mathcal{R}_d$-independent graph satisfies…
The paper introduces a generalization for known probabilistic models such as log-linear and graphical models, called here multiplicative models. These models, that express probabilities via product of parameters are shown to capture…
In this paper, we present examples of the cyclic sieving phenomenon coming from studying independent sets in graphs of a fixed size k. Given a graph G, and a cyclic group C acting on the graph, then C also acts on the collection of…