Related papers: Inverse problems for discrete heat equations and r…

We establish conditions on sequences of graphs which ensure that the mixing times of the random walks on the graphs in the sequence converge. The main assumption is that the graphs, associated measures and heat kernels converge in a…

We consider the inverse problem for countable, locally finite electrical networks with edge weights in an arbitrary field. The electrical inverse problem seeks to determine the weights of the edges knowing only the potential and current…

Reinforced random walks are random walks on graphs whose transition probabilities along edges from a vertex are proportional to the weights of those edges, but where the weight of an edge evolves in a way that depends on the past traversals…

We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara's Theorem relates the adjacency matrix of a graph to a matrix…

We establish elliptic and parabolic Harnack inequalities on graphs with unbounded weights. As an application we prove a local limit theorem for a continuous time random walk $X$ in an environment of ergodic random conductances taking values…

We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We…

We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…

We consider a partial data inverse problem for a time-dependent convection-diffusion equation on an admissible manifold. We prove that the time-dependent convection term and time-dependent density can be recovered uniquely modulo a known…

We consider n non-intersecting Brownian motion paths with p prescribed starting positions at time t=0 and q prescribed ending positions at time t=1. The positions of the paths at any intermediate time are a determinantal point process,…

Sub-Gaussian estimates for the natural random walk is typical of many regular fractal graphs. Subordination shows that there exist heavy tailed jump processes whose jump indices are greater than or equal to two. However, the existing…

For any graph having a suitable uniform Poincare inequality and volume growth regularity, we establish two-sided Gaussian transition density estimates and parabolic Harnack inequality, for constant speed continuous time random walks…

This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…

We investigate the inverse Cauchy and data completion problems for elliptic partial differential equations in a bounded domain $D \subset \mathbb{R}^d$, $d \ge 2$, with a special emphasis on the steady-state heat conduction in anisotropic…

In this paper, we study the exact learning problem for weighted graphs, where we are given the vertex set, $V$, of a weighted graph, $G=(V,E,w)$, but we are not given $E$. The problem, which is also known as graph reconstruction, is to…

A divide-and-conquer based approach for computing the Moore-Penrose pseudo-inverse of the combinatorial Laplacian matrix $(\bb L^+)$ of a simple, undirected graph is proposed. % The nature of the underlying sub-problems is studied in detail…

In this thesis, we study three physically relevant models of strongly correlated random variables: trapped fermions, random matrices and random walks. In the first part, we show several exact mappings between the ground state of a trapped…

This paper consists of a few results, discovered and proved during the 2012-2013 research group at Eastern Oregon University. Inertia tables are a visual representation of the possible inertias of a given graph. The inertia of a graph…

We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) $P$ on a graph with a set of unknown marked vertices, one can define a…

Non-self-adjoint second-order ordinary differential operators on a finite interval with complex weights are studied. Properties of spectral characteristics are established and the inverse problem of recovering operators from their spectral…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…