This essay is an academic justification for a means of producing images explained mainly through ideas of experiential memory.

Linear characters of finite groups can be extended to take k operands. The basics of such a k-fold extension are detailed. We then examine a proposition by Johnson and Sehgal pertaining to these k-characters and disprove its converse. Probabilistic models can be applied to random walks on the Cayley groups of finite order. We examine random walks on dihedral groups which converge after a finite number of steps to the random walk induced by the uniform distribution. We present both sufficient and necessary conditions for such convergence and analyze aspects of algebraic geometry related to this subject.

In this thesis, I investigate quantum walks in quantum computing from three aspects: the insights, the implementation, and the applications. Quantum walks are the quantum analogue of classical random walks. For the insights of quantum walks, I list and explain the required components for quantizing a classical random walk into a quantum walk. The components are, for instance, Markov chains, quantum phase estimation, and quantum spectrum theorem. I then demonstrate how the product of two reflections in the walk operator provides a quadratic speed-up, in comparison to the classical counterpart. For the implementation of quantum walks, I show the construction of an efficient circuit for realizing one single step of the quantum walk operator. Furthermore, I devise a more succinct circuit to approximately implement quantum phase estimation with constant precision controlled phase shift operators. From an implementation perspective, efficient circuits are always desirable because the realization of a phase shift operator with high precision would be a costly task and a critical obstacle. For the applications of quantum walks, I apply the quantum walk technique along with other fundamental quantum techniques, such as phase estimation, to solve the partition function problem. However, there might be some scenario in which the speed-up of spectral gap is insignificant. In a situation like that that, I provide an amplitude amplification-based iii approach to prepare the thermal Gibbs state. Such an approach is useful when the spectral gap is extremely small. Finally, I further investigate and explore the effect of noise (perturbation) on the performance of quantum walks

Walking has become a trend in the USA. In recent years, the desire to walk has brought forth specific urban design for walkable places as well as art forms that focus on walking. Whence this trend? This dissertation studies the socio-economic and cultural context that brought forth the aestheticized forms of walking such as walking in designed walkable places and walking as art. The theoretical framework to study this genealogy is based in social anthropology, critical theory, theatre studies and the practice of audio-walks. A "dialectic of aestheticization and commodification" runs through modernity that generates aestheticized forms of walking today. While walking is initially a form of aesthetic struggle against the rational principles of modernity and the forces of capitalism, this struggle is co-opted by the logic of capital in a continuous interlacing of the processes of aestheticization and commodification. The social and spatial consequences of capitalism together with the process of aestheticization of society produce new spatial forms of capitalism, new commodified forms of social interaction, and new forms of walking. What became of the yearning for agency through walking? With "walkable urbanism", capital returns to the city center and creates new markets for a budding walkable life-style which is fed through conspicuous consumption and the commodified "walkable body". With walking as art, the struggle for more physical, intellectual and political agency through walking goes on. While fighting with the self-referential loop of postmodern performing art, art walking opens up doors to new paths for contemporary art that lead out of post-dramatic art, beyond the phenomenology of embodied experience, and out of the manipulating products of the culture industry in order to create art that offers room for imagination -- the source of social change. / Ph. D.

Cette thèse s'intéresse à deux modèles de processus auto intéagissant étroitement reliés: le processus de sauts renforcé par sites (VRJP) et la marche aléatoire renforcée par arêtes (ERRW). Nous étudions aussi les liens entre ces processus et un opérateur de Schrödinger aléatoire. Dans le chapitre 3, nous montrons que le VRJP est le seul processus satisfaisant la propriété d'échangeabilité partielle et tel que la probabilité de transition ne dépende que du temps local des voisins, sous quelques conditions techniques. Le chapitre 4 donne la transition de phase entre vitesse positive et vitesse nulle pour un VRJP transitoire sur un arbre de Galton Watson, utilisant le fait que sur un arbre, le VRJP est une marche aléatoire en milieu aléatoire. Dans le chapitre 5, une nouvelle famille exponentielle de loi est introduite et ses liens avec le VRJP sont étudiés. En particulier, nous donnons une preuve de la formule de Coppersmith et Diaconis, n'utilisant que des calculs élémentaires. Finalement, dans le chapitre 6 nous étudions la représentation du VRJP comme mélange de processus de Markov sur les graphes infinis. Nous représentons le VRJP à l'aide de la fonction de Green et d'une fonction propre généralisée d'un opérateur de Schrödinger aléatoire associé au VRJP. En conséquence, nous obtenons un principe d'invariance pour le VRJP quand le renforcement est suffisamment faible, ainsi que la récurrence du ERRW sur ℤ2 pour toute valeurs initiales des paramètres / This thesis is dedicated to the study of two closely related self-interacting processes: the vertex reinforced jump process (VRJP) and the edge reinforced random walk (ERRW). We also study the relations between these processes and a random Schrödinger operator. In Chapter 3, we prove that the VRJP is the only partially exchangeable process whose transition probability depends only on neighbor local times, under some technical conditions. Chapter 4 gives the phase transition between positive speed and null speed of a transient VRJP on a Galton Watson tree, using a representation of random walk in independent random environment. In Chapter 5, we introduce a new exponential family of probability distributions generalizing the Inverse Gaussian distribution, and we show some of its relations to the VRJP. In particular, we give an elementary proof of the formula of Coppersmith and Diaconis. Finally, we show in Chapter 6 that the VRJP on infinite graph is a mixture of Markov jump processes, by constructing the random environment using the Green function and a generalized eigenfunction related to a random Schrödinger operator associated with the VRJP. As a consequence, we obtain a central limit theorem when the reinforcement is weak enough, and also the recurrence of ERRW on ℤ2 for any initial constant weights

No description available.

Bewegungen von prozessiven molekularen Motoren des Zytoskeletts sind durch ein Wechselspiel von gerichteter Bewegung entlang von Filamenten und Diffusion in der umgebenden Lösung gekennzeichnet. Diese eigentümlichen Bewegungen werden in der vorliegenden Arbeit untersucht, indem sie als Random Walks auf einem Gitter modelliert werden. Ein weiterer Gegenstand der Untersuchung sind Effekte von Wechselwirkungen zwischen den Motoren auf diese Bewegungen. <br /> <br /> Im einzelnen werden vier Transportphänomene untersucht: <br /> (i) Random Walks von einzelnen Motoren in Kompartimenten verschiedener Geometrien, <br /> (ii) stationäre Konzentrationsprofile, die sich in geschlossenen Kompartimenten infolge dieser Bewegungen einstellen,<br /> (iii) randinduzierte Phasenübergänge in offenen röhrenartigen Kompartimenten, die an Motorenreservoirs gekoppelt sind, und <br /> (iv) der Einfluß von kooperativen Effekten bei der Motor-Filament-Bindung auf die Bewegung. Alle diese Phänomene sind experimentell zugänglich, und mögliche experimentelle Realisierungen werden diskutiert. / Movements of processive cytoskeletal motors are characterized by an interplay between directed motion along filament and diffusion in the surrounding solution. In the present work, these peculiar movements are studied by modeling them as random walks on a lattice. An additional subject of our studies is the effect of motor-motor interactions on these movements. <br /> <br /> In detail, four transport phenomena are studied: <br /> (i) Random walks of single motors in compartments of various geometries, <br /> (ii) stationary concentration profiles which build up as a result of these movements in closed compartments, <br /> (iii) boundary-induced phase transitions in open tube-like compartments coupled to reservoirs of motors, and <br /> (iv) the influence of cooperative effects in motor-filament binding on the movements. All these phenomena are experimentally accessible and possible experimental realizations are discussed.

In this thesis, we study the power and limit of algorithms on various models, aiming at applications in distributed networks and databases. In distributed networks, graph algorithms are fundamental to many applications. We focus on computing random walks which are an important primitive employed in a wide range of applications but has always been computed naively. We show that a faster solution exists and subsequently develop faster algorithms by exploiting random walk properties leading to two immediate applications. We also show that this algorithm is optimal. Our technique in proving a lower bound show the first non-trivial connection between communication complexity and lower bounds of distributed graph algorithms. We show that this technique has a wide range of applications by proving new lower bounds of many problems. Some of these lower bounds show that the existing algorithms are tight. In database searching, we think of the database as a large set of multi-dimensional points stored in a disk and want to help the users to quickly find the most desired point. In this thesis, we develop an algorithm that is significantly faster than previous algorithms both theoretically and experimentally. The insight is to solve the problem on the streaming model which helps emphasize the benefits of sequential access over random disk access. We also introduced the randomization technique to the area. The results were complemented with a lower bound. We also initiat a new direction as an attempt to get a better query. We are the first to quantify the output quality using "user satisfaction" which is made possible by borrowing the idea of modeling users by utility functions from game theory and justify our approach through a geometric analysis.

The phenomenon of scale dependent spectral dimension has attracted special interest in the quantum gravity community over the last eight years. It was first observed in computer simulations of the causal dynamical triangulation (CDT) approach to quantum gravity and refers to the reduction of the spectral dimension from 4 at classical scales to 2 at short distances. Thereafter several authors confirmed a similar result from different approaches to quantum gravity. Despite the contribution from different approaches, no analytical model was proposed to explain the numerical results as the continuum limit of CDT. In this thesis we introduce graph ensembles as toy models of CDT and show that both the continuum limit and a scale dependent spectral dimension can be defined rigorously. First we focus on a simple graph ensemble, the random comb. It does not have any dynamics from the gravity point of view, but serves as an instructive toy model to introduce the characteristic scale of the graph, study the continuum limit and define the scale dependent spectral dimension. Having defined the continuum limit, we study the reduction of the spectral dimension on more realistic toy models, the multigraph ensembles, which serve as a radial approximation of CDT. We focus on the (recurrent) multigraph approximation of the two-dimensional CDT whose ensemble measure is analytically controlled. The latter comes from the critical Galton-Watson process conditioned on non-extinction. Next we turn our attention to transient multigraph ensembles, corresponding to higher-dimensional CDT. Firstly we study their fractal properties and secondly calculate the scale dependent spectral dimension and compare it to computer simulations. We comment further on the relation between Horava-Lifshitz gravity, asymptotic safety, multifractional spacetimes and CDT-like models.

This work presents a numerical investigation of self-avoiding walks (SAWs) on percolation clusters, a canonical model for polymers in disordered media. A new algorithm has been developed allowing exact enumeration of over ten thousand steps. This is an increase of several orders of magnitude compared to previously existing enumeration methods, which allow for barely more than forty steps. Such an increase is achieved by exploiting the fractal structure of critical percolation clusters: they are hierarchically organized into a tree of loosely connected nested regions in which the walks segments are enumerated separately. After the enumeration process, a region is \"decimated\" and behaves in the following effectively as a single point. Since this method only works efficiently near the percolation threshold, a chain-growth Monte Carlo algorithm has also been used. Main focus of the investigations was the asymptotic scaling behavior of the average end-to-end distance as function of the number of steps on critical clusters in different dimensions. Thanks the highly efficient new method, existing estimates of the scaling exponents could be improved substantially. Also investigated were the number of possible chain conformation and the average entropy, which were found to follow an unusual scaling behavior. For concentrations above the percolation threshold the exponent describing the growth of the end-to-end distance turned out to differ from that on regular lattices, defying the prediction of the accepted theory. Finally, SAWs with short range attractions on percolation clusters are discussed. Here, it emerged that there seems to be no temperature-driven collapse transition as the asymptotic scaling behavior of the end-to-end distance even at zero temperature is the same as for athermal SAWs. / Die vorliegenden Arbeit präsentiert eine numerische Studie von selbstvermeidenden Zufallswegen (SAWs) auf Perkolationsclustern, ein kanonisches Modell für Polymere in stark ungeordneten Medien. Hierfür wurde ein neuer Algorithmus entwickelt, welcher es ermöglicht SAWs von mehr als zehntausend Schritten exakt auszuzählen. Dies bedeutet eine Steigerung von mehreren Größenordnungen gegenüber der zuvor existierenden Methode, welche kaum mehr als vierzig Schritte zulässt. Solch eine Steigerung wird erreicht, indem die fraktale Struktur der Perkolationscluster geziehlt ausgenutzt wird: Die Cluster werden hierarchisch in lose verbundene Gebiete unterteilt, innerhalb welcher Wegstücke separat ausgezählt werden können. Nach dem Auszählen wird ein Gebiet \"dezimiert\" und verhält sich während der Behandlung größerer Gebiete effektiv wie ein Gitterpunkt. Da diese neue Methode nur nahe der Perkolationsschwelle funktioniert, wurde zum Erzielen der Ergebnisse zudem ein Kettenwachstums-Monte-Carlo-Algorithmus (PERM) eingesetzt. Untersucht wurde zunächst das asymptotische Skalenverhalten des Abstands der beiden Kettenenden als Funktion der Schrittzahl auf kritischen Clustern in verschiedenen Dimensionen. Dank der neuen hochperformanten Methode konnten die bisherigen Schätzer für den dies beschreibenden Exponenten signifikant verbessert werden. Neben dem Abstand wurde zudem die Anzahl der möglichen Konformationen und die mittlere Entropie angeschaut, für welche ein ungewöhnliches Skalenverhalten gefunden wurde. Für Konzentrationen oberhalb der Perkolationsschwelle wurde festgestellt, dass der Exponent, welcher das Wachstum des Endabstands beschreibt, nicht dem für freie SAWs entspricht, was nach gängiger Lehrmeinung der Fall sein sollte. Schlussendlich wurden SAWs mit Anziehung zwischen benachbarten Monomeren untersucht. Hier zeigte sich, dass es auf kritischen Perkolationsclustern keinen Phasenübergang zu geben scheint, an welchem die Ketten kollabieren, sondern dass das Skalenverhalten des Endabstands selbst am absoluten Nullpunkt der Temperatur unverändert ist.