• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 85
  • 14
  • 14
  • 11
  • 4
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 155
  • 155
  • 53
  • 31
  • 28
  • 27
  • 20
  • 19
  • 19
  • 15
  • 12
  • 12
  • 11
  • 11
  • 10
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Self avoiding walks on the square lattice

Wallace, J. January 1986 (has links)
No description available.
2

Cell based models of tumour angiogenesis

Plank, Michael John January 2003 (has links)
No description available.
3

Boundary theory of random walk and fractal analysis.

January 2011 (has links)
Wong, Ting Kam Leonard. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 91-97) and index. / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.6 / Chapter 1.1 --- Problems of fractal analysis --- p.6 / Chapter 1.2 --- The boundary theory approach --- p.7 / Chapter 1.3 --- Summary of the thesis --- p.9 / Chapter 2 --- Martin boundary --- p.13 / Chapter 2.1 --- Markov chains and discrete potential theory --- p.13 / Chapter 2.2 --- Martin compactification --- p.18 / Chapter 2.3 --- Convergence to boundary and integral representations --- p.20 / Chapter 2.4 --- Dirichlet problem at infinity --- p.25 / Chapter 3 --- Hyperbolic boundary --- p.27 / Chapter 3.1 --- Random walks on infinite graphs --- p.27 / Chapter 3.2 --- Hyperbolic compactification --- p.31 / Chapter 3.3 --- Ancona's theorem --- p.33 / Chapter 3.4 --- Self-similar sets as hyperbolic boundaries --- p.34 / Chapter 3.5 --- Hyperbolic compactification of augmented rooted trees --- p.44 / Chapter 4 --- Simple random walk on Sierpinski graphs --- p.47 / Chapter 4.1 --- Hcuristic argument for d = 1 --- p.48 / Chapter 4.2 --- Symmetries and group invariance --- p.51 / Chapter 4.3 --- Reflection principle --- p.54 / Chapter 4.4 --- Self-similar identity and hitting distribution --- p.60 / Chapter 4.5 --- Remarks and Open Questions --- p.64 / Chapter 5 --- Induced Dirichlet forms on self-similar sets --- p.66 / Chapter 5.1 --- Basics of Dirichlet forms --- p.67 / Chapter 5.2 --- Motivation: the classical Douglas integral --- p.68 / Chapter 5.3 --- Graph energy and the induced forms --- p.69 / Chapter 5.4 --- Induced Dirichlet forms on self-similar sets --- p.74 / Chapter 5.5 --- A uniform tail estimate via coupling --- p.83 / Chapter 5.6 --- Remarks and open questions --- p.89 / Index of selected terms --- p.98
4

THE WEAK-CONVERGENCE OF RECURRENT RANDOM-WALK CONDITIONED BY A LATE-RETURN TO ZERO

Kaigh, William Daniel, 1944- January 1973 (has links)
No description available.
5

Uniform convergence sets and random walks via ultraspherical polynomials

Ng, Boon-yian. January 1977 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references (leaf 81).
6

Solving random walk problems using resistive analogues

Morris, Richard D. 01 August 1968 (has links)
The classical method of solving random walk problems involves using Markov chain theory. When the particular random walk of interest is written in matrix form using Markov chain theory, the problem must then be solved using a digital computer. To solve all but the most trivial random walk problems by hand would be extremely difficult and time consuming. Very large random walk problems may even prove difficult to solve on the smaller digital computers. This paper intends to demonstrate a method that may be used to solve large random walk problems in a quick and economical manner. This alternate method uses resistive analogues and has the added feature of extracting particular solutions without having to completely solve the problem as would be necessary using a digital computer. Many analogues of random walks may also be quickly amended to include other random walks with relative ease using this alternate method of solution. Because this method uses nothing more than a power supply, a DC voltmeter and a set of resistors, the analogue of a particular random walk problem may be left set-up without incurring any loss of time or money on a digital computer. Once the resistors are mounted in a permanent fashion, the random walk analogues may also be used as an effective demonstration of random walk probabilities in the classroom.
7

Random Walks on Symmetric Spaces and Inequalities for Matrix Spectra

Alexander A. Klyachko, klyachko@fen.bilkent.edu.tr 20 June 2000 (has links)
No description available.
8

Random walk in networks : first passage time and speed analysis /

Lau, Hon Wai. January 2009 (has links)
Includes bibliographical references (p. 131-134).
9

Bounding the edge cover time of random walks on graphs

Bussian, Eric R. 08 1900 (has links)
No description available.
10

Ranking entities in heterogeneous multiple relation social networks using random walks

Sangi, Farzad Unknown Date
No description available.

Page generated in 0.0752 seconds