Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

Regge calculus in teleparallel gravity

In the context of the teleparallel equivalent of general relativity, the Weitzenbock manifold is considered as the limit of a suitable sequence of discrete lattices composed of an increasing number of smaller and smaller simplices, where the interior of each simplex (Delaunay lattice) is assumed to be flat. The link lengths l between any pair of vertices serve as independent variables, so that torsion turns out to be localized in the two-dimensional hypersurfaces (dislocation triangle, or hinge) of the lattice. Assuming that a vector undergoes a dislocation in relation to its initial position as it is parallel transported along the perimeter of the dual lattice (Voronoi polygon), we obtain the discrete analogue of the teleparallel action, as well as the corresponding simplicial vacuum field equations.

Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks

In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks. © 2012 IEEE.

Equivalente teleparalelo de algumas soluções da relatividade geral

Pós-graduação em Física - IFT

Discrete solitons and vortices in hexagonal and honeycomb lattices: Existence, stability, and dynamics

We consider a prototypical dynamical lattice model, namely, the discrete nonlinear Schrodinger equation on nonsquare lattice geometries. We present a systematic classification of the solutions that arise in principal six-lattice-site and three-lattice-site contours in the form of both discrete multipole solitons and discrete vortices. Additionally to identifying the possible states, we analytically track their linear stability both qualitatively and quantitatively. We find that among the six-site configurations, the

Discrete breathers in hexagonal dusty plasma lattices

The occurrence of single-site or multisite localized vibrational modes, also called discrete breathers, in two-dimensional hexagonal dusty plasma lattices is investigated. The system is described by a Klein-Gordon hexagonal lattice characterized by a negative coupling parameter epsilon in account of its inverse dispersive behavior. A theoretical analysis is performed in order to establish the possibility of existence of single as well as three-site discrete breathers in such systems. The study is complemented by a numerical investigation based on experimentally provided potential forms. This investigation shows that a dusty plasma lattice can support single-site discrete breathers, while three-site in phase breathers could exist if specific conditions, about the intergrain interaction strength, would hold. On the other hand, out of phase and vortex three-site breathers cannot be supported since they are highly unstable.

Means on discrete product lattices

We investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties. We also discuss which of them coincide with the Cartesian product of the standard mean and median.

Image reduction using means on discrete product lattices

We investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and we discuss which of them coincide with the Cartesian product of the standard mean and median. We apply these functions in image processing. We present three algorithms for color image reduction based on minimizing penalty functions on discrete product lattices.

Lattices and discrete methods in cooperative games and decisions

Questa tesi si pone l'obiettivo di presentare la teoria dei giochi, in particolare di quelli cooperativi, insieme alla teoria delle decisioni, inquadrandole formalmente in termini di matematica discreta. Si tratta di due campi dove l'indagine si origina idealmente da questioni applicative, e dove tuttavia sono sorti e sorgono problemi più tipicamente teorici che hanno interessato e interessano gli ambienti matematico e informatico. Anche se i contributi iniziali sono stati spesso formulati in ambito continuo e utilizzando strumenti tipici di teoria della misura, tuttavia oggi la scelta di modelli e metodi discreti appare la più idonea. L'idea generale è quindi quella di guardare fin da subito al complesso dei modelli e dei risultati che si intendono presentare attraverso la lente della teoria dei reticoli. Ciò consente di avere una visione globale più nitida e di riuscire agilmente ad intrecciare il discorso considerando congiuntamente la teoria dei giochi e quella delle decisioni. Quindi, dopo avere introdotto gli strumenti necessari, si considerano modelli e problemi con il fine preciso di analizzare dapprima risultati storici e solidi, proseguendo poi verso situazioni più recenti, più complesse e nelle quali i risultati raggiunti possono suscitare perplessità. Da ultimo, vengono presentate alcune questioni aperte ed associati spunti per la ricerca.

Localized excitations of charged dust grains in dusty plasma lattices

The nonlinear aspects of charged dust grain motion in a one-dimensional dusty plasma (DP) monolayer are discussed. Both horizontal (longitudinal, acoustic mode) and vertical (transverse, optic mode) displacements are considered, and various types of localized excitations are reviewed, in a continuum approximation. Dust crystals are shown to support nonlinear kink-shaped supersonic longitudinal solitary excitations, as well as modulated envelope (either longitudinal or transverse) localized modes. The possibility for Discrete Breather (DB-) type excitations (Intrinsic Localized Modes, ILMs) to occur is investigated, from first principles. These highly localized excitations owe their existence to lattice discreteness, in combination with the interaction and/or
substrate (sheath) potential nonlinearity. This possibility may open new directions in DP- related research. The relation to previous results on atomic chains as well as to experimental results on strongly-coupled dust layers in gas discharge plasmas is discussed.

Existence and stability of multisite breathers in honeycomb and hexagonal lattices

We study the existence and stability of multisite discrete breathers in two prototypical non-square Klein-Gordon lattices, namely a honeycomb and a hexagonal one. In the honeycomb case we consider six-site configurations and find that for soft potential and positive coupling the out-of-phase breather configuration and the charge-two vortex breather are linearly stable, while the in-phase and charge-one vortex states are unstable. In the hexagonal lattice, we first consider three-site configurations. In the case of soft potential and positive coupling, the in-phase configuration is unstable and the charge-one vortex is linearly stable. The out-of-phase configuration here is found to always be linearly unstable. We then turn to six-site configurations in the hexagonal lattice. The stability results in this case are the same as in the six-site configurations in the honeycomb lattice. For all configurations in both lattices, the stability results are reversed in the setting of either hard potential or negative coupling. The study is complemented by numerical simulations which are in very good agreement with the theoretical predictions. Since neither the form of the on-site potential nor the sign of the coupling parameter involved have been prescribed, this description can accommodate inverse-dispersive systems (e. g. supporting backward waves) such as transverse dust-lattice oscillations in dusty plasma (Debye) crystals or analogous modes in molecular chains.

Nonlinear excitations in strongly-coupled plasma lattices: envelope solitons, kinks and intrinsic localized modes

Ensembles of charged particles (plasmas) are a highly complex form of matter, most often modeled as a many-body system characterized by weak inter-particle interactions (electrostatic coupling). However, strongly-coupled plasma configurations have recently been produced in laboratory, either by creating ultra-cold plasmas confined in a trap or by manipulating dusty plasmas in discharge experiments. In this paper, the nonlinear aspects involved in the motion of charged dust grains in a one-dimensional plasma monolayer (crystal) are discussed. Different types of collective excitations are reviewed, and characteristics and conditions for their occurrence in dusty plasma crystals are discussed, in a quasi-continuum approximation. Dust crystals are shown to support nonlinear kink-shaped supersonic solitary longitudinal excitations, as well as modulated envelope localized modes associated with longitudinal and transverse vibrations. Furthermore, the possibility for intrinsic localized modes (ILMs) — Discrete Breathers (DBs) — to occur is investigated, from first principles. The effect of mode-coupling is also briefly considered. The relation to previous results on atomic chains, and also to experimental results on strongly-coupled dust layers in gas discharge plasmas, is briefly discussed.

Lattice-based Encryption Over Standard Lattices in Hardware

Lattice-based cryptography has gained credence recently as a replacement for current public-key cryptosystems, due to its quantum-resilience, versatility, and relatively low key sizes. To date, encryption based on the learning with errors (LWE) problem has only been investigated from an ideal lattice standpoint, due to its computation and size efficiencies. However, a thorough investigation of standard lattices in practice has yet to be considered. Standard lattices may be preferred to ideal lattices due to their stronger security assumptions and less restrictive parameter selection process. In this paper, an area-optimised hardware architecture of a standard lattice-based cryptographic scheme is proposed. The design is implemented on a FPGA and it is found that both encryption and decryption fit comfortably on a Spartan-6 FPGA. This is the first hardware architecture for standard lattice-based cryptography reported in the literature to date, and thus is a benchmark for future implementations.
Additionally, a revised discrete Gaussian sampler is proposed which is the fastest of its type to date, and also is the first to investigate the cost savings of implementing with lamda_2-bits of precision. Performance results are promising in comparison to the hardware designs of the equivalent ring-LWE scheme, which in addition to providing a stronger security proof; generate 1272 encryptions per second and 4395 decryptions per second.

On Solutions of Holonomic Divided-Difference Equations on Non-Uniform Lattices

The main aim of this paper is the development of suitable bases (replacing the power basis x^n (n\in\IN_\le 0) which enable the direct series representation of orthogonal polynomial systems on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable). We present two bases of this type, the first of which allows to write solutions of arbitrary divided-difference equations in terms of series representations extending results given in [16] for the q-case. Furthermore it enables the representation of the Stieltjes function which can be used to prove the equivalence between the Pearson equation for a given linear functional and the Riccati equation for the formal Stieltjes function. If the Askey-Wilson polynomials are written in terms of this basis, however, the coefficients turn out to be not q-hypergeometric. Therefore, we present a second basis, which shares several relevant properties with the first one. This basis enables to generate the defining representation of the Askey-Wilson polynomials directly from their divided-difference equation. For this purpose the divided-difference equation must be rewritten in terms of suitable divided-difference operators developed in [5], see also [6].