Mortality rate refers to the overall likelihood of death within a specific population over a defined period. The knowledge of high mortality rate disease clusters can enable healthcare providers and patients to be proactive and develop tailored …
The analysis of social and biological networks often involves modeling clusters of interest as _cliques_ or their graph-theoretic generalizations. The _-club model, which relaxes the requirement of pairwise adjacency in a clique to length-bound-ed …
In this study, we address the mate selection problem in the hybridization stage of a breeding pipeline, which constitutes the multi-objective breeding goal key to the performance of a variety development program. The solution framework we formulate …
We introduce a new variant of the network interdiction problem with a Markovian evader that randomly chooses a neighboring vertex in each step to build their path from designated source(s) to terminal(s). The interdictor's goal is to maximize the …
Atomic cliques were introduced recently to analyze comorbidity graphs that vary over time. We consider the atomic counterpart of the classical maximum clique problem in this paper. Our main contribution is a polynomial-time algorithm that transforms …
Cliques and their generalizations are frequently used to model "tightly knit" clusters in graphs and identifying such clusters is a popular technique used in graph-based data mining. One such model is the -club, which is a vertex subset that …
The _-clubs_ model cohesive social subgroups as vertex subsets that induce subgraphs of diameter at most . In defender-attacker settings, for low values of , they can represent tightly-knit communities whose operation is undesirable for the …
We introduce a new graph-theoretic paradigm called a *graph signature* that describes persistent patterns in a sequence of graphs. This framework is motivated by the need to detect subgraphs of significance in temporal networks, e.g., social and …
We study statistical calibration, i.e., adjusting features of a computational model that are not observable or controllable in its associated physical system. We focus on functional calibration, which arises in many manufacturing processes where the …
A _-quasi-clique_ in a simple undirected graph refers to a subset of vertices that induces a subgraph with edge density at least . When , this definition corresponds to a classical clique. When $\gamma