Related papers: Phase portraits of random planar homogeneous vecto…

We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.

We use Monte Carlo simulation to study the phase diagram of three-dimensional dynamical triangulations with a boundary. Three phases are indentified and characterized. One of these phases is a new, boundary dominated phase; a simple…

Monte Carlo simulations are based on the manipulation of random numbers to evaluate probable outcomes, with applicability in a variety of different fields. By assigning probabilities, which can be determined a priori, to various events, it…

The order of convergence of the Monte Carlo method is 1/2 which means that we need quadruple samples to decrease the error in half in the numerical simulation. Multilevel Monte Carlo methods reach the same order of error by spending less…

Let R be a commutative ring with 1. For every homogeneous polynomial f(X_0,X_1,X_2) in R[X_0,X_1,X_2] of degree d <= 25, we find a explicit linear Pfaffian R-representation of f. We describe an empirical method that leads us to find such…

In this paper we study the behavior of maximum out/in-degree of binomial/Poisson random scaled sector graphs in the presence of random vertex and edge faults. We prove that the probability distribution of maximum degrees for random faulty…

We consider a phase retrieval problem, where the goal is to reconstruct a $n$-dimensional complex vector from its phaseless scalar products with $m$ sensing vectors, independently sampled from complex normal distributions. We show that,…

In this work, we propose a Path Integral Monte Carlo (PIMC) approach based on discretized continuous degrees of freedom and rejection-free Gibbs sampling. The ground state properties of a chain of planar rotors with dipole-dipole…

In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…

For long term investments, model portfolios are defined at the level of indexes, a setup known as Strategic Asset Allocation (SAA). The possible outcomes at a scale of a few decades can be obtained by Monte Carlo simulations, resulting in a…

In this paper, we use affine surfaces to describe completely the real-time trajectories of a homogeneous vector field in $\mathbf{C}^{2}$. We prove the existence of a continuous "rotation number" in $\mathbf{C}^{2}$ which is constant along…

We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen…

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the…

We study the static screening in a Hubbard-like model using fixed-node diffusion Monte Carlo. We find that the random phase approximation is surprisingly accurate even for metallic systems close to the Mott transition. As a specific…

With its systematic exploration of probability distributions, Hamiltonian Monte Carlo is a potent Markov Chain Monte Carlo technique; it is an approach, however, ultimately contingent on the choice of a suitable Hamiltonian function. By…

In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…

For real symmetric matrices that are accessible only through matrix vector products, we present Monte Carlo estimators for computing the diagonal elements. Our probabilistic bounds for normwise absolute and relative errors apply to Monte…

We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…

We survey results on the distribution of zeros of random polynomials and of random holomorphic sections of line bundles, especially for large classes of probability measures on the spaces of holomorphic sections. We provide furthermore some…

Many problems in materials science and biology involve particles interacting with strong, short-ranged bonds, that can break and form on experimental timescales. Treating such bonds as constraints can significantly speed up sampling their…