Search Results for author:
Found 8 papers, 2 papers with code
On the Role of Memory in Robust Opinion Dynamics
We investigate opinion dynamics in a fully-connected system, consisting of $n$ identical and anonymous agents, where one of the opinions (which is called correct) represents a piece of information to disseminate.
Biological Random Walks: multi-omics integration for disease gene prioritization
Motivation: Over the past decade, network-based approaches have proven useful in identifying disease modules within the human interactome, often providing insights into key mechanisms and guiding the quest for therapeutic targets.
Network Based Approach to Gene Prioritization at Genome-Wide Association Study Loci
Results: We present the Relations-Maximization Method, a dense module searching method to identify putative causal genes at GWAS loci through the generation of candidate sub-networks derived by integrating association signals from GWAS data into the gene co-regulation network.
On the Multidimensional Random Subset Sum Problem
random variables $X_1, ..., X_n$, we wish to approximate any point $z \in [-1, 1]$ as the sum of a suitable subset $X_{i_1(z)}, ..., X_{i_s(z)}$ of them, up to error $\varepsilon$.
Network and Sequence-Based Prediction of Protein-Protein Interactions
Background:Typically, proteins perform key biological functions by interacting with each other.
Biological Random Walks: integrating heterogeneous data in disease gene prioritization
This work proposes a unified framework to leverage biological information in network propagation-based gene prioritization algorithms.
Principal Fairness: Removing Bias via Projections
Reducing hidden bias in the data and ensuring fairness in algorithmic data analysis has recently received significant attention.
Finding a Bounded-Degree Expander Inside a Dense One
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V, E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V, E_H)$ of $G$ of constant maximum degree which is also an expander.
Distributed, Parallel, and Cluster Computing
