Related papers: Structural Balance Considerations for Networks wit…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…
(a) We propose a ``static'' construction procedure for random networks with given correlations of the degrees of the nearest-neighbor vertices. This is an equilibrium graph, maximally random under the constraint that its degree-degree…
Network topologies can be non-trivial, due to the complex underlying behaviors that form them. While past research has shown that some processes on networks may be characterized by low-order statistics describing nodes and their neighbors,…
For massive and heterogeneous modern datasets, it is of fundamental interest to provide guarantees on the accuracy of estimation when computational resources are limited. In the application of learning to rank, we provide a hierarchy of…
This paper explores a new class of incomplete preferences -- termed ``connected preferences'' -- in which maximal domains of comparability are topologically connected. We provide necessary and sufficient conditions for continuous…
Most of the stochastic orders for comparing random variables, considered in the literature, are afflicted with two main drawbacks: (i) lack of connex property and (ii) lack of consideration of any dependence structure between the random…
In structured system theory, a pattern matrix is a matrix with entries either fixed to zero or free to take arbitrary numbers. The (generic) rank of a pattern matrix is the rank of almost all its realizations. The resilience of various…
We examine a weighted-network multi-agent model with preferential selection such that agents choose partners with the probability $p(w)$, where $w$ is the number of their past selections. When $p(w)$ increases sublinearly with the number of…
We investigate the trade-off between the robustness against random and targeted removal of nodes from a network. To this end we utilize the stochastic block model to study ensembles of infinitely large networks with arbitrary large-scale…
The problem of relevance ranking consists of sorting a set of objects with respect to a given criterion. Since users may prefer different relevance criteria, the ranking algorithms should be adaptable to the user needs. Two main approaches…
We consider the network constraints on the bounds of the assortativity coefficient, which measures the tendency of nodes with the same attribute values to be interconnected. The assortativity coefficient is the Pearson's correlation…
Ranking alternatives is a natural way for humans to explain their preferences. It is being used in many settings, such as school choice, course allocations and residency matches. In some cases, several `items' are given to each participant.…
Recently developed concepts and techniques of analyzing complex systems provide new insight into the structure of social networks. Uncovering recurrent preferences and organizational principles in such networks is a key issue to…
There are diverse mechanisms driving the evolution of social networks. A key open question dealing with understanding their evolution is: How various preferential linking mechanisms produce networks with different features? In this paper we…
Understanding the causes and effects of network structural features is a key task in deciphering complex systems. In this context, the property of network nestedness has aroused a fair amount of interest as regards ecological networks.…
In complex scale-free networks, ranking the individual nodes based upon their importance has useful applications, such as the identification of hubs for epidemic control, or bottlenecks for controlling traffic congestion. However, in most…
In this paper, a new framework to study weighed networks is introduced. The idea behind this methodology is to consider that each node of the network is an agent that desires to satisfy his/her preferences in an economic sense. Moreover,…
We introduce a mechanism which models the emergence of the universal properties of complex networks, such as scale independence, modularity and self-similarity, and unifies them under a scale-free organization beyond the link. This brings a…
We study quadrangular properties of binary relations on a set $X$~--i.e., properties defined on configurations of four elements--~within an agonistic interpretation, where $xRy$ is interpreted as $x$ ``attacks''~$y$. Such relations induce a…