641 research outputs found
Random Convex Hulls and Extreme Value Statistics
In this paper we study the statistical properties of convex hulls of
random points in a plane chosen according to a given distribution. The points
may be chosen independently or they may be correlated. After a non-exhaustive
survey of the somewhat sporadic literature and diverse methods used in the
random convex hull problem, we present a unifying approach, based on the notion
of support function of a closed curve and the associated Cauchy's formulae,
that allows us to compute exactly the mean perimeter and the mean area enclosed
by the convex polygon both in case of independent as well as correlated points.
Our method demonstrates a beautiful link between the random convex hull problem
and the subject of extreme value statistics. As an example of correlated
points, we study here in detail the case when the points represent the vertices
of independent random walks. In the continuum time limit this reduces to
independent planar Brownian trajectories for which we compute exactly, for
all , the mean perimeter and the mean area of their global convex hull. Our
results have relevant applications in ecology in estimating the home range of a
herd of animals. Some of these results were announced recently in a short
communication [Phys. Rev. Lett. {\bf 103}, 140602 (2009)].Comment: 61 pages (pedagogical review); invited contribution to the special
issue of J. Stat. Phys. celebrating the 50 years of Yeshiba/Rutgers meeting
Convergence theorems for quantum annealing
We prove several theorems to give sufficient conditions for convergence of
quantum annealing, which is a protocol to solve generic optimization problems
by quantum dynamics. In particular the property of strong ergodicity is proved
for the path-integral Monte Carlo implementation of quantum annealing for the
transverse Ising model under a power decay of the transverse field. This result
is to be compared with the much slower inverse-log decay of temperature in the
conventional simulated annealing. Similar results are proved for the Green's
function Monte Carlo approach. Optimization problems in continuous space of
particle configurations are also discussed.Comment: 19 page
The stability of a graph partition: A dynamics-based framework for community detection
Recent years have seen a surge of interest in the analysis of complex
networks, facilitated by the availability of relational data and the
increasingly powerful computational resources that can be employed for their
analysis. Naturally, the study of real-world systems leads to highly complex
networks and a current challenge is to extract intelligible, simplified
descriptions from the network in terms of relevant subgraphs, which can provide
insight into the structure and function of the overall system.
Sparked by seminal work by Newman and Girvan, an interesting line of research
has been devoted to investigating modular community structure in networks,
revitalising the classic problem of graph partitioning.
However, modular or community structure in networks has notoriously evaded
rigorous definition. The most accepted notion of community is perhaps that of a
group of elements which exhibit a stronger level of interaction within
themselves than with the elements outside the community. This concept has
resulted in a plethora of computational methods and heuristics for community
detection. Nevertheless a firm theoretical understanding of most of these
methods, in terms of how they operate and what they are supposed to detect, is
still lacking to date.
Here, we will develop a dynamical perspective towards community detection
enabling us to define a measure named the stability of a graph partition. It
will be shown that a number of previously ad-hoc defined heuristics for
community detection can be seen as particular cases of our method providing us
with a dynamic reinterpretation of those measures. Our dynamics-based approach
thus serves as a unifying framework to gain a deeper understanding of different
aspects and problems associated with community detection and allows us to
propose new dynamically-inspired criteria for community structure.Comment: 3 figures; published as book chapte
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-HĂŒbner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro PezzĂ©, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
Fermionic construction of tau functions and random processes
Tau functions expressed as fermionic expectation values are shown to provide
a natural and straightforward description of a number of random processes and
statistical models involving hard core configurations of identical particles on
the integer lattice, like a discrete version simple exclusion processes (ASEP),
nonintersecting random walkers, lattice Coulomb gas models and others, as well
as providing a powerful tool for combinatorial calculations involving paths
between pairs of partitions. We study the decay of the initial step function
within the discrete ASEP (d-ASEP) model as an example.Comment: 53 pages, 13 figures, a contribution to Proc. "Mathematics and
Physics of Growing Interfaces
The Correlation Functions of the XXZ Heisenberg Chain for Zero or Infinite Anisotropy and Random Walks of Vicious Walkers
The XXZ Heisenberg chain is considered for two specific limits of the
anisotropy parameter: \Dl\to 0 and \Dl\to -\infty. The corresponding wave
functions are expressed by means of the symmetric Schur functions. Certain
expectation values and thermal correlation functions of the ferromagnetic
string operators are calculated over the base of N-particle Bethe states. The
thermal correlator of the ferromagnetic string is expressed through the
generating function of the lattice paths of random walks of vicious walkers. A
relationship between the expectation values obtained and the generating
functions of strict plane partitions in a box is discussed. Asymptotic estimate
of the thermal correlator of the ferromagnetic string is obtained in the limit
of zero temperature. It is shown that its amplitude is related to the number of
plane partitions.Comment: 22 pages, 1 figure, LaTe
- âŠ