Results 91 to 100 of about 56,162 (272)

The dynamics of criminal collaboration: Multiplex ties in mafia networks

open access: yesCriminology, EarlyView.
Abstract This study examines how social embeddedness and multiplex relationships shape criminal collaboration within organized crime networks. Drawing on data from three major investigations into the ‘Ndrangheta, we analyze how kinship, clan affiliation, leadership, and prior interactions influence participation in meetings and phone calls.
Francesco Calderoni   +2 more
wiley   +1 more source

A Vulnerability Lens for Intuitive‐Logic Scenarios

open access: yesFUTURES &FORESIGHT SCIENCE, Volume 8, Issue 1, April 2026.
ABSTRACT Exploration of possibilities by means of intuitive logic is hampered by a large number of scenarios, which easily exceed the limits imposed by human bounded rationality. While many practitioners constrain their scenarios within a 2 × 2 $2\times 2$ matrix by design, more structured approaches point to rationales such as eliminating ...
Guido Fioretti
wiley   +1 more source

Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering

open access: yesFrontiers in Big Data, 2023
We study p-Laplacians and spectral clustering for a recently proposed hypergraph model that incorporates edge-dependent vertex weights (EDVW). These weights can reflect different importance of vertices within a hyperedge, thus conferring the hypergraph ...
Yu Zhu, Santiago Segarra
doaj   +1 more source

Strong Jumps and Lagrangians of Non-Uniform Hypergraphs [PDF]

open access: yes, 2014
The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems over non ...
Johnston, Travis, Lu, Linyuan
core  

Blocks of Hypergraphs [PDF]

open access: yes, 2011
A support of a hypergraph H is a graph with the same vertex set as H in which each hyperedge induces a connected subgraph. We show how to test in polynomial time whether a given hypergraph has a cactus support, i.e. a support that is a tree of edges and cycles.
Brandes, Ulrik   +3 more
openaire   +3 more sources

Large language models for bioinformatics

open access: yesQuantitative Biology, Volume 14, Issue 1, March 2026.
Abstract With the rapid advancements in large language model technology and the emergence of bioinformatics‐specific language models (BioLMs), there is a growing need for a comprehensive analysis of the current landscape, computational characteristics, and diverse applications.
Wei Ruan   +54 more
wiley   +1 more source

A comprehensive review of cluster methods for drug–drug interaction network

open access: yesQuantitative Biology, Volume 14, Issue 1, March 2026.
Abstract The detection of drug–drug interaction (DDI) is crucial to the rational use of drug combinations. Experimentally, DDI detection is time‐consuming and laborious. Currently, researchers have developed a variety of computational methods to predict DDI.
Shuyuan Cao   +3 more
wiley   +1 more source

Equitable orientations of sparse uniform hypergraphs [PDF]

open access: yes, 2016
Caro, West, and Yuster studied how $r$-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped.
Cohen, Nathann, Lochet, William
core   +3 more sources

Embeddings and Ramsey numbers of sparse k-uniform hypergraphs

open access: yes, 2008
Chvatal, Roedl, Szemeredi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. In previous work, we proved the same result for 3-uniform hypergraphs. Here we extend this result to k-uniform hypergraphs,
Cooley, Oliver   +3 more
core   +2 more sources

Temporal-Relational Hypergraph Tri-Attention Networks for Stock Trend Prediction [PDF]

open access: green, 2021
Chaoran Cui   +6 more
openalex   +1 more source

Home - About - Disclaimer - Privacy