random walks on 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

... route. A basic operational and computational feature of the a priori optimization ap- proach is that the optimization problem considered has to be solved only once; next, the only “tool” needed ... dealing, on the one hand, with some mathematical preliminaries: on sets, relations and functions, on basic concepts from graph-theory and on some elements from discrete probabilities and, on the other ... problem ([BOL 85]) or randomness on the fact that an element is included to a set or not, when dealing with optimization problems on set-systems or, even, randomness on the execution time of a task...

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

... all configurations reachable from the initial one is called configuration space, and a fixed point is a configuration from which the evolution rule can not be applied. Convergence conditions (involving ... configuration, we call configuration space, and we denote by CCFG(G,O), the set of all configurations reachable from the initial configuration O. On this set, we define the following relation: ... the evolution rule (firing a vertex) is defined by: a configuration can be transformed into another one by transferringa chipfrom one vertex along each of its outgoing edges, if it contains at...

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

... {L −k } n k=2 . To 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), 189–208, 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

... 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

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

... fluctuating connectivities [152, 153] in random graphs. With these rationales in place, we now define some key concepts. Formally, a random graph [177] of N nodes and average connectivity c is constructed ... a typical blocked configuration. This is quite an extraordinary result; it implies that despite the exponential dom- inance of blocked configurations, random initial conditions preferentially select a ... Discussion 93 6.5 Discussion In the above, we have presented a finitely connected spin model on random graphs [152, 153], with the aim of examining the compaction of tapped granular media on a fully...

Ngày tải lên: 01/11/2013, 08:20

... 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 ... 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 called essential class...

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

... small changes in the distribution function of ξ k only lead to the small changes in the distribution function of η. In the paper, we investigate the distribution function of η when we have the small ... changes in the distribution function F (x) only lead to the small changes in the distribution function Ψ(x). In this paper, we shall investigate the stability of η’s distribution function when we have ... distribution of ν. 1. Introduction Let us consider the random variable (r.v): η = ν  k=1 ξ k (1) where ξ 1 , ξ 2 , are independent identically distributed random variables with the distribution function F...

Ngày tải lên: 14/03/2014, 13:20

... research on random laser is concentrated to the steady-state properties. Therefore, in this paper we examine the stationary operation of two-mode random microlaser. Starting from basic equations ... influence of laser parameters on the saturated values of mode intensities and Section 4 devoted to discussion and conclusion. 2. Basic equations and solving method In stationary regime, from [11] ... like John et al [7] combining the electron number equations of energy level with diffusion equation, Berger et al [8] using a Monter Carlo simulation and recently Kiang et al [9] combining...

Ngày tải lên: 14/03/2014, 13:20

... L 66.2 Combination of 3NL, 6NL, 9NL L 72.1 Combination of HMM, 6NL, 9NL L 72.3 Combination of HMM, 3NL, 6NL L 71.9 6 Conclusion We presented systems based on conditional random fields for ... Conditional Random Fields offer some advantages over traditional models for sequence labeling. These conditional models have mainly been introduced up to now in the information retrieval context ... International Conf. on Machine Learning, 282–289. Morgan Kaufmann, San Francisco, CA. [3] Sarawagi, S., and Cohen, W. (2004) Semi-Markov Conditional Random Fields for Information Extraction. Advances...

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

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

... note on the almost sure central limit theorem for weakly dependent random variables. Stat. Probab. Lett. 22, 131–136 (1995) 12 This Provisional PDF corresponds to the article as it appeared upon ... full text (HTML) versions will be made available soon. A note on the almost sure limit theorem for self-normalized partial sums of random variables in the domain of attraction of the normal law Journal ... below). For information about publishing your research in Journal of Inequalities and Applications go to http://www.journalofinequalitiesandapplications.com/authors/instructions/ For information about other...

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

... the National Natural Science Foundation of China (11061012), Project supported by Program to Sponsor Teams for Innovation in the Construction of Talent Highlands in Guangxi Institutions of Higher Learning, ... and Katz complete conver- gence theorem for pairwise NQD random variable sequences still holds true under the strong er condition. The result generalizes and extends the corr esponding result of ... quadrant dependent (NQD) random variables. The concept of NQD random variables was introduced by Lehmann [1]. Definition 1.1 [1] Two random variables X and Y are said to be NQD random vari- ables if...

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

... notations, and conven- tions of the theory of intuitionistic random normed spaces as in [22], [31], [33], [34], [40], [41], [42]. Definition 6.1.Ameasure distribution function is a function μ : R ® ... isanonemptyset,thenμ : X ® D is called a probabilistic meas ure on X and μ (x)is denoted by μ x . Definition 6.2.Anon-measure distribution function is a function ν : R ® [0, 1] which is right continuous, ... y  )) (monotonicity). If ( L ∗ , ≤ L ∗ , T ) is an Abelian topological monoid with unit 1 L ∗ ,then T is said to be a continuous t-norm. Definition 6.5. [44] A continuous t-norm T on L*issaidtobecontinuous...

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

... Applications 2011, 2011:76 http://www.journalofinequalitiesandapplications.com/content/2011/1/76 Page 7 of 8 RESEARC H Open Access A note on the complete convergence for arrays of dependent random ... versions of Kruglov et al. Mathematics Subject Classificat ion 60F15 Keywords: Complete convergence, Negatively associated random variables, Nega- tively dependent random variables 1 Introduction The ... 8 J+1 J J  −2J  k n  i=1 EX 2 ni  J . (2:9) Hence, the result follows by conditions (i) and (ii). ■ Remark 2.7. As noted in the Introduction, Chen et al. [9] have pr oved Theorem 2.6 under an additional condition (see also Theorem 1.5). It...

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

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

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

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

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