相关论文: Connected allocation to Poisson points in R^2
We derive a formally simple approximate analytical solution to the Poisson-Boltzmann equation for the spherical system via a geometric mapping. Its regime of applicability in the parameter space of the spherical radius and the surface…
Reversible part of evolution equations of physical systems is often generated by a Poisson bracket. We discuss geometric means of construction of Poisson brackets and their mutual coupling (direct, semidirect and matched-pair products) as…
Poisson Surface Reconstruction is a widely-used algorithm for reconstructing a surface from an oriented point cloud. To facilitate applications where only partial surface information is available, or scanning is performed sequentially, a…
Using a new class of exactly solvable models based on the pairing interaction, we show that it is possible to construct integrable Hamiltonians with a Wigner distribution of nearest neighbor level spacings. However, these Hamiltonians…
Neutron-proton pairing correlations are studied within the context of two solvable models, one based on the algebra SO(5) and the other on the algebra SO(8). Boson-mapping techniques are applied to these models and shown to provide a…
We establish Poisson and compound Poisson approximations for stabilizing statistics of $\beta$-mixing point processes and give explicit rates of convergence. Our findings are based on a general estimate of the total variation distance of a…
This is the second of two papers, in which we prove a version of Conn's linearization theorem for the Lie algebra $\mathfrak{sl}_2(\mathbb{C})\simeq \mathfrak{so}(3,1)$. Namely, we show that any Poisson structure whose linear approximation…
The partition function of the 2d Ising model with random nearest neighbor coupling is expressed in the dual lattice made of square plaquettes. The dual model is solved in the the mean field and in different types of Bethe-Peierls…
We consider a stationary Poisson hyperplane process with given directional distribution and intensity in $d$-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body $K$ and consider the intersection…
Hamiltonian formulation of N=3 systems is considered in general. The most general solution of the Jacobi equation in ${\mathbb R}^3$ is proposed. Compatible Poisson structures and the corresponding bi-Hamiltonian N=3 systems are also…
When the phase space P of a Hamiltonian G-system (P, \omega, G, J, H) has an almost Kahler structure a preferred connection, called abstract mechanical connection, can be defined by declaring horizontal spaces at each point to be metric…
We investigate a spatial random graph model whose vertices are given as a marked Poisson process on $\mathbb{R}^d$. Edges are inserted between any pair of points independently with probability depending on the spatial displacement of the…
In the framework of the connection theory, a contravariant analog of the Sternberg coupling procedure is developed for studying a natural class of Poisson structures on fiber bundles, called coupling tensors. We show that every Poisson…
We consider a curved space-time whose algebra of functions is the commutative limit of a noncommutative algebra and which has therefore an induced Poisson structure. In a simple example we determine a relation between this structure and the…
We calculate equilibrium solutions for Ising spin models on `small world' lattices, which are constructed by super-imposing random and sparse Poissonian graphs with finite average connectivity c onto a one-dimensional ring. The nearest…
A plane algebraic curve whose Newton polygone contains d lattice points can be given by d points it passes through. Then the coefficients of its equation Poisson commute having been regarded as functions of coordinates of those points. It…
This paper studies the problem of distributed Riemannian optimization over a network of agents whose cost functions are geodesically smooth but possibly geodesically non-convex. Extending a well-known distributed optimization strategy…
We give a general framework for approximations to combinatorial assemblies, especially suitable to the situation where the number $k$ of components is specified, in addition to the overall size $n$. This involves a Poisson process, which,…
The parquet approach to vertex corrections is unbiased but computationally demanding. Most applications are therefore restricted to small cluster sizes or rely on various simplifying approximations. We have recently shown that the…
In this paper we give a historical account of the development of Poisson approximation using Stein's method and present some of the main results. We give two recent applications, one on maximal arithmetic progressions and the other on…