Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Nathan Lemons"'
Publikováno v:
Stats, Vol 4, Iss 3, Pp 595-601 (2021)
The frequency of the first digits of numbers drawn from an exponential probability density oscillate around the Benford frequencies. Analysis, simulations and empirical evidence show that datasets must have at least 10,000 entries for these oscillati
Externí odkaz:
https://doaj.org/article/88a748773393469e91be8dcc11a60183
Autor:
Aric Hagberg, Nathan Lemons
Publikováno v:
PLoS ONE, Vol 10, Iss 9, p e0135177 (2015)
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random
Externí odkaz:
https://doaj.org/article/8f81654eba794942a12f70710ee14a6e
Publikováno v:
Math Horizons. 30:16-19
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59baead6fce14640bd3e14b9121847e3
https://doi.org/10.1080/10724117.2022.2090142
https://doi.org/10.1080/10724117.2022.2090142
Autor:
Kristina Meier, Nathan Lemons, Boris Gelfand, Nigel Lawrence, Austin Thresher, Justin Tripp, Raymond Newell, Aniruddha Nadiga, William Gammel
Publikováno v:
Journal of Optical Communications and Networking.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3c2ea0e14e4560888a95d3e5226b305
https://doi.org/10.1364/jocn.474487
https://doi.org/10.1364/jocn.474487
Publikováno v:
Stats, Vol 4, Iss 35, Pp 595-601 (2021)
Stats
Volume 4
Issue 3
Pages 35-601
Stats
Volume 4
Issue 3
Pages 35-601
The frequency of the first digits of numbers drawn from an exponential probability density oscillate around the Benford frequencies. Analysis, simulations and empirical evidence show that datasets must have at least 10,000 entries for these oscillati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5817e97e50be02911e7fed5840db5944
https://doi.org/10.3390/stats4030035
https://doi.org/10.3390/stats4030035
Publikováno v:
Journal of Combinatorial Theory, Series B. 148:239-250
We study the structure of r -uniform hypergraphs containing no Berge cycles of length at least k for k ≤ r , and determine that such hypergraphs have some special substructure. In particular we determine the extremal number of such hypergraphs, giv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99251703dd68f9f7df1b3f87079d2ca8
https://doi.org/10.1016/j.jctb.2020.04.007
https://doi.org/10.1016/j.jctb.2020.04.007
A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$. In the ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47971978e04d4601d4bc14ed3d9da0d4
http://arxiv.org/abs/2003.04282
http://arxiv.org/abs/2003.04282
Let $\mathcal{H}$ be an $r$-uniform hypergraph. The \emph{minimum positive co-degree} of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of $\mathcal{H}$, then $S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c08123d90018772d89dffbf06325ff9c
Publikováno v:
The Journal of Physical Chemistry B. 122:6351-6356
The chemical kinetics of many complex systems can be concisely represented by reaction rules, which can be used to generate reaction events via a kinetic Monte Carlo method that has been termed network-free simulation. Here, we demonstrate accelerate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13ff42272d38b19e10837c0b513314fa
https://doi.org/10.1021/acs.jpcb.8b02960
https://doi.org/10.1021/acs.jpcb.8b02960
Publikováno v:
European Journal of Combinatorics. 58:238-246
The Erdős-Gallai Theorem gives the maximum number of edges in a graph without a path of length k. We extend this result for Berge paths in r-uniform hypergraphs. We also find the extremal hypergraphs avoiding t-tight paths of a given length and cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64dcba34038e56129d42b69709c4f7c6
https://doi.org/10.1016/j.ejc.2016.05.012
https://doi.org/10.1016/j.ejc.2016.05.012