Related papers: Mean Field Approximation for Identical Bosons on t…
The Gross-Pitaevskii equation assumes that all (identical) bosons of a condensate reside in a single one-particle function. Here, we raise the question whether it always provides the best mean-field ansatz for condensates, leading to the…
A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…
This paper derives normal approximation results for subgraph counts written as multiparameter stochastic integrals in a random-connection model based on a Poisson point process. By combinatorial arguments we express the cumulants of general…
A simple criterion to optimise coarse-grainings for exact renormalisation group equations is given. It is aimed at improving the convergence of approximate solutions of flow equations. The optimisation criterion is generic, as it refers…
In this article we show, in a concise manner, a result of uniform in time propagation of chaos for non exchangeable systems of particles interacting according to a random graph. Provided the interaction is Lipschitz continuous, the…
Parameter-dependent statistical properties of spectra of totally connected irregular quantum graphs with Neumann boundary conditions are studied. The autocorrelation functions of level velocities c(x) and c(w,x) as well as the distributions…
This paper studies a general class of stochastic population processes in which agents interact with one another over a network. Agents update their behaviors in a random and decentralized manner according to a policy that depends only on…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…
In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…
We study a class of linear-quadratic stochastic differential games in which each player interacts directly only with its nearest neighbors in a given graph. We find a semi-explicit Markovian equilibrium for any transitive graph, in terms of…
In this paper we obtain non-uniform Berry-Esseen bounds for normal approximations by the Malliavin-Stein method. The techniques rely on a detailed analysis of the solutions of Stein's equations and will be applied to functionals of a…
We consider the long time behavior of heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with weights characterized by an underlying graphon. The limit is given by…
Random interaction models have been successful in describing the amorphous properties of solids such as spin-glasses and structural glasses. This modelling approach is applied to a system of zero-spin cold bosons moving in an amorphous…
We consider a system of $N$ particles interacting through their empirical distribution on a finite state space in continuous time. In the formal limit as $N\to\infty$, the system takes the form of a nonlinear (McKean--Vlasov) Markov chain.…
We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary…
We present a unified framework, with quantitative estimates, for deterministic interacting particle systems whose pairwise interactions may depend on heterogeneous labels. Heterogeneity is kept at every level by adding a frozen label…
We present a novel approach to modeling dynamics of trapped, degenerate, weakly interacting Bose gases beyond the mean field limit. We transform a many-body problem to the interaction representation with respect to a suitably chosen part of…
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well as over the choice of tractable families used for the…
In this paper, we present an innovative particle system characterized by moderate interactions, designed to accurately approximate kinetic flocking models that incorporate singular interaction forces and local alignment mechanisms. We…
We show how a candidate mean-field amplitude can be constructed from the exact wave function of an externally forced $N$-Boson system. The construction makes use of subsidiary $(N-1)$-particle states which are propagated in time in addition…