• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 149
  • 40
  • 34
  • 29
  • 8
  • 6
  • 6
  • 5
  • 4
  • 3
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 318
  • 318
  • 54
  • 48
  • 41
  • 38
  • 31
  • 30
  • 28
  • 27
  • 26
  • 23
  • 23
  • 23
  • 22
  • 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

Subdiffusive transport in non-homogeneous media and nonlinear fractional equations

Falconer, Steven January 2015 (has links)
No description available.
2

A Simulation Study of Walks in Large Social Graphs

Anwar, Shahed 05 November 2015 (has links)
Online Social Networks (OSNs) such as Facebook, Twitter, and YouTube are among the most popular sites on the Internet. Billions of users are connected through these sites, building strong and effective communities to share views and ideas, and make recommendations nowadays. Therefore, by choosing an appropriate user-base from billions of people is required to analyze the structure and key characteristics of the large social graphs to improve current systems and to design new applications. For this reason, node sampling technique plays an important role to study large-scale social networks. As a basic requirement, the sampled nodes and their links should possess similar statistical features of the original network, otherwise the conclusion drawn from the sampled network may not be appropriate for the entire population. Hence, good sampling strategies are key to many online social network applications. For instance, before introducing a new product or adding new feature(s) of a product to the online social network community, that specific new product or the additional feature has to be exposed to only a small set of users, who are carefully chosen to represent the complete set of users. As such, different random walk-based sampling techniques have been introduced to produce samples of nodes that not only are internally well-connected but also capture the statistical features of the whole network. Traditionally, walk-based techniques do not have the restriction on the number of times that a node can be re-visited while sampling. This may lead to an inefficient sampling method, because the walk may be "stuck" at a small number of high-degree nodes without being able to reach out to the rest of the nodes. A random walk, even after a large number of hops, may not be able to obtain a sampled network that captures the statistical features of the entire network. In this thesis, we propose two walk-based sampling techniques to address the above problem, called K-Avoiding Random Walk (KARW) and Neighborhood-Avoiding Random Walk (NARW). With KARW, the number of times that a node can be re-visited is constrained within a given number K. With NARW, the random walk works in a "jump" fashion, since the walk starts outside of the N-hop neighborhood from the current node chosen randomly. By avoiding the current nodes neighboring area of level-N, NARW is expected to reach out the other nodes within the entire network quickly. We apply these techniques to construct multiple independent subgraphs from a social graph, consisting of 63K users with around a million connections between users collected from a Facebook dataset. By simulating our proposed strategies, we collect performance metrics and compare the results with the current state-of-the-art sampling techniques (Uniform Random Sampling, Random Walk, and Metropolis Hastings Random Walk). We also calculate some of the key statistical features (i.e., degree distribution, betweenness centrality, closeness centrality, modularity, and clustering coefficient) of the sampled graphs to get an idea about the network structures that essentially represent the original social graph. / Graduate / 0984 / shahed.anwar@gmail.com
3

Markov Chain Intersections and the Loop--Erased Walk

rdlyons@indiana.edu 12 July 2001 (has links)
No description available.
4

En slumpmässig vandring eller genomsnittlig återgång : Råder förutsägbarhet på Stockholmsbörsen?

Alerius, Markus, Järlefelt, Daniel January 2014 (has links)
This study has been conducted in order to determine the existence of predictability for the Stockholm stock exchange. With this purpose the random walk theory has been raised against the theory of mean reversion in order to determine which theory is the most substantial. Data has been collected from Nasdaq OMX Nordic and furtherly been processed using the statistical software EViews. Swedish listed companies’ daily share values between 2000-2014 have been analyzed using two tests; an Augmented Dickey Fuller test and a Variance Ratio test. The results show generally that the null hypothesis - and thus the random walk - is rejected in the short term. This means that both on an aggregated level and on an individual level, the Stockholm stock exchange is predictable in the short term - in the form of mean reversion - and that it is most evident in small cap firms.
5

Branching diffusions

Harris, Simon Colin January 1995 (has links)
No description available.
6

A study of the efficiency of the foreign exchange market through analysis of ultra-high frequency data

Kanzler, Ludwig January 1998 (has links)
No description available.
7

Networks: a random walk in degree space / Redes: um passeio aleatório no espaço dos graus

Ampuero, Fernanda 18 May 2018 (has links)
The present work aims to contribute to the study of networks by mapping the temporal evolution of the degree to a random walk in degree space. We analyzed how and when the degree approximates a pre-established value through a parallel with the first-passage problem of random walks. The mean time for the first-passage was calculated for the dynamical versions the Watts-Strogatz and Erdos-Renyi models. We also analyzed the degree variance for the random recursive tree and Barabasi-Albert models / O presente trabalho visa contribuir com a pesquisa na área de redes através do mapeamento da evolução temporal do grau com um passeio aleatório no espaço do mesmo. Para tanto, foi feita uma análise de quando e como a quantidade de ligações do vértice se aproxima de um valor pré-estabelecido, mediante um paralelo com o problema da primeira passagem de passeios aleatórios. O tempo médio para a primeira passagem para as versões dinâmicas dos modelos Watts-Strogatz e Erdos-Rényi foram calculados. Além disso, foi realizado um estudo da variância do grau para os modelos da árvore recursiva aleatória e Barabási-Albert
8

Networks: a random walk in degree space / Redes: um passeio aleatório no espaço dos graus

Fernanda Ampuero 18 May 2018 (has links)
The present work aims to contribute to the study of networks by mapping the temporal evolution of the degree to a random walk in degree space. We analyzed how and when the degree approximates a pre-established value through a parallel with the first-passage problem of random walks. The mean time for the first-passage was calculated for the dynamical versions the Watts-Strogatz and Erdos-Renyi models. We also analyzed the degree variance for the random recursive tree and Barabasi-Albert models / O presente trabalho visa contribuir com a pesquisa na área de redes através do mapeamento da evolução temporal do grau com um passeio aleatório no espaço do mesmo. Para tanto, foi feita uma análise de quando e como a quantidade de ligações do vértice se aproxima de um valor pré-estabelecido, mediante um paralelo com o problema da primeira passagem de passeios aleatórios. O tempo médio para a primeira passagem para as versões dinâmicas dos modelos Watts-Strogatz e Erdos-Rényi foram calculados. Além disso, foi realizado um estudo da variância do grau para os modelos da árvore recursiva aleatória e Barabási-Albert
9

Random Walks on Trees with Finitely Many Cone Types

Tatiana Nagnibeda, Wolfgang Woess, Andreas.Cap@esi.ac.at 07 March 2001 (has links)
No description available.
10

Classification on the Average of Random Walks

Daniela Bertacchi, Fabio Zucca, Andreas.Cap@esi.ac.at 26 April 2001 (has links)
No description available.

Page generated in 0.0665 seconds