random walks on graphs with regular volume growth

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

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

... 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 ... 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 ... main contribution in this note is to show that by direct combinatorial constructions, a mixing time of c(G)n 2 log n can be obtained for all groups G where c(G) is a constant depending just on G....

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

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

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

... as we know, none of these conditions have taken the eccentricity of vertices into ∗ corresponding author the electronic journal of combinatorics 11 (2004), #R7 1 For regular graphs without a k-factor, ... necessary and sufficient conditions are met. The conditions in Theorem 1.1 are closely related to those given in the following result of Niessen and Randerath [5] on regular graphs. Theorem 1.4 Let ... +2. Fora ≥ 1 there are at most 2 edges leading to non-A-components, which together with q ≥ a + 3 and the connectivity of G yields a contradiction. For η ≥ 1, we have a ≥ 1, so it remains the case...

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

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

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

... 5] with random or regular topologies. The seminal pa- per [2] shows that, for peer-to-peer traffic, in a static two- dimensional network with N nodes and N/2randomlyse- lected source-destination ... networks with randomly located nodes. There are also research efforts focusing on networks with regular topologies. Silvester and Kleinrock [4] calculate the throughput of regular square net- works with ... Panichpapiboon, G. Ferrari, and O. K. Tonguz, “Sensor net- works with random versus uniform topology: MAC and in- terference considerations,” in Proc. IEEE Vehicular Technology Conference (VTC...

Ngày tải lên: 23/06/2014, 00: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 ... 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 ... at v. Now consider the component or components of G − v. Each such component has at least δ vertices or else the minimum degree of G would be too small. We now claim that each component C of...

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

... almost all graphs are 3-e.c., the only known examples of strongly regular 3-e.c. graphs are Paley graphs with at least 29 vertices. We construct a new infinite family of 3-e.c. graphs, based on certain ... two non-isomorphic 3-e.c. graphs of order 28, neither of which is strongly regular. In this article we construct new infinite families of strongly regular 3-e.c. graphs that are not Paley graphs. ... n-e.c. graphs, strongly regular graphs, adjacency property, Bush-type Hadamard matrix, design AMS subject classification: Primary 05C50, Secondary 05B20. 1 Introduction Throughout, all graphs...

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

... permutations adds more randomness to our construction than the choice of bijections. Construction 2 is the version of Construction 1 that produces the graphs in Theorem 1.1. Construction 2 Suppose ... Seidel, J. J., Strongly regular graphs having strongly regular subconstituents, J. Algebra 55 (1978), 257–280. [6] Fon-Der-Flaass, D. G., New prolific constructions of strongly regular graphs. Preprint. [7] ... generated strongly regular graphs. The graphs are generated by Construction 2 (described in Section 3) when certain bijec- tions and permutations are chosen uniformly at random. Lemma 3.3 in Section 3...

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

... undirected graph without loops. Accordingly, the edge set of a Cayley graph Γ = Cay(H, S) over H with connection set S is E := {{x, sx} | x ∈ H, s ∈ S}. Our construction of strongly regular graphs (cf. [5]) ... [4]. The cited papers contain detailed description of the difference sets construction from 9 regular (96,20,4) symmetric designs. The procedure ended in construction of 59 regular PDS’s in 9 groups. After ... Subject Classification: 05B05, 05B10, 05E30 Abstract New (96,20,4,4) and (96,19,2,4) regular partial difference sets are constructed, together with the corresponding strongly regular graphs. Our source...

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

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

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

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

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

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

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

... xuất huyết và tổn thưong não. -Sinh non : Trẻ sinh truớc 9 tháng hay sinh dưới 2 kg có nhiều nguy cơ bị bại não . Ở các nước giàu, một nửa các trưòng hợp bại não là do sinh non. 3.3. Nguyên nhân ... đơn để làm giảm co cứng xem ra không có hiệu quả. Điều trị ngoại khoa trong một vài trường hợp có thể có ích như trong trường hợp co cứng trầm trọng. Ngoại khoa chỉ có thể được đặt ra khi đứa ... Tại Viêt Nam hiện chưa có thống kê về sô trẻ bại não trong phạm vi toàn quốc . Số liệu trẻ bị chứng bại não qua một số công trình trong nước như sau : Theo Lê Các, tại 13 xã huyện Điện Bàn...

Ngày tải lên: 25/10/2012, 11:22

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