Related papers: A Note on Diffusion State Distance
We measure the statistical distribution of the photonic local density of states in the near field of a semi-continuous gold film. By varying the distance between the measurement plane and the film, we show that near-field confined modes…
We prove the convergence of the law of grid-valued random walks, which can be seen as time-space Markov chains, to the law of a general diffusion process. This includes processes with sticky features, reflecting or absorbing boundaries and…
We derive the asymptotic distribution of the domination number of a new family of random digraph called proximity catch digraph (PCD), which has application to statistical testing of spatial point patterns and to pattern recognition. The…
Message passing neural networks (MPNNs) have emerged as go-to models for learning on graph-structured data in the past decade. Despite their effectiveness, most of such models still incur severe issues such as over-smoothing and…
A geometric graph is a combinatorial graph, endowed with a geometry that is inherited from its embedding in a Euclidean space. Formulation of a meaningful measure of (dis-)similarity in both the combinatorial and geometric structures of two…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
Although many graph-based clustering methods attempt to model the stationary diffusion state in their objectives, their performance limits to using a predefined graph. We argue that the estimation of the stationary diffusion state can be…
Causal discovery aims to recover graphs that represent causal relations among given variables from observations, and new methods are constantly being proposed. Increasingly, the community raises questions about how much progress is made,…
For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we…
In a connected graph, Kemeny's constant gives the expected time of a random walk from an arbitrary vertex $x$ to reach a randomly-chosen vertex $y$. Because of this, Kemeny's constant can be interpreted as a measure of how well a graph is…
We study the asymptotic properties of distributed consensus algorithms over switching directed random networks. More specifically, we focus on consensus algorithms over independent and identically distributed, directed random graphs, where…
Consider an unlimited homogeneous medium disturbed by points generated via Poisson process. The neighborhood of a point plays an important role in spatial statistics problems. Here, we obtain analytically the distance statistics to $k$th…
This paper gives a summary of basic concepts of density-functional theory (DFT) and its use in state-of-the-art computations of complex processes in condensed matter physics and materials science. In particular we discuss how microscopic…
For a simple connected graph $G$, let $D(G)$, $Tr(G)$, $D^{L}(G)$ and $D^{Q}(G)$, respectively be the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix of…
Many real-world networks exhibit the so-called small-world phenomenon: their typical distances are much smaller than their sizes. One mathematical model for this phenomenon is a long-range percolation graph on a $d$-dimensional box $\{0, 1,…
The concept of statistical convergence based on asymptotic density is introduced in this article through nets. Some possible extensions of classical results for statistical convergence of sequences are obtained in this article, with…
We consider the time dependent dispersion properties of overdamped tracer particles diffusing in a one dimensional periodic potential under the influence of an additional constant tilting force $F$. The system is studied in the region where…
The drift diffusion model (DDM) is a model of sequential sampling with diffusion (Brownian) signals, where the decision maker accumulates evidence until the process hits a stopping boundary, and then stops and chooses the alternative that…
Continuum dislocation dynamics (CDD) has become the state-of-the-art theoretical approach for mesoscale dislocation plasticity of metals. Within this approach, there are multiple CDD theories that can all be derived from the principles of…
We study diffusion (random walks) on recursive scale-free graphs, and contrast the results to similar studies in other analytically soluble media. This allows us to identify ways in which diffusion in scale-free graphs is special. Most…