Exploració per autor "Alemany Puig, Lluís"
Ara es mostren els items 1-9 de 9
-
Edge crossings in linear arrangements: from theory to algorithms and applications
Alemany Puig, Lluís (Universitat Politècnica de Catalunya, 2019-07)
Projecte Final de Màster Oficial
Accés obertCòmput del nombre de creuaments C en un graf quan els vèrtexos estan distribuïts en arranjaments lineals, del valor exacte de la variància de C en arranjaments lineals uniformement aleatoris. Anàlisi de propietats estadístiques ... -
Edge crossings in random linear arrangements
Alemany Puig, Lluís; Ferrer Cancho, Ramon (Institute of Physics (IOP), 2020-02-19)
Article
Accés obertIn spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1D lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. ... -
Linear-time calculation of the expected sum of edge lengths in random projective linearizations of trees
Alemany Puig, Lluís; Ferrer Cancho, Ramon (The MIT Press. Massachusetts Institute of Technology, 2022-09)
Article
Accés obertThe syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on dependency ... -
Minimum projective linearizations of trees in linear time
Alemany Puig, Lluís; Esteban Ángeles, Juan Luis; Ferrer Cancho, Ramon (2022-03)
Article
Accés obertThe Minimum Linear Arrangement problem (MLA) consists of finding a mapping π from vertices of a graph to distinct integers that minimizes {u,v}∈E |π(u) − π(v)|. In that setting, vertices are often assumed to lie on a ... -
Optimality of syntactic dependency distances
Ferrer Cancho, Ramon; Gómez Rodríguez, Carlos; Esteban Ángeles, Juan Luis; Alemany Puig, Lluís (American Institute of Physics (AIP), 2022-01-01)
Article
Accés obertIt is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of languages by means of an optimality score ... -
Process mining using convex polytopes
Alemany Puig, Lluís (Universitat Politècnica de Catalunya, 2017-01-23)
Treball Final de Grau
Accés obertProcess Mining is a relatively young field of study that highlights the difficulty to infer models of processes from which to extract enough information to make predictions about its behaviour, find bottlenecks and ... -
Reappraising the distribution of the number of edge crossings of graphs on a sphere
Alemany Puig, Lluís; Mora Giné, Mercè; Ferrer Cancho, Ramon (Institute of Physics (IOP), 2020-08-01)
Article
Accés obertMany real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneering research, Moon analyzed the distribution ... -
The linear arrangement library: A new tool for research on syntactic dependency structures
Alemany Puig, Lluís; Esteban Ángeles, Juan Luis; Ferrer Cancho, Ramon (Association for Computational Linguistics, 2022)
Comunicació de congrés
Accés obertThe new and growing field of Quantitative Dependency Syntax has emerged at the crossroads between Dependency Syntax and Quantitative Linguistics. One of the main concerns in this field is the statistical patterns of syntactic ... -
The maximum linear arrangement problem for trees under projectivity and planarity
Alemany Puig, Lluís; Esteban Ángeles, Juan Luis; Ferrer Cancho, Ramon (2024-01-01)
Article
Accés restringit per política de l'editorialA linear arrangement is a mapping p from the n vertices of a graph G to n distinct consecutive integers. Linear arrangements can be represented by drawing the vertices along a horizontal line and drawing the edges as ...