Related papers: Mean Field Approximation for Identical Bosons on t…
Anyons are 2D or 1D quantum particles with intermediate statistics, interpolating between bosons and fermions. We study the ground state of a large number N of 2D anyons, in a scaling limit where the statistics parameter is proportional to…
For one-dimensional simple random walk in a general i.i.d. scenery and its limiting process we construct a coupling with explicit rate of approximation extending a recent result for Gaussian sceneries due to Khoshnevisan and Lewis.…
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…
These lecture notes treat the mean-field approximation for equilibrium states of N body systems in classical and quantum statistical mechanics. A general strategy to justify effective models based on assumptions of statistical independence…
We study a class of graphon particle systems with time-varying random coefficients. In a graphon particle system, the interactions among particles are characterized by the coupled mean field terms through an underlying graphon and the…
The adaptive Thouless--Anderson--Palmer (TAP) mean-field approximation is one of the advanced mean-field approaches, and it is known as a powerful accurate method for Markov random fields (MRFs) with quadratic interactions (pairwise MRFs).…
We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent…
We consider the problem of detecting a random walk on a graph, based on observations of the graph nodes. When visited by the walk, each node of the graph observes a signal of elevated mean, which we assume can be different across different…
We consider a quantum walk model on a finite graph which has an interaction with the outside. Here a quantum walker from the outside penetrates the graph and also a quantum walker in the graph goes out to the outside at every time step.…
We construct from first principles a perturbative framework for studying nonequilibrium quantum-field systems that include gauge bosons. The system of our concern is quasiuniform system near equilibrium or nonequilibrium quasistationary…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
A two-state spin system is specified by a 2 x 2 matrix A = {A_{0,0} A_{0,1}, A_{1,0} A_{1,1}} = {\beta 1, 1 \gamma} where \beta, \gamma \ge 0. Given an input graph G=(V,E), the partition function Z_A(G) of a system is defined as Z_A(G) =…
We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
Gradient flow in the 2-Wasserstein space is widely used to optimize functionals over probability distributions and is typically implemented using an interacting particle system with $n$ particles. Analyzing these algorithms requires showing…
In this paper, we consider graphon particle systems with heterogeneous mean-field type interactions and the associated finite particle approximations. Under suitable growth (resp. convexity) assumptions, we obtain uniform-in-time…
We study the representation of stationary Gaussian Markov random fields as factors of i.i.d. processes, with a focus on their approximation by finitely dependent distributions. Our model is a Gaussian field on $\mathbf{Z}^d$ such that the…
We investigate the resolution of second-order, potential, and monotone mean field games with the generalized conditional gradient algorithm, an extension of the Frank-Wolfe algorithm. We show that the method is equivalent to the fictitious…
The structure and degeneracy of ground states of the Gross-Pitaevskii energy functional play a central role in both analysis and computation, yet a precise characterization of the ground-state manifold in the presence of symmetries remains…