Random graphs on surfaces

Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these investigations to graphs embeddable on any fixed surface S. In particular we show that the labelled graphs embeddable on S have the same growth constant as for planar graphs, and the same holds for unlabelled graphs. Also, if we pick a graph uniformly at random from the graphs embeddable on S which have vertex set {1, . . . , n}, then with probability tending to 1 as n → ∞, this random graph either is connected or consists of one giant component together with a few nodes in small planar components.

Periodic orbits of the planar collision restricted 3-body problem

Using the continuation method we prove that the circular and the elliptic symmetric periodic orbits of the planar rotating Kepler problem can be continued into periodic orbits of the planar collision restricted 3–body problem. Additionally, we also continue to this restricted problem the so called “comets orbits”.

Multiplicity of limit cycles and analytic m-solutions for planar differential systems

"Vegeu el resum a l'inici del document del fitxer adjunt."

On the number of K3,3-minor-free and maximal K3,3-minor-free graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

Non-hyperbolic boundary equilibrium bifurcations in planar Filippov systems: a case study approach

Boundary equilibrium bifurcations in piecewise smooth discontinuous systems are characterized by the collision of an equilibrium point with the discontinuity surface. Generically, these bifurcations are of codimension one, but there are scenarios where the phenomenon can be of higher codimension. Here, the possible collision of a non-hyperbolic equilibrium with the boundary in a two-parameter framework and the nonlinear phenomena associated with such collision are considered. By dealing with planar discontinuous (Filippov) systems, some of such phenomena are pointed out through specific representative cases. A methodology for obtaining the corresponding bi-parametric bifurcation sets is developed.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.

On the growth rate of minor-closed classes of graphs

"Vegeu el resum a l'inici del document del fitxer adjunt."

Destruction of invariant curves in the restricted circular planar three body problem using comparison of action

"Vegeu el resum a l'inici del document del fitxer adjunt."

Symmetric planar central configurations of five bodies: Euler plus two

We study planar central configurations of the five-body problem where three of the bodies are collinear, forming an Euler central configuration of the three-body problem, and the two other bodies together with the collinear configuration are in the same plane. The problem considered here assumes certain symmetries. From the three bodies in the collinear configuration, the two bodies at the extremities have equal masses and the third one is at the middle point between the two. The fourth and fifth bodies are placed in a symmetric way: either with respect to the line containing the three bodies, or with respect to the middle body in the collinear configuration, or with respect to the perpendicular bisector of the segment containing the three bodies. The possible stacked five-body central configurations satisfying these types of symmetries are: a rhombus with four masses at the vertices and a fifth mass in the center, and a trapezoid with four masses at the vertices and a fifth mass at the midpoint of one of the parallel sides.

On graphs with few disjoint t-stars

"Vegeu el resum a l'inici del document del fitxer adjunt."

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

On a family of strongly regular graphs with λ = 1

Vegeu el resum a l'inici del document del fitxer adjunt.

Monocular-based 3-D seafloor reconstruction and ortho-mosaicing by piecewise planar representation

Photo-mosaicing techniques have become popular for seafloor mapping in various marine science applications. However, the common methods cannot accurately map regions with high relief and topographical variations. Ortho-mosaicing borrowed from photogrammetry is an alternative technique that enables taking into account the 3-D shape of the terrain. A serious bottleneck is the volume of elevation information that needs to be estimated from the video data, fused, and processed for the generation of a composite ortho-photo that covers a relatively large seafloor area. We present a framework that combines the advantages of dense depth-map and 3-D feature estimation techniques based on visual motion cues. The main goal is to identify and reconstruct certain key terrain feature points that adequately represent the surface with minimal complexity in the form of piecewise planar patches. The proposed implementation utilizes local depth maps for feature selection, while tracking over several views enables 3-D reconstruction by bundle adjustment. Experimental results with synthetic and real data validate the effectiveness of the proposed approach

Impacto en el análisis con wbr™ en la valoración planar y tomográfica (SPECT-TC) de paratiroides

El estudio del hiperparatirodismo es una indicación cada vez más frecuente en Medicina nuclear debido a la incorporación de técnica híbrida SPECT-TC, que añade a la gammagrafía planar convencional de doble trazador (MIBI y Pertecnetato) y doble fase (10 minutos y 2 horas) información sobre localización, fundamentalmente. El sistema de procesado convencional (reconstrucción iterativa OSEM) presenta buenos resultados, no obstante, existen limitaciones como son la resolución espacial y ruido. El sistema de reconstrucción Wide Beam Reconstruction WBR™ mejora fundamentalmente estos aspectos. Con este objetivo, se ha realizado una comparación entre ambos métodos, en pacientes con sospecha de hiperparatiroidismo.

Planar homography: accuracy analysis and applications

Projective homography sits at the heart of many problems in image registration. In addition to many methods for estimating the homography parameters (R.I. Hartley and A. Zisserman, 2000), analytical expressions to assess the accuracy of the transformation parameters have been proposed (A. Criminisi et al., 1999). We show that these expressions provide less accurate bounds than those based on the earlier results of Weng et al. (1989). The discrepancy becomes more critical in applications involving the integration of frame-to-frame homographies and their uncertainties, as in the reconstruction of terrain mosaics and the camera trajectory from flyover imagery. We demonstrate these issues through selected examples