Related papers: Mean Field Approximation for Identical Bosons on t…
The Equal Filling Approximation, a procedure widely used in mean field calculations to treat the dynamics of odd nuclei in a time reversal invariant way, is justified as the consequence of a variational principle over an average energy…
We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups, called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state…
This paper gives sharp rates of convergence for natural versions of the Metropolis algorithm for sampling from the uniform distribution on a convex polytope. The singular proposal distribution, based on a walk moving locally in one of a…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
A necessary and sufficient condition for a random walk in a finite directed graph subject to a road coloring to be measurable with respect to the driving random road colors is proved to be that the road coloring is synchronizing. For this,…
In this work, we consider the spatial search for a general marked state on graphs by continuous time quantum walks. As a simplest case, we compute the amplitude expression of the search for the multi-vertex uniform superposition state on…
Starting from first principle many-body quantum dynamics, we show that the dynamics of Bose-Einstein condensates can be approximated by the time-dependent nonlinear Gross-Pitaevskii equation, giving a bound on the rate of the convergence.…
Motivated by the difficulty arising in the numerical simulation of the movement of charged particles in presence of a large external magnetic field, which adds an additional time scale and thus imposes to use a much smaller time step, we…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
In a recently developed approximation technique for quantum field theory the standard one-loop result is used as a seed for a recursive formula that gives a sequence of improved Gaussian approximations for the generating functional. In this…
In this work we propose a novel method to calculate mean first-passage times (MFPTs) for random walks on graphs, based on a dimensionality reduction technique for Markov State Models, known as local-equilibrium (LE). We show that for a…
We study the ground state of a large number N of 2D anyons in an external magnetic field. We consider a scaling limit where the statistics parameter $\alpha$ tends to zero when N tends to infinity which allows the statistics to be seen as a…
We show that the Potts model on a graph can be approximated by a sequence of independent and identically distributed spins in terms of Wasserstein distance at high temperatures. We prove a similar result for the Curie--Weiss--Potts model on…
Problems of particle dynamics involving unsteady Stokes flows in confined geometries are typically harder to solve than their steady counterparts. Approximation techniques are often the only resort. Felderhof (see e.g. 2005, 2009b) has…
Graph partition is a fundamental problem of parallel computing for big graph data. Many graph partition algorithms have been proposed to solve the problem in various applications, such as matrix computations and PageRank, etc., but none has…
We define a general model of stochastically-evolving graphs, namely the \emph{Edge-Uniform Stochastically-Evolving Graphs}. In this model, each possible edge of an underlying general static graph evolves independently being either alive or…
Pairwise Markov Random Fields (MRFs) or undirected graphical models are parsimonious representations of joint probability distributions. Variables correspond to nodes of a graph, with edges between nodes corresponding to conditional…
We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…
We present the first algorithm for generating random variates exactly uniformly from the set of perfect matchings of a bipartite graph with a polynomial expected running time over a nontrivial set of graphs. Previous Markov chain approaches…
We present a polynomial-time $(\alpha_{GW} + \varepsilon)$-approximation algorithm for the Maximum Cut problem on interval graphs and split graphs, where $\alpha_{GW} \approx 0.878$ is the approximation guarantee of the Goemans-Williamson…