672 research outputs found
Complex singularities and PDEs
In this paper we give a review on the computational methods used to
characterize the complex singularities developed by some relevant PDEs. We
begin by reviewing the singularity tracking method based on the analysis of the
Fourier spectrum. We then introduce other methods generally used to detect the
hidden singularities. In particular we show some applications of the Pad\'e
approximation, of the Kida method, and of Borel-Polya method. We apply these
techniques to the study of the singularity formation of some nonlinear
dispersive and dissipative one dimensional PDE of the 2D Prandtl equation, of
the 2D KP equation, and to Navier-Stokes equation for high Reynolds number
incompressible flows in the case of interaction with rigid boundaries
Automatic enumeration of regular objects
We describe a framework for systematic enumeration of families combinatorial
structures which possess a certain regularity. More precisely, we describe how
to obtain the differential equations satisfied by their generating series.
These differential equations are then used to determine the initial counting
sequence and for asymptotic analysis. The key tool is the scalar product for
symmetric functions and that this operation preserves D-finiteness.Comment: Corrected for readability; To appear in the Journal of Integer
Sequence
On martingale tail sums in affine two-color urn models with multiple drawings
In two recent works, Kuba and Mahmoud (arXiv:1503.090691 and
arXiv:1509.09053) introduced the family of two-color affine balanced Polya urn
schemes with multiple drawings. We show that, in large-index urns (urn index
between and ) and triangular urns, the martingale tail sum for the
number of balls of a given color admits both a Gaussian central limit theorem
as well as a law of the iterated logarithm. The laws of the iterated logarithm
are new even in the standard model when only one ball is drawn from the urn in
each step (except for the classical Polya urn model). Finally, we prove that
the martingale limits exhibit densities (bounded under suitable assumptions)
and exponentially decaying tails. Applications are given in the context of node
degrees in random linear recursive trees and random circuits.Comment: 17 page
Complexes of block copolymers in solution: tree approximation
We determine the statistical properties of block copolymer complexes in solution. These complexes are assumed to have the topological structure of (i) a tree or of (ii) a line-dressed tree. In case the structure is that of a tree, the system is shown to undergo a gelation transition at sufficiently high polymer concentration. However, if the structure is that of a line-dressed tree, this transition is absent. Hence, we show the assumption about the topological structure to be relevant for the statistical properties of the system. We determine the average size of the complexes and calculate the viscosity of the system under the assumption that the complexes geometrically can be treated as porous spheres
Distribution of roots of random real generalized polynomials
The average density of zeros for monic generalized polynomials,
, with real holomorphic and
real Gaussian coefficients is expressed in terms of correlation functions of
the values of the polynomial and its derivative. We obtain compact expressions
for both the regular component (generated by the complex roots) and the
singular one (real roots) of the average density of roots. The density of the
regular component goes to zero in the vicinity of the real axis like
. We present the low and high disorder asymptotic
behaviors. Then we particularize to the large limit of the average density
of complex roots of monic algebraic polynomials of the form with real independent, identically distributed
Gaussian coefficients having zero mean and dispersion . The average density tends to a simple, {\em universal}
function of and in the domain where nearly all the roots are located for
large .Comment: 17 pages, Revtex. To appear in J. Stat. Phys. Uuencoded gz-compresed
tarfile (.66MB) containing 8 Postscript figures is available by e-mail from
[email protected]
High-dimensional Bayesian inference via the Unadjusted Langevin Algorithm
We consider in this paper the problem of sampling a high-dimensional
probability distribution having a density with respect to the Lebesgue
measure on , known up to a normalization constant . Such problem naturally occurs for example in Bayesian inference and machine
learning. Under the assumption that is continuously differentiable, is globally Lipschitz and is strongly convex, we obtain non-asymptotic
bounds for the convergence to stationarity in Wasserstein distance of order
and total variation distance of the sampling method based on the Euler
discretization of the Langevin stochastic differential equation, for both
constant and decreasing step sizes. The dependence on the dimension of the
state space of these bounds is explicit. The convergence of an appropriately
weighted empirical measure is also investigated and bounds for the mean square
error and exponential deviation inequality are reported for functions which are
measurable and bounded. An illustration to Bayesian inference for binary
regression is presented to support our claims.Comment: Supplementary material available at
https://hal.inria.fr/hal-01176084/. arXiv admin note: substantial text
overlap with arXiv:1507.0502
- …