Results 71 to 80 of about 4,550,446 (348)
The Minimal Perimeter of a Log-Concave Function
Inspired by the equivalence between isoperimetric inequality and Sobolev inequality, we provide a new connection between geometry and analysis. We define the minimal perimeter of a log-concave function and establish a characteristic theorem of this ...
Niufa Fang, Zengle Zhang
doaj +1 more source
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi +1 more
core +1 more source
Graph Powers and Graph Homomorphisms [PDF]
In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hajiabolhassan, Hossein, Taherkhani, Ali
openaire +3 more sources
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
The Determinant of Matching Matrix in the Evaluation of Matching Polynomial
A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.
Shanaz A. Wahid
doaj +1 more source
Graph properties, graph limits and entropy [PDF]
We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number, which by well ...
Hatami, Hamed +2 more
core +1 more source
MOGONET integrates multi-omics data using graph convolutional networks allowing patient classification and biomarker identification [PDF]
Tongxin Wang +6 more
openalex +1 more source
Cospectrality graphs of Smith graphs
Graphs whose spectrum belongs to the interval [-2,2] are called Smith graphs. The structure of a Smith graph with a given spectrum depends on a system of Diophantine linear algebraic equations. We have established in [1] several properties of this system and showed how it can be simplified and effectively applied.
Cvetković, Dragoš, Todorčević, Vesna
openaire +4 more sources
Biclique Graphs of K3-free Graphs and Bipartite Graphs
A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph $G$, $KB(G)$, defined as the intersection graph of the bicliques of $G$, was introduced and characterized in 2010. However, this characterization does not lead to polynomial time recognition algorithms.
Groshaus, Marina +1 more
openaire +2 more sources
PARP inhibitors are used to treat a small subset of prostate cancer patients. These studies reveal that PARP1 activity and expression are different between European American and African American prostate cancer tissue samples. Additionally, different PARP inhibitors cause unique and overlapping transcriptional changes, notably, p53 pathway upregulation.
Moriah L. Cunningham +21 more
wiley +1 more source

