نتایج جستجو برای: probability graphs
تعداد نتایج: 312035 فیلتر نتایج به سال:
We study the strong spatial mixing (decay of correlation) property of proper q-colorings of random graphG(n, d/n) with a fixed d. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as G(n, d/n), an easy counterexample shows that colorings do not exh...
We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara’s Theorem relates the adjacency matrix of a graph to a matrix related to non-backtracking walks on the directed edges. We prove a weighted version of Ihara’s Theorem which relates the transition probability matrix of a non-ba...
We investigate important combinatorial and algorithmic properties of Gn,m,p random intersection graphs. In particular, we prove that with high probability (a) random intersection graphs are expanders, (b) random walks on such graphs are “rapidly mixing” (in particular they mix in logarithmic time) and (c) the cover time of random walks on such graphs is optimal (i.e. it is Θ(n log n)). All resu...
We examine the simultaneous embedding with fixed edges problem for two planar graphs G1 and G2 with the focus on their intersection S = G1∩G2. In particular, we will present the complete set of intersection graphs S that guarantee a simultaneous embedding with fixed edges for (G1, G2). More formally, we define the subset ISEFE of all planar graphs as follows: A graph S lies in ISEFE if every pa...
We prove that the unique decomposition of connected graphs defined by Tutte is definable by formulas of Monadic Second-Order Logic. This decomposition has two levels: every connected graph is a tree of "2-connected components" called blocks ; every 2-connected graph is a tree of so-called 3-blocks. Our proof uses 2dags which are certain acyclic orientations of the considered graphs. We obtain a...
The rank-width is a graph parameter related in terms of fixed functions to cliquewidth but more tractable. Clique-width has nice algorithmic properties, but no good “minor” relation is known analogous to graph minor embedding for tree-width. In this paper, we discuss the vertex-minor relation of graphs and its connection with rank-width. We prove a relationship between vertex-minors of bipartit...
..........................................................................................iii Table of contents.................................................................................iv List of Figures.................................................................................viii List of Tables......................................................................................x...
The aim of this article is to present a random graph representation, that is based on 2 order relations between graph elements, for modeling sets of attributed graphs (AGs). We refer to these models as second-order random graphs (SORGs). The basic feature of SORGs is that they include both marginal probability functions of graph elements and 2order joint probability functions. This allows a mor...
The first order language of graphs is a formal language in which one can express many properties of graphs — known as first order properties. The classic Zero-One law for random graphs states that if p is some constant probability then for every first order property the limiting probability of the binomial random graph G(n, p) having this property is either zero or one. The case of sparse rando...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید