Related papers: Stable Matching with Incomplete Information in Str…
The human organism is an integrated network where complex physiologic systems, each with its own regulatory mechanisms, continuously interact, and where failure of one system can trigger a breakdown of the entire network. Identifying and…
In social networks, information and influence diffuse among users as cascades. While the importance of studying cascades has been recognized in various applications, it is difficult to observe the complete structure of cascades in practice.…
We study the dynamics of coupled oscillator networks with higher-order interactions and their ability to store information. In particular, the fixed points of these oscillator systems consist of two clusters of oscillators that become…
The structure of interactions in most of animals and human societies can be best represented by complex hierarchical networks. In order to maintain close to optimal functioning both stability and adaptability are necessary. Here we…
Data-driven analysis of large social networks has attracted a great deal of research interest. In this paper, we investigate 120 real social networks and their measurement-calibrated synthetic counterparts generated by four well-known…
In this study, we performed comprehensive morphological investigations of the spontaneous formations of effective network structures among elements in coupled logistic maps, specifically with a delayed connection change. Our proposed model…
The stability analysis of socioeconomic systems has been centered on answering whether small perturbations when a system is in a given quantitative state will push the system permanently to a different quantitative state. However, typically…
This paper analyzes stochastic networks consisting of a set of finite capacity sites where different classes of individuals move according to some routing policy. The associated Markov jump processes are analyzed under a thermodynamic limit…
The main result relates to structured robust stability analysis of an input-output model for networks with link uncertainty. It constitutes a collection of integral quadratic constraints, which together imply robust stability of the…
In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…
Interactions between people are the basis on which the structure of our society arises as a complex system and, at the same time, are the starting point of any physical description of it. In the last few years, much theoretical research has…
Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…
We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We propose two metrics to quantify the level of consistency across multiple runs of an algorithm:…
Topological properties of networks are widely applied to study the link-prediction problem recently. Common Neighbors, for example, is a natural yet efficient framework. Many variants of Common Neighbors have been thus proposed to further…
We define and study a new variant of the secretary problem. Whereas in the classic setting multiple secretaries compete for a single position, we study the case where the secretaries arrive one at a time and are assigned, in an on-line…
Understanding how reliable information emerges in interconnected populations is a challenge in social science, network theory and data analysis. Many existing approaches model treat truth as an external reference or a property of individual…
We study the self-assembly of a complex network of collaborations among self-interested agents. The agents can maintain different levels of cooperation with different partners. Further, they continuously, selectively, and independently…
Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who…
We consider a learning problem for the stable marriage model under unknown preferences for the left side of the market. We focus on the centralized case, where at each time step, an online platform matches the agents, and obtains a noisy…
This paper introduces a unified framework for stable matching, which nests the traditional definition of stable matching in finite markets and the continuum definition of stable matching from Azevedo and Leshno (2016) as special cases.…