random walks on directed graphs

... they contain. We propose to com- pute the conditional similarity score by linearly combining the scores conditioned on the source opinion (i.e. f(i → j|Op(v i ))) and the destina- tion opinion (i.e. ... graph model as a condition. The second model, called Opinion HITS model, considers the sentences as authorities and both question topic information and opinion sentiment information as hubs. The experiment ... AFNLP Answering Opinion Questions with Random Walks on Graphs Fangtao Li, Yang Tang, Minlie Huang, and Xiaoyan Zhu State Key Laboratory on Intelligent Technology and Systems Tsinghua National Laboratory...

Ngày tải lên: 20/02/2014, 07:20

... most c r n 2 log n where the constant c r depends only on the order r of G . 1. Introduction One method often used in computational group theory for generating random elements from a given (non-trivial) finite ... =inf f=constant  e∈E f 2 (e)  x f 2 (x)d x log f 2 (x)  y f 2 (y)π(y) (8) where f ranges over all non-constant functions f : V → R and π is the stationary distribution of the nearest neighbor random walk on Γ. In a recent paper [9], Diaconis and Saloffe-Coste show ... 14 [5] P. Diaconis, R. L. Graham and J. A. Morrison, Asymptotic analysis of a random walk on a hypercube with many dimensions, Random Structures and Algorithms, 1 (1990), 51–72. [6] P. Diaconis and...

Ngày tải lên: 07/08/2014, 06:22

Ngày tải lên: 08/08/2014, 14:23

Ngày tải lên: 13/11/2014, 10:52

Ngày tải lên: 24/04/2014, 17:20

Ngày tải lên: 07/08/2014, 15:23

Ngày tải lên: 24/08/2014, 11:53

... get a hold on the latter, note that conditional on L −(k+1) =  k+1 ≥ 0we have the representation L −k =  k+1  i=1 Z i ,(6.2) COVER TIMES FOR PLANAR BROWNIAN MOTION AND RANDOM WALKS 447 hence ... Processes 1992), 189208, Birkhăauser, Boston, MA (1993). [22] R. Lyons and R. Pemantle , Random walks in a random environment and first-passage percolation on trees, Ann. Probab. 20 (1992), 125–136. [23] P. ... following extension of Theorem 1.2. See Section 8 for definitions and references concerning Brownian motion on manifolds. Theorem 1.3. Let M be a smooth, compact, connected, two-dimensional, Riemannian...

Ngày tải lên: 14/02/2014, 17:20

... dec(G) is a directed graph, it can be decomposed into strongly con- nected components that induce a directed acyclic graph D. We call a strongly connected component of dec(G) a sink component (also ... to one of its neighbors with equal probability. The main result of this section is that for random walks maximal compression is possible. Theorem 3.1. Successor searching in a one-dimensional random ... and C  must both contain (v, X  ), a contradiction to the assumption that they are distinct sink components. Thus, each node (v, ∅) can reach exactly one sink component. Now consider two distinct...

Ngày tải lên: 19/02/2014, 18:20

... valuable resource for such an application. Another interesting application is mining online discussions. A threaded discussion is an electronic discussion in which software tools are used to ... orienta- tion from association. ACM Transactions on Infor- mation Systems, 21:315–346. Peter D. Turney. 2002. Thumbs up or thumbs down?: semantic orientation applied to unsupervised classi- fication of ... method only considers the words it could assign a non-zero orientation value. If we consider all words, the accuracy will drop to around 61%. 4.1.1 Varying Parameters As we mentioned in Section 3.4,...

Ngày tải lên: 20/02/2014, 04:20

... measure of the Markov approximation of the arbitrary random field on T. Definition 1 (see [2]) Let G = {0, 1, , b -1}andP(y|x 1 , x 2 , , x m ) be a nonnegative functions on G m+1 . Let ❅ ❅ ❅ ❅ ❅      . . . level ... properties of random transition probability for second-order nonhomoge- neous Markov chains indexed by a tree. Peng et al. [13] have studied a class of strong deviation theorems for the random fields ... strong deviation theorem, m rooted Cayley tree, mth-order nonho moge- neous Markov chain, Shannon-McMillan theorem 1. Introduction AtreeisagraphG ={T, E} which is connected and contains no circuits....

Ngày tải lên: 20/06/2014, 23:20

... Transactions on Sig nal Processing, vol. 42, no. 8, pp. 1905–1915, 1994. [18] W. H. Foy, “Position-location solutions by Taylor-series esti- mation,” IEEE Transactions on Aerospace and Electronic Sys- tems, ... Jr., Global Positioning System: Theory and Applications, Volume 1, vol. 163 of Progress in As- tronautics and Aeronautics, American Institute of Aeronautics & Astronautics, Reston, Va, USA, 1996. [7] ... localization process for the mobile station cannot be solved analytically. The well-known iterative Gauss-Newton method as standard solution fails to converge for certain geometric constellations and...

Ngày tải lên: 22/06/2014, 20:20

... of interconnections and destinations is re- duced. Addressing within a group is also simplified. With one known row-column connection in submatrix, the rest of the submatrix connections could ... 100000 Figure 5: Matrix representation of a (6, 4) cage graph. 4. CONCLUSIONS An approach for constructing LDPC codes with column weight of two has been described. Cage graphs are used to represent ... Communications Letters, vol. 5, no. 2, pp. 58–60, 2001. [2] R. G. Gallager, “Low-density parity-check codes,” IRE Trans- actions on Information Theory, vol. 8, no. 1, pp. 21–28, 1962. [3]H.Song,J.Liu,andB.V.K.VijayaKumar,“Lowcomplex- ity...

Ngày tải lên: 22/06/2014, 22:20

... extremal graphs are those given in Theorem 3 along with the trivial ones with only 2δ + 1 vertices. We noticed that the proof of Theorem 3 is easily modified to provide a charac- terization of non-hamiltonian ... is the final vertex of a longestpathinC∪ v starting at v,sayv 1 ,v 2 , ···,v i−1 ,v δ+1 ,v δ , ···,v i . Hence v i has all its neighbors on Q, so the component C consists only of the vertices v 2 , ... which includes x, y and all 2δ vertices of C, contradicting f (G)=2δ + 1. It follows that vertices not on C have all their On Extremal Graphs With No Long Paths Asad Ali Ali Department of Computer...

Ngày tải lên: 07/08/2014, 06:20

... number of n-step ussaws on various lattices, found using generating functions with decomposition and recursive methods. 1Introduction A self-avoiding walk (saw) is a path on a lattice that does ... and sideways but not down, on various lattices. I utilize two methods: an extension of Zeilberger’s “decomposition method,” and a recursive method. Generating functions (gf’s) are a primary tool ... a generating function is “a clothesline on which we hang up a sequence of numbers for display.” It 1 THE ELECTRONIC JOURNAL OF COMBINATORICS 3 (1996), #R31 3 Piece Definition GF(closed) GF(expanded) M S u ∗ ˜ s 2t 1−t 2 t +2 t 2 +2 t 3 +2 t 4 + ··· S S uu ∗ s 2 t 3 1−t t 3 + t 4 + t 5 + t 6 + t 7 + ··· S S ∗ 1−t 1−t−t 3 1+ t 3 + t 4 + t 5 +2 t 6 + ···  S M uu ∗ s 1−t+t 2 1−t 1+ t 2 + t 3 + t 4 + t 5 + t 6 + ··· u...

Ngày tải lên: 07/08/2014, 06:20

... this section, we deal with an abstract graph G satisfying certain conditions listed below. In the next sections, concrete examples of G will be considered. Our assumptions and conventions concerning ... graph. A function (à) is called a harmonic function on the Young graph [VK] if it satises the condition (à)= : à (), à Y. (0.1) We are interested in nonnegative harmonic functions ϕ normalized ... applications. Concrete examples of nonextreme functions ϕ first emerged in [KOV] in connec- tion with a problem of harmonic analysis on the infinite symmetric group S(∞). These functions, denoted...

Ngày tải lên: 07/08/2014, 06:20

... decomposition lemmas. 4 Conclusion As a demonstration of a powerful method for a wide range of directed 2-factorization problems we have solved the directed pancyclic 2-factorization for all directed ... methods provide for constructing very general classes of 2-factorizations. 2 Definitions and Discussion Unless otherwise mentioned, all graphs, and factors are directed. the electronic journal of combinatorics ... 1-factors and the second two are directed Hamilton cycles, for any 1 ≤ i ≤ 2u − 2. Proof. It is proved in [7] that the union of any two consecutive undirected Walecki Hamil- ton 2-factors, shown...

Ngày tải lên: 07/08/2014, 06:23

... function will be constant. We determine the number of compositions that are needed, on average. Choose random functions f 1 ,f 2 ,f 3 , independently and uniformly from among the n n functions ... expected value of T . 1 Introduction If we compose sufficiently many random functions on a finite set then the composite function is constant. We ask how long this takes, on average. More precisely, let U n be ... Graphs http://stat.berkeley.edu/users/aldous. [2] P.Diaconis and D.Freedman, Iterated Random Functions, SIAM Review 41 No. 1, p 45–76. [3] J.C.Hansen and J.Jaworski, Large Components of Random Mappings, Random Structures and...

Ngày tải lên: 07/08/2014, 06:23

... equations. This definition extends Robertson’s pentagon- pentagram definition of the Hoffman-Singleton graph and is obtained by studying maximum cocliques of the Hoffman-Singleton graph in Robertson’s ... representation of a one-to-one correspondence between L 2 and triples from S. The same reasoning applies to L 1 . Remark 37. We can explore the action of A 7 on S a little further, considering ... Section 13 for a comment on the history). In this paper we provide a new and elementary construction of the Higman-Sims graph, combining a geometric interpretation [16] of Robertson’s pentagon-pentagram...

Ngày tải lên: 07/08/2014, 08:22

Ngày tải lên: 07/08/2014, 13:21