相关论文: The principle of least action for random graphs

This paper presents a mesoscopic traffic flow model that explicitly describes the spatio-temporal evolution of the probability distributions of vehicle trajectories. The dynamics are represented by a sequence of factor graphs, which enable…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

We consider a classical field theory whose equations of motion follow from the least action principle, but the class of admissible trajectories is restricted by differential equations. The key element of the proposed construction is the…

We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…

The semi-random graph process is a single player game in which the player is initially presented an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then…

We provide an Information-Geometric formulation of Classical Mechanics on the Riemannian manifold of probability distributions, which is an affine manifold endowed with a dually-flat connection. In a non-parametric formalism, we consider…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…

The population dynamics of molecules, cells, and organisms are governed by a number of unknown forces. In the last decade, population dynamics have predominantly been modeled with Wasserstein gradient flows. However, since gradient flows…

Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize…

Recently it is shown that the non-relativistic quantum formulations can be derived from a least observability principle [36]. In this paper, we apply the principle to massive scalar fields, and derive the Schr\"{o}dinger equation of the…

The paper contains the probabilistic analysis of the Brownian motion on the simplest quantum graph, spider: a system of N-half axis connected only at the graph's origin by the simplest (so-called Kirchhoff's) gluing conditions. The limit…

Let $\{G_i\}$ be the random graph process: starting with an empty graph $G_0$ with $n$ vertices, in every step $i \geq 1$ the graph $G_i$ is formed by taking an edge chosen uniformly at random among the non-existing ones and adding it to…

We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…

Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…

The quantum walk dynamics obey the laws of quantum mechanics with an extra locality constraint, which demands that the evolution operator is local in the sense that the walker must visit the neighboring locations before endeavoring to…

The energy level statistics of uniform random graphs are studied, by treating the graphs as random tight-binding lattices. The inherent random geometry of the graphs and their dynamical spatial dimensionality, leads to various quantum…

The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is dynamically changing or unknown, it is not…

Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the…