Related papers: Phase portraits of random planar homogeneous vecto…
A random 2-cell embedding of a connected graph $G$ in some orientable surface is obtained by choosing a random local rotation around each vertex. Under this setup, the number of faces or the genus of the corresponding 2-cell embedding…
We overview a series of recent works devoted to variance reduction techniques for numerical stochastic homogenization. Numerical homogenization requires solving a set of problems at the micro scale, the so-called corrector problems. In a…
We prove that a class of superlinear indefinite problems with homogeneous Neumann boundary conditions admits an arbitrarily high number of positive solutions, provided that the parameters of the problem are adequately chosen. The…
Integer sequences where each element is determined by a previous randomly chosen element are investigated analytically. In particular, the random geometric series x_n=2x_p with 0<=p<=n-1 is studied. At large n, the moments grow…
We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…
We apply a diagrammatic Monte Carlo method to the problem of an impurity interacting resonantly with a homogeneous Fermi bath for a quasi-two-dimensional setup. Notwithstanding the series divergence, we can show numerically that the three…
We introduce a system of parameters for the Monte Carlo generation of Lorentz invariant phase space that is particularly well-suited to the treatment of the infrared divergences that occur in the most singular, Born-like configurations of…
We present a new method for investigating first-order phase transitions using Monte Carlo simulations. It relies on the multiple-histogram method and uses solely histograms of individual phases. In addition, we extend the method to include…
The trace of a matrix function f(A), most notably of the matrix inverse, can be estimated stochastically using samples< x,f(A)x> if the components of the random vectors x obey an appropriate probability distribution. However such a…
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for…
The behavior of the one-dimensional random-force-driven Burgers equation is investigated in the path integral formalism on a discrete space-time lattice. We show that by means of Monte Carlo methods one may evaluate observables, such as…
The behaviour of the one--dimensional random--forced Burgers equation is investigated in the path integral formalism, using a discrete space--time lattice. We show that by means of Monte Carlo methods one may evaluate observables, such as…
When dealing with difficult inverse problems such as inverse rendering, using Monte Carlo estimated gradients to optimise parameters can slow down convergence due to variance. Averaging many gradient samples in each iteration reduces this…
In this paper we investigate phase flows over $\mathbb{C}^n$ and $\mathbb{R}^n$ generated by vector fields $V=\sum P^{i}\partial_i$ where $P^{i}$ are finite degree polynomials. With the convenient diagrammatic technique we get expressions…
In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…
This paper focuses on signal processing tasks in which the signal is transformed from the signal space to a higher dimensional coefficient space (also called phase space) using a continuous frame, processed in the coefficient space, and…
Iterative phase retrieval algorithms typically employ projections onto constraint subspaces to recover the unknown phases in the Fourier transform of an image, or, in the case of x-ray crystallography, the electron density of a molecule.…
A Monte Carlo method for computing the action of a matrix exponential for a certain class of matrices on a vector is proposed. The method is based on generating random paths, which evolve through the indices of the matrix, governed by a…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
We consider a zero-range process with two species of interacting particles. The steady state phase diagram of this model shows a variety of condensate phases in which a single site contains a finite fraction of all the particles in the…