Related papers: The principle of least action for random graphs
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
A random geometric graph $G(\mathcal{X}_n, r_n)$ is formed by taking a binomial process $\mathcal{X}_n$ as the set of vertices and joining any two distinct points with an edge if they lie within distance $r_n$ of each other. We investigate…
Circuit quantization is an extraordinarily successful theory that describes the behavior of quantum circuits with high precision. The most widely used approach of circuit quantization relies on introducing a classical Lagrangian whose…
In this paper we investigate the numerical approximation of an analogue of the Wasserstein distance for optimal transport on graphs that is defined via a discrete modification of the Benamou--Brenier formula. This approach involves the…
This is an attempt to address diffusion phenomena from the point of view of information theory. We imagine a regular hamiltonian system under the random perturbation of thermal (molecular) noise and chaotic instability. The irregularity of…
Approaches from statistical physics are applied to investigate the structure of network models whose growth rules mimic aspects of the evolution of the world-wide web. We first determine the degree distribution of a growing network in which…
Here I present a new discrete model of quantum mechanics for relativistic 1-electron systems, in which particle movement is described by a directed space-time graph with attached 4-spinors, but without any continuous wave functions. These…
We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…
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…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
We analyze eigenvalues fluctuations of the Laplacian of various networks under the random matrix theory framework. Analyses of random networks, scale-free networks and small-world networks show that nearest neighbor spacing distribution of…
We demonstrate a mechanism for the production of massive excitations in graphs. We treat the number of neighbors at each vertex in the graph (degree) as a scalar field. Then we introduce a mechanism inspired by the Higgs mechanism in…
We consider the random graph $G_{n, {\bf d}}$ chosen uniformly at random from the set of all graphs with a given sparse degree sequence ${\bf d}$. We assume ${\bf d}$ has minimum degree at least 4, at most a power law tail, and place one…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
Action-dependent field theories are systems where the Lagrangian or Hamiltonian depends on new variables that encode the action. They model a larger class of field theories, including non-conservative behavior, while maintaining a…
An analysis is made of a moving disturbance using a directed cyclic graph. A statistical approach is used to calculate the alternative positions in space and state of the disturbance with a defined observed time. The probability for a…
We propose a family of lagged random walk sampling methods in simple undirected graphs, where transition to the next state (i.e. node) depends on both the current and previous states -- hence, lagged. The existing random walk sampling…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
A class of high-order canonical symplectic structure-preserving geometric algorithms are developed for high-quality simulations of the quantized Dirac-Maxwell theory based strong-field quantum electrodynamics (SFQED) and relativistic…
We consider the problem of sampling from a target distribution, which is \emph {not necessarily logconcave}, in the context of empirical risk minimization and stochastic optimization as presented in Raginsky et al. (2017). Non-asymptotic…