Related papers: Mean Field Approximation for Identical Bosons on t…
For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…
We present a general and model-independent method to obtain an effective Markovian quantum kinetic equation for the expectation value of a slowly evolving scalar field in an adiabatically evolving background from first principles of…
In this work, we propose a global model selection criterion to estimate the graph of conditional dependencies of a random vector based on a finite sample. By global criterion, we mean optimizing a function over the entire set of possible…
In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial…
We propose a new approach to deriving quantitative mean field approximations for any probability measure $P$ on $\mathbb{R}^n$ with density proportional to $e^{f(x)}$, for $f$ strongly concave. We bound the mean field approximation for the…
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…
The Gromov-Wasserstein (GW) distance enables comparing metric measure spaces based solely on their internal structure, making it invariant to isomorphic transformations. This property is particularly useful for comparing datasets that…
The weakly interacting trapped Bose gases have been customarily described using the mean-field approximation in the form of the Gross-Pitaevskii equation. The mean-field approximation, however, has certain limitations, in particular it can…
We present a novel methodological framework for quantum spatial search, generalising the Childs & Goldstone ($\mathcal{CG}$) algorithm via alternating applications of marked-vertex phase shifts and continuous-time quantum walks. We…
We consider the limiting behavior of the count of subgraphs isomorphic to a graph $G$ with $m\geq 0$ fixed endpoints (or roots) in the random-connection model, as the intensity $\lambda$ of the underlying Poisson point process tends to…
The aim of this paper it to establish sufficient conditions for consistency of moving block bootstrap for non-stationary time series with periodic and almost periodic structure. The parameter of the study is the mean value of the…
We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the…
The field theoretic renormalization group is applied to a simple model of random walk on a rough fluctuating surface. We consider the Fokker--Planck equation for a particle in a uniform gravitational field. The surface is modelled by the…
Generalized gamma distributions arise as limits in many settings involving random graphs, walks, trees, and branching processes. Pek\"oz, R\"ollin, and Ross (2016, arXiv:1309.4183 [math.PR]) exploited characterizing distributional fixed…
We generalize Grover algorithm with two arbitrary phases in a density matrix set up. We give exact analytic expressions for the success probability after arbitrary number of iteration of the generalized Grover operator as a function of…
In this paper, we present new Poisson-type deviation inequalities for continuous-time Markov chains whose Wasserstein curvature or $\Gamma$-curvature is bounded below. Although these two curvatures are equivalent for Brownian motion on…
We study the optimal estimation of probability matrices of random graph models generated from graphons. This problem has been extensively studied in the case of step-graphons and H\"older smooth graphons. In this work, we characterize the…
This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs…
This paper establishes an upper bound on the number of generalized cospectral mates of simple graphs, where the generalized spectrum consists of the spectrum of a graph and its complement. Moving beyond the classical problem of identifying…
The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if $\gcd(u - v, n) = 1$. In this paper, we study periodicity and perfect state transfer of Grover walks on the unitary Cayley…