Results 61 to 70 of about 5,199,165 (252)

Weighted hypersoft configuration model

Physical Review Research, 2020
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models.
Ivan Voitalov, Pim van der Hoorn, Maksim Kitsak, Fragkiskos Papadopoulos, Dmitri Krioukov   +4 more
doaj   +1 more source

Investigating transcription factor dynamics in health and disease using FRAP

FEBS Letters, EarlyView.
FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj, Carolina Vazquez Garzon, Jose Joaquin Velasco, Janine N. Post   +3 more
wiley   +1 more source

Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential

FEBS Letters, EarlyView.
Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta, Hari Baskar Balasubramanian, Amir Pasokh, Marietta Zille   +3 more
wiley   +1 more source

Integer points in the degree-sequence polytope

An integer vector ∈ Z is a degree sequence if there exists a hypergraph with vertices {1, … , } such that each is the number of hyperedges containing . The degree-sequence polytope is the convex hull of all degree sequences. We show that all but a 2−(
Pinchasi, Rom, Bach, Eleonore, Eisenbrand, Friedrich   +2 more
core   +1 more source

Structure‐forward targeting of claudins with synthetic binders

FEBS Letters, EarlyView.
Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley   +1 more source

Extremal Topological Indices with Prescribed Degree Sequences

Vestnik KRAUNC: Fiziko-Matematičeskie Nauki
This paper explores the extremal properties and bounds of two significant topological indices in graph theory: the Albertson and Sigma indices, with an emphasis on trees and bipartite graphs.
Hamoud, J., Belov, A.Ya.
doaj   +1 more source

Geometric randomization of real networks with prescribed degree sequence

New Journal of Physics, 2019
We introduce a model for the randomization of complex networks with geometric structure. The geometric randomization (GR) model assumes a homogeneous distribution of the nodes in a hidden similarity space and uses rewirings of the links to find ...
Michele Starnini, Elisenda Ortiz, M Ángeles Serrano   +2 more
doaj   +1 more source

Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation

FEBS Letters, EarlyView.
Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang, Ruslana Romaniuk, Hristo L. Svilenov   +2 more
wiley   +1 more source

Cover time of a random graph with given degree sequence

, 2018
In this paper we establish the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d. We show that under certain restrictions on d, the cover time of is whp asymptotic to .
Mohammed Abdullah (5365199), Colin Cooper (5364674)   +1 more
core   +1 more source

New Bounds For Degree Sequence Of Graphs [PDF]

Computer Science Journal of Moldova, 2019
Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and
Akbar Jahanbani
doaj