Zobrazeno 1 - 10
of 407
pro vyhledávání: '"Alan Frieze"'
Autor:
Alan Frieze
Publikováno v:
AIMS Mathematics, Vol 5, Iss 5, Pp 4849-4852 (2020)
We find a threshold for the existence of a collection of edge disjoint copies of Kr that form a cyclic structure and span all vertices of Gn,p. We use a recent result of Riordan to give a two line proof of the main result.
Externí odkaz:
https://doaj.org/article/a19809c410224b14a79356a10aa7b90b
Publikováno v:
Statistics and Public Policy, Vol 7, Iss 1, Pp 101-114 (2020)
We give qualitative and quantitative improvements to theorems which enable significance testing in Markov chains, with a particular eye toward the goal of enabling strong, interpretable, and statistically rigorous claims of political gerrymandering.
Externí odkaz:
https://doaj.org/article/f91772df0c8b4d5882836ab6fd038429
Publikováno v:
Statistics and Public Policy, Vol 6, Iss 1, Pp 50-53 (2019)
The article of Cho and Rubinstein-Salzedo seeks to cast doubt on our previous paper, which described a rigorous statistical test which can be applied to reversible Markov chains. In particular, Cho and Rubinstein-Salzedo seem to suggest that the test
Externí odkaz:
https://doaj.org/article/c738255f28224ec992bd8600defd94ef
Publikováno v:
Discrete Analysis (2020)
Random volumes in d-dimensional polytopes, Discrete Analysis 2020:15, 17 pp. This paper concerns the following general question. Given a convex body $X$ in $\mathbb R^d$, how many points do you need to choose at random from inside $X$ before with hi
Externí odkaz:
https://doaj.org/article/28dbc2a5f85a4832817ba97ffa0441a6
Autor:
Alan Frieze, Juan Vera
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
We consider the problem of generating a random q-colouring of a graph G=(V,E). We consider the simple Glauber Dynamics chain. We show that if for all v ∈ V the average degree of the subgraph H v induced by the neighbours of v ∈ V is ≪Δ where
Externí odkaz:
https://doaj.org/article/9818f4440ef74ecea2b3b53291d5d41b
Autor:
Alan Frieze, Wesley Pegden
Publikováno v:
Journal of Graph Theory.
Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes shortest distan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d866c9b96a1a5a26321e94bdd803bcb1
https://doi.org/10.1002/jgt.22950
https://doi.org/10.1002/jgt.22950
Autor:
Alan Frieze, Michał Karoński
Networks surround us, from social networks to protein–protein interaction networks within the cells of our bodies. The theory of random graphs provides a necessary framework for understanding their structure and development. This text provides an a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ba6f64e0bbeb4ac422272bda3dacdde
https://doi.org/10.1017/9781009260268
https://doi.org/10.1017/9781009260268
Publikováno v:
Journal of Applied Probability. 59:299-324
We study two models of an age-biased graph process: the$\delta$-version of the preferential attachment graph model (PAM) and the uniform attachment graph model (UAM), withmattachments for each of the incoming vertices. We show that almost surely the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f3f4c5f449f5411d0d773f579964e02
https://doi.org/10.1017/jpr.2021.59
https://doi.org/10.1017/jpr.2021.59
Autor:
Alan Frieze, Wesley Pegden
Publikováno v:
Discrete Applied Mathematics. 309:68-74
Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes shortest distan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dd33fdfaabd56982325fd2c19d5604af
https://doi.org/10.1016/j.dam.2021.11.009
https://doi.org/10.1016/j.dam.2021.11.009
Autor:
Alan Frieze, Wesley Pegden
Publikováno v:
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69c6f09406c27e1315cb8c2b4514fcce
https://doi.org/10.1137/1.9781611977554.ch127
https://doi.org/10.1137/1.9781611977554.ch127