Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Nicolas Fraiman"'
Publikováno v:
Discrete Analysis (2023)
The Shadow Knows: Empirical Distributions of Minimal Spanning Acycles and Persistence Diagrams of Random Complexes, Discrete Analysis 2023:2, 18 pp. This paper deals with the following natural and important question. Suppose that the edges of the co
Externí odkaz:
https://doaj.org/article/0df2cfac620f4a0f9328c2e559b7df1c
Publikováno v:
Random Structures & Algorithms. 60:201-232
We consider random recursive trees that are grown via community modulated schemes that involve random attachment or degree based attachment. The aim of this paper is to derive general techniques based on continuous time embedding to study such models
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6131ddf813bb29db2a0c0446e1700f36
https://doi.org/10.1002/rsa.21027
https://doi.org/10.1002/rsa.21027
Autor:
Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap
We give algorithms for approximating the partition function of the ferromagnetic Potts model on $d$-regular expanding graphs. We require much weaker expansion than in previous works; for example, the expansion exhibited by the hypercube suffices. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::873221a8906f563175661c2c38373ed6
http://arxiv.org/abs/2204.01923
http://arxiv.org/abs/2204.01923
Publikováno v:
Random Structures & Algorithms. 57:304-316
A recursive function on a tree is a function in which each leaf has a given value, and each internal node has a value equal to a function of the number of children, the values of the children, and possibly an explicitly specified random element $U$.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f964f01c9020822450e6b5a848bc400
https://doi.org/10.1002/rsa.20921
https://doi.org/10.1002/rsa.20921
For a directed graph $G(V_n, E_n)$ on the vertices $V_n = \{1,2, \dots, n\}$, we study the distribution of a Markov chain $\{ {\bf R}^{(k)}: k \geq 0\}$ on $\mathbb{R}^n$ such that the $i$th component of ${\bf R}^{(k)}$, denoted $R_i^{(k)}$, correspo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4703739745626fbccf927855f4bdb27d
http://arxiv.org/abs/2010.09596
http://arxiv.org/abs/2010.09596
Autor:
Peter J. Mucha, Jonathan Weare, Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola, Braxton Osting
The shortest-path, commute time, and diffusion distances on undirected graphs have been widely employed in applications such as dimensionality reduction, link prediction, and trip planning. Increasingly, there is interest in using asymmetric structur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0ad789c33ed059d735348c81da6caec
http://arxiv.org/abs/2006.14482
http://arxiv.org/abs/2006.14482
We propose two numerical schemes for approximating quasi-stationary distributions (QSD) of finite state Markov chains with absorbing states. Both schemes are described in terms of certain interacting chains in which the interaction is given in terms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d06e5c02b2f032d78820847111d3557d
We consider a collection of Markov chains that model the evolution of multitype biological populations. The state space of the chains is the positive orthant, and the boundary of the orthant is absorbing representing the extinction states of differen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92c340350bcf620bc2629680deed370a
Many mathematical frameworks of evolutionary game dynamics assume that the total population size is constant and that selection affects only the relative frequency of strategies. Here, we consider evolutionary game dynamics in an extended Wright-Fish
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4985f6f14ef60b83ff6a1b79e5345e2d
Autor:
Dieter Mitsche, Nicolas Fraiman
Publikováno v:
Trends in Mathematics ISBN: 9783319517520
We study metric and spectral properties of dense inhomogeneous random graphs. We generalize results known for the Erdos–Renyi model. In our case an edge (i, j) is present with probability κ(X i , X j )p, where κ ≥ 0 is a fixed kernel and X i ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9593a03d7be8084417de546eb9c423f
https://doi.org/10.1007/978-3-319-51753-7_7
https://doi.org/10.1007/978-3-319-51753-7_7