Zobrazeno 1 - 10
of 908
pro vyhledávání: '"Brown, P. I."'
Autor:
Kim, Junyeong L., Brown, Aidan I.
The endoplasmic reticulum (ER) is a network of sheet-like and tubular structures that spans much of a cell and contains molecules undergoing diffusive searches for targets, such as unfolded proteins searching for chaperones and recently-folded protei
Externí odkaz:
http://arxiv.org/abs/2402.03059
Autor:
Brown, Jason I., George, Ian
In this paper, graph theory is used to explore the musical notion of tonal modulation, in theory and application. We define (pivot) modulation graphs based on the common scales used in popular music. Properties and parameters of these graphs are disc
Externí odkaz:
http://arxiv.org/abs/2306.13691
Autor:
Brown, Jason I., McMullin, Isaac
A common model of robustness of a graph against random failures has all vertices operational, but the edges independently operational with probability $p$. One can ask for the probability that all vertices can communicate ({\em all-terminal reliabili
Externí odkaz:
http://arxiv.org/abs/2306.03884
Autor:
Kischuck, Liam T, Brown, Aidan I
The endoplasmic reticulum (ER), a cellular organelle that forms a cell-spanning network of tubes and sheets, is an important location of protein synthesis and folding. When the ER experiences sustained unfolded protein stress, IRE1 proteins embedded
Externí odkaz:
http://arxiv.org/abs/2305.00971
Autor:
Scott, Zubenelgenubi C., Brown, Aidan I., Mogre, Saurabh S., Westrate, Laura M., Koslover, Elena F.
Several organelles in eukaryotic cells, including mitochondria and the endoplasmic reticulum, form interconnected tubule networks extending throughout the cell. These tubular networks host many biochemical pathways that rely on proteins diffusively s
Externí odkaz:
http://arxiv.org/abs/2103.05065
Autor:
Beaton, Iain, Brown, Jason I.
A dominating set $S$ of a graph $G$ of order $n$ is a subset of the vertices of $G$ such that every vertex is either in $S$ or adjacent to a vertex of $S$. The domination polynomial is defined by $D(G,x) = \sum d_k x^k$ where $d_k$ is the number of d
Externí odkaz:
http://arxiv.org/abs/2012.15193
Autor:
Beaton, Iain, Brown, Jason I.
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its coefficients
Externí odkaz:
http://arxiv.org/abs/2012.11813
Publikováno v:
Australasian Journal of Combinatorics, Vol 82(2) (2022), 146-181
For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic polynomial for
Externí odkaz:
http://arxiv.org/abs/2011.01735
Autor:
Beaton, Iain, Brown, Jason I.
This papers focuses on the average order of dominating sets of a graph. We find the extremal graphs for the maximum and minimum value over all graphs on $n$ vertices, while for trees we prove that the star minimizes the average order of dominating se
Externí odkaz:
http://arxiv.org/abs/2008.06531
Autor:
Brown, Aidan I, Koslover, Elena F
Newly-translated glycoproteins in the endoplasmic reticulum (ER) often undergo cycles of chaperone binding and release in order to assist in folding. Quality control is required to distinguish between proteins that have completed native folding, thos
Externí odkaz:
http://arxiv.org/abs/2008.05608