This paper revisits the classical issue of port-city relationships by applying for the first time network analytical methods to maritime flows connecting cities of the world, over the period 1950-1990. A global matrix of interurban vessel flows was elaborated for about 600 cities using data from...

The triangular array of binomial coefficients, or Pascal's triangle, is formed by starting with an apex of 1. Every row of Pascal's triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is...

A bipartite graph, in which the nodes (or actors in a social network) are partitioned into two sets, can be studied using recent statistical models for dyadic interactions. These models, which are loglinear for the probabilities of dyadic choices or interactions, allow not only arcs or...

Financial reporting information is crucial to both investors and regulators for their decision-making purposes as it reveals corporate financial position and performance over a period of time. This study proposes a quantitative method to identify companies who opt for different financial...

Financial networks' study and understanding has become extremely important since the global financial meltdown in 2007-2009 when the inter-connectedness of institutions has surfaced as one of the major culprits for the magnitude of the distress. This paper aims at providing a new approach, based...

In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...

For joint liability problems concerning tort law, a legal compensation scheme may be based on lower and upper bounds of compensation for injury and on case-system consistency. Introducing several properties inspired from this observation, we analyze compensation schemes axiomatically under the...

Condorcet domains are sets of linear orders with the property that, whenever the preferences of all voters of a society belong to this set, their majority relation has no cycles. We observe that, without loss of generality, every such domain can be assumed to be closed in the sense that it...

The triangular array of binomial coefficients, or Pascal's triangle, is formed by starting with an apex of 1. Every row of Pascal's triangle can be seen as a line-graph, to each node of which the corresponding binomial coefficient is assigned. We show that the binomial coefficient of a node is...