View article
Inferring Social Status and Rich Club Effects in Enterprise Communication Networks Open
Social status, defined as the relative rank or position that an individual holds in a social hierarchy, is known to be among the most important motivating forces in social behaviors. In this paper, we consider the notion of status from the…
View article
Pbft Vs Proof-Of-Authority: Applying The Cap Theorem To Permissioned Blockchain Open
Permissioned blockchains are arising as a solution to federate companies prompting accountable interactions. A variety of consensus algorithms for such blockchains have been proposed, each of which has dierent benets and drawbacks. Proof-o…
View article
Do online social media cut through the constraints that limit the size of offline social networks? Open
The social brain hypothesis has suggested that natural social network sizes may have a characteristic size in humans. This is determined in part by cognitive constraints and in part by the time costs of servicing relationships. Online soci…
View article
Learning a SAT Solver from Single-Bit Supervision Open
We present NeuroSAT, a message passing neural network that learns to solve SAT problems after only being trained as a classifier to predict satisfiability. Although it is not competitive with state-of-the-art SAT solvers, NeuroSAT can solv…
View article
A Maximal Clique Based Multiobjective Evolutionary Algorithm for Overlapping Community Detection Open
Detecting community structure has become one im-portant technique for studying complex networks. Although many community detection algorithms have been proposed, most of them focus on separated communities, where each node can be-long to o…
View article
Instantly decodable network coding for real-time device-to-device communications Open
This paper studies the delay reduction problem for instantly decodable network coding (IDNC)-based device-to-device (D2D) communication-enabled networks. Unlike conventional point-to-multipoint (PMP) systems in which the wireless base stat…
View article
Network connections, dyadic bonds and fitness in wild female baboons Open
In many social mammals, females who form close, differentiated bonds with others experience greater offspring survival and longevity. We still know little, however, about how females' relationships are structured within the social group, o…
View article
Listing k-cliques in Sparse Real-World Graphs* Open
Motivated by recent studies in the data mining community which require to efficiently list all k-cliques, we revisit the iconic algorithm of Chiba and Nishizeki and develop the most efficient parallel algorithm for such a problem. Our theo…
View article
Automatic Tunnel Crack Detection Based on U-Net and a Convolutional Neural Network with Alternately Updated Clique Open
Regular crack inspection of tunnels is essential to guarantee their safe operation. At present, the manual detection method is time-consuming, subjective and even dangerous, while the automatic detection method is relatively inaccurate. De…
View article
Development of a novel clustering tool for linear peptide sequences Open
Summary Epitopes identified in large‐scale screens of overlapping peptides often share significant levels of sequence identity, complicating the analysis of epitope‐related data. Clustering algorithms are often used to facilitate these ana…
View article
Two Efficient Local Search Algorithms for Maximum Weight Clique Problem Open
The Maximum Weight Clique problem (MWCP) is an important generalization of the Maximum Clique problem with wide applications. This paper introduces two heuristics and develops two local search algorithms for MWCP. Firstly, we propose a heu…
View article
Numerical solutions of time-fractional Klein-Gordon equations by clique polynomials Open
This work adopts to the time-fractional Klein–Gordon equation (FKGE) in the Caputo sense. We present a new technique using the clique polynomial as basis function for the operational matrices to obtain solution of time-FKGE. The key advant…
View article
Beyond the clustering coefficient: A topological analysis of node neighbourhoods in complex networks Open
In Network Science, node neighbourhoods, also called ego-centered networks, have attracted significant attention. In particular the clustering coefficient has been extensively used to measure their local cohesiveness. In this paper, we sho…
View article
Social complexity and the fractal structure of group size in primate social evolution Open
Compared to most other mammals and birds, anthropoid primates have unusually complex societies characterised by bonded social groups. Among primates, this effect is encapsulated in the social brain hypothesis: the robust correlation betwee…
View article
A Fast and Provable Method for Estimating Clique Counts Using Turán's Theorem Open
Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even…
View article
An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs Open
We describe an exact branch-and-bound algorithm for the maximum weight clique problem (MWC), called WLMC, that is especially suited for large vertex-weighted graphs. WLMC incorporates two original contributions: a preprocessing to derive a…
View article
MST in Log-Star Rounds of Congested Clique Open
We present a randomized algorithm that computes a Minimum Spanning Tree (MST) in O(log* n) rounds, with high probability, in the Congested Clique model of distributed computing. In this model, the input is a graph on n nodes, initially eac…
View article
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum Open
Given a set Z of n positive integers and a target value t, the SuBSETSuM problem asks whether any subset of Z sums to t. A textbook pseudopolynomial time algorithm by Bellman from 1957 solves SuBSETSuM in time O(nt). This has been improved…
View article
Eigenvalue tunneling and decay of quenched random network Open
We consider the canonical ensemble of N-vertex Erdős-Rényi (ER) random topological graphs with quenched vertex degree, and with fugacity μ for each closed triple of bonds. We claim complete defragmentation of large-N graphs into the collec…
View article
The existence of designs via iterative absorption Open
In a recent breakthrough, Keevash proved the Existence conjecture for combinatorial designs, which has its roots in the 19th century. We give a new proof, based on the method of iterative absorption. Our main result concerns $K^{(r)}_{q}$-…
View article
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection Open
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with ac…
View article
An Efficient movie recommendation algorithm based on improved k-clique Open
The amount of movie has increased to become more congested; therefore, to find a movie what users are looking for through the existing technologies are very hard. For this reason, the users want a system that can suggest the movie requirem…
View article
Minority Becomes Majority in Social Networks Open
It is often observed that agents tend to imitate the behavior of their neighbors in a social network. This imitating behavior might lead to the strategic decision of adopting a public behavior that differs from what the agent believes is t…
View article
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation Open
In this paper, we present new randomized algorithms that improve the complexity of the classic (Δ+1)-coloring problem, and its generalization (Δ+1)-list-coloring, in three well-studied models of distributed, parallel, and centralized compu…
View article
Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks Open
We study the discovery of cliques (or "complete" subgraphs) in heterogeneous information networks (HINs). Existing clique-finding solutions often ignore the rich semantics of HINs. We propose motif clique, or m-clique, which redefines subg…
View article
The Role of Network Topology for Distributed Machine Learning Open
International audience
View article
Fast Enumeration of Large k-Plexes Open
K-plexes are a formal yet flexible way of defining communities in networks. They generalize the notion of cliques and are more appropriate in most real cases: while a node of a clique C is connected to all other nodes of C, a node of a k-p…
View article
CliqueCNN: Deep Unsupervised Exemplar Learning Open
Exemplar learning is a powerful paradigm for discovering visual similarities in an unsupervised manner. In this context, however, the recent breakthrough in deep learning could not yet unfold its full potential. With only a single positive…
View article
Efficient Maximal Balanced Clique Enumeration in Signed Networks Open
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks. In real world, however, many applications are modeled as signed networks with positiv…
View article
Discontinuous Named Entity Recognition as Maximal Clique Discovery Open
Yucheng Wang, Bowen Yu, Hongsong Zhu, Tingwen Liu, Nan Yu, Limin Sun. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volum…