Results 1  10
of
427,428
The C ∗ algebras of arbitrary graphs
 Rocky Mountain J. Math
"... Abstract. To an arbitrary directed graph we associate a rowfinite directed graph whose C ∗algebra contains the C ∗algebra of the original graph as a full corner. This allows us to generalize results for C ∗algebras of rowfinite graphs to C ∗algebras of arbitrary graphs: the uniqueness theorem, ..."
Abstract

Cited by 74 (29 self)
 Add to MetaCart
Abstract. To an arbitrary directed graph we associate a rowfinite directed graph whose C ∗algebra contains the C ∗algebra of the original graph as a full corner. This allows us to generalize results for C ∗algebras of rowfinite graphs to C ∗algebras of arbitrary graphs: the uniqueness theorem
Cogrowth of Arbitrary Graphs
"... Abstract. A “cogrowth set ” of a graph G is the set of vertices in the universal cover of G which are mapped by the universal covering map onto a given vertex of G. Roughly speaking, a cogrowth set is large if and only if G is small. In particular, when G is regular, a cogrowth constant (a measure o ..."
Abstract
 Add to MetaCart
Abstract. A “cogrowth set ” of a graph G is the set of vertices in the universal cover of G which are mapped by the universal covering map onto a given vertex of G. Roughly speaking, a cogrowth set is large if and only if G is small. In particular, when G is regular, a cogrowth constant (a measure
On the Optimality of Solutions of the MaxProduct Belief Propagation Algorithm in Arbitrary Graphs
, 2001
"... Graphical models, suchasBayesian networks and Markov random fields, represent statistical dependencies of variables by a graph. The maxproduct "belief propagation" algorithm is a localmessage passing algorithm on this graph that is known to converge to a unique fixed point when the gra ..."
Abstract

Cited by 242 (15 self)
 Add to MetaCart
Graphical models, suchasBayesian networks and Markov random fields, represent statistical dependencies of variables by a graph. The maxproduct "belief propagation" algorithm is a localmessage passing algorithm on this graph that is known to converge to a unique fixed point when
Leavitt path algebras of arbitrary graphs
 HOUSTON J. MATH
, 2008
"... We extend the notion of the Leavitt path algebra of a graph to include all directed graphs. We show how various ringtheoretic properties of these more general structures relate to the corresponding properties of Leavitt path algebras of rowfinite graphs. Specifically, we identify those graphs fo ..."
Abstract

Cited by 42 (13 self)
 Add to MetaCart
We extend the notion of the Leavitt path algebra of a graph to include all directed graphs. We show how various ringtheoretic properties of these more general structures relate to the corresponding properties of Leavitt path algebras of rowfinite graphs. Specifically, we identify those graphs
Parallel Shortest Path for Arbitrary Graphs
 In EUROPAR: Parallel Processing, 6th International EUROPAR Conference. LNCS
, 2000
"... . In spite of intensive research, no workecient parallel algorithm for the single source shortest path problem is known which works in sublinear time for arbitrary directed graphs with nonnegative edge weights. We present an algorithm that improves this situation for graphs where the ratio dc= ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
. In spite of intensive research, no workecient parallel algorithm for the single source shortest path problem is known which works in sublinear time for arbitrary directed graphs with nonnegative edge weights. We present an algorithm that improves this situation for graphs where the ratio dc
The Graph Analysis Toolbox: Image Processing on Arbitrary Graphs
, 2003
"... We present a theoretical and computational framework for the analysis of data associated with the node set of an arbitrary graph. The algorithms described here are collected in a TM MATLAB software package named the Graph Analysis Toolbox. Our purpose is to describe the functionality of the Graph An ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
We present a theoretical and computational framework for the analysis of data associated with the node set of an arbitrary graph. The algorithms described here are collected in a TM MATLAB software package named the Graph Analysis Toolbox. Our purpose is to describe the functionality of the Graph
Disjoint identifyingcodes for arbitrary graphs
 In Proc. International Symposium on Information Theory (ISIT
, 2005
"... Identifying codes have been used in a variety of applications, including sensorbased location detection in harsh environments. The sensors used in such applications are typically battery powered making energy conservation an important optimization criterion for lengthening network lifetime. In this ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. In this work we propose and develop the concept of disjoint identifying codes with the motivation of providing energy loadbalancing in such systems. We also provide informationtheoretic upper and lower bounds on the number of disjoint identifying codes in a given graph, and show that these bounds
Local LexBFS Properties in an Arbitrary Graph
, 2000
"... Algorithm LexBFS was originally conceived for the recognition of triangulated graphs, but it has been shown to give results on various classes. In this paper, we present strong local graph properties which hold in the second neighborhood of a number one LexBFS vertex in an arbitrary graph. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Algorithm LexBFS was originally conceived for the recognition of triangulated graphs, but it has been shown to give results on various classes. In this paper, we present strong local graph properties which hold in the second neighborhood of a number one LexBFS vertex in an arbitrary graph.
VertexReinforced Random Walk on Arbitrary Graphs
 ANN. PROBAB
, 1999
"... VertexReinforced Random Walk (VRRW), defined by Pemantle (1988a), is a random process in a continuously changing environment which is more likely to visit states it has visited before. We consider VRRW on arbitrary graphs and show that on almost all of them, VRRW visits only finitely many vertices ..."
Abstract

Cited by 30 (5 self)
 Add to MetaCart
VertexReinforced Random Walk (VRRW), defined by Pemantle (1988a), is a random process in a continuously changing environment which is more likely to visit states it has visited before. We consider VRRW on arbitrary graphs and show that on almost all of them, VRRW visits only finitely many vertices
Results 1  10
of
427,428