[PDF] Top 20 vol18_pp773-783. 144KB Jun 04 2011 12:06:05 AM

... 1.1.The graph drawn on the left is a graph non-isomorphic to a disjoint union of complete graphs but Laplacian cospectral with the disjoint union of complete graphs drawn on the right [r] ... Lihat dokumen lengkap

... Since M −matrices, Dashnic-Zusmanovich matrices, strictly generalized doubly diagonally dominant matrices and strictly or irreducibly diagonally dominant ma- trices are all H −matrices (see, e.g., [1, pp. 132-161], [10], ... Lihat dokumen lengkap

... This is a variant on thesymmetric minimum rank problem for a simple graph, which asks for a determination of the minimum rank among all real symmetric matrices whose zero-nonzero pattern[r] ... Lihat dokumen lengkap

... 1. Introduction. The problem of avoidance control for two independent agents has been introduced and extensively studied in a number of publications by Leit- mann and his coworkers ([12]-[14], [5], and [6]). ... Lihat dokumen lengkap

... Newman, Moore and Watts (12), (13) proposed an idealized version, in which the lattice is replaced by a circle and distance along the circle is the usual arc length, shortcuts now being added between random pairs ... Lihat dokumen lengkap

... The results show that our nonparametric estimation method provides an effective solution to the nonlinear filtering problem for reflecting diffusions in random environments.. Appendix: P[r] ... Lihat dokumen lengkap

... In Markov chain Monte Carlo (MCMC) a Markov kernel K is devised in an attempt to sample approximately from its stationary distribution π. Then the rate of convergence to stationarity could determine the Markov chain ... Lihat dokumen lengkap

... It is recalled Section 4.2 that they converge under the topology of local convergence to an infinite branch, the spine or infinite line of descent on which are grafted some critical terna[r] ... Lihat dokumen lengkap

... These results concern only rough rates of decay of the negative exponential moments of the mass of visited sites, and not specific asymptotic values. The letters c and C which appear in several of the proofs below will be ... Lihat dokumen lengkap

... Eβ 1.3 The result in brief The main result presents a strongly recurrent counterpart α < β of the result of [16] where α > β and goes beyond it on one hand giving local version of the [r] ... Lihat dokumen lengkap

... Through the change of variable Yt = ut,Xt the original problem has been reduced to the problem of the existence of the flow of the following stochastic equation d Yt=σt,YtdWt whereσt,y[r] ... Lihat dokumen lengkap

... The concept of universality class plays a key role in statistical mechanics, making it possible to classify a huge variety of models and phenomena by means of well chosen scaling exponents. For instance, many growth ... Lihat dokumen lengkap

... As such coordinate symmetry arises in the study of projections of vectors chosen uniformly from the surface of convex bodies which have symmetries with respect to the coordinate planes,[r] ... Lihat dokumen lengkap

... Outline of proof. We conclude the introduction with a brief outline of the rest of the paper. The bulk of the work, contained in Section 2, is in proving the upper bound in Theorem 1. We consider the rectangle process as ... Lihat dokumen lengkap

... This means that we can treat the population inBℓN in the time interval [t0,0] as a two-level branching system critical at the family level and subcritical at the individual level with s[r] ... Lihat dokumen lengkap

... These results are applied to show that forn≥2, the minimum number of positive entries in ann×nsign pattern that allows eventual positivity isn+ 1, and to classify all 2×2 and 3×3 sign [r] ... Lihat dokumen lengkap

... ELECTRONIC COMMUNICATIONS in PROBABILITY FIRST-PASSAGE PERCOLATION RATES ON WIDTH-TWO STRETCHES WITH EXPONENTIAL LINK WEIGHTS ECKHARD SCHLEMM Zentrum Mathematik, Technische Universitä[r] ... Lihat dokumen lengkap

... Hence, fort′l=2q−l 1logml+1, it follows that liml→∞Φrtl′ =0, and behaves asymptotically, asl becomes large, in the same way as for the Poisson occupancy scheme with a single block ofml [r] ... Lihat dokumen lengkap

... ELECTRONIC COMMUNICATIONS in PROBABILITY A PROBABILISTIC PROOF OF A WEAK LIMIT LAW FOR THE NUMBER OF CUTS NEEDED TO ISOLATE THE ROOT OF A RANDOM RECURSIVE TREE ALEX IKSANOV National [r] ... Lihat dokumen lengkap

... It is shown in this paper that if one only considers the family of graphs without isolated vertex, then a disjoint union of complete graphs is determined by its Laplacian spectrum within[r] ... Lihat dokumen lengkap