65 research outputs found
The Laplacian spectral excess theorem for distance-regular graphs
The spectral excess theorem states that, in a regular graph G, the average
excess, which is the mean of the numbers of vertices at maximum distance from a
vertex, is bounded above by the spectral excess (a number that is computed by
using the adjacency spectrum of G), and G is distance-regular if and only if
equality holds. In this note we prove the corresponding result by using the
Laplacian spectrum without requiring regularity of G
The spectral excess theorem for distance-biregular graphs
The spectral excess theorem for distance-regular graphs states that a regular
(connected) graph is distance-regular if and only if its spectral-excess equals its
average excess. A bipartite graphPeer ReviewedPostprint (published version
A spectral excess theorem for digraphs with normal Laplacian matrices
The spectral excess theorem‎, ‎due to Fiol and Garriga in 1997‎, ‎is an important result‎, ‎because it gives a good characterization‎ ‎of distance-regularity in graphs‎. ‎Up to now‎, ‎some authors have given some variations of this theorem‎. ‎Motivated by this‎, ‎we give the corresponding result by using the Laplacian spectrum for digraphs‎. ‎We also illustrate this Laplacian spectral excess theorem for digraphs with few Laplacian eigenvalues and we show that any strongly connected and regular digraph that has normal Laplacian matrix with three distinct eigenvalues‎, ‎is distance-regular‎. ‎Hence such a digraph is strongly regular with girth or ‎
Distance-regular graphs
This is a survey of distance-regular graphs. We present an introduction to
distance-regular graphs for the reader who is unfamiliar with the subject, and
then give an overview of some developments in the area of distance-regular
graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A.,
Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
Untangling hotel industry’s inefficiency: An SFA approach applied to a renowned Portuguese hotel chain
The present paper explores the technical efficiency of four hotels from Teixeira Duarte Group - a renowned Portuguese hotel chain. An efficiency ranking is established from these four hotel units located in Portugal using Stochastic Frontier Analysis. This methodology allows to discriminate between measurement error and systematic inefficiencies in the estimation process enabling to investigate the main inefficiency causes. Several suggestions concerning efficiency improvement are undertaken for each hotel studied.info:eu-repo/semantics/publishedVersio
Livro de atas do XVI Congresso da Associação Portuguesa de Investigação Operacional
Fundação para a Ciência e Tecnologia - FC
Stochastic processes for graphs, extreme values and their causality: inference, asymptotic theory and applications
This thesis provides some theoretical and practical statistical inference tools for multivariate stochastic processes to better understand the behaviours and properties present in the data. In particular, we focus on the modelling of graphs,
that is a family of nodes linked together by a collection of edges, and extreme values, that
are values above a high threshold to have their own dynamics compared to the typical
behaviour of the process. We develop an ensemble of statistical models, statistical inference methods and their
asymptotic study to ensure the good behaviour of estimation schemes in a wide variety of
settings. We also devote a chapter to the formulation of a methodology based on pre-existing
theory to unveil the causal dependency structure behind high-impact events.Open Acces
- …