Related papers: Lamplighter Random Walks and Entropy-Sensitivity o…

We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

We study some percolation problems on the complete graph over $\mathbf N$. In particular, we give sharp sufficient conditions for the existence of (finite or infinite) cliques and paths in a random subgraph. No specific assumption on the…

We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random nxn matrix L defined by L(j,k)=X(j,k) if k<>j and…

We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…

We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…

This paper provides a detailed description for the asymptotics of exponential functionals of random walks with light/heavy tails. We give the convergence rate based on the key observation that the asymptotics depends on the sample paths…

We revisit an old minor topic in algorithms, the deterministic walk on a finite graph which always moves toward the nearest unvisited vertex until every vertex is visited. There is an elementary connection between this cover time and…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…

Random graphs with latent geometric structure are popular models of social and biological networks, with applications ranging from network user profiling to circuit design. These graphs are also of purely theoretical interest within…

Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…

We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…

A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…

This thesis deals with applications of experimental mathematics to a number of problems. The first problem is related to random graph statistics. We consider a certain class of Galton-Watson random trees and look at the total height…

Let G be a countable group which acts by isometries on a separable, but not necessarily proper, Gromov hyperbolic space X. We say the action of G is weakly hyperbolic if G contains two independent hyperbolic isometries. We show that a…

Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the use of the Markov chains defined on the graph…

We study a certain polytope arising from embedding the Hamiltonian cycle problem in a discounted Markov decision process. The Hamiltonian cycle problem can be reduced to finding particular extreme points of a certain polytope associated…