Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Kaur, Gursharn"'
Autor:
Chen, Chen, Wang, Yunfan, Kaur, Gursharn, Adiga, Aniruddha, Espinoza, Baltazar, Venkatramanan, Srinivasan, Warren, Andrew, Lewis, Bryan, Crow, Justin, Singh, Rekha, Lorentz, Alexandra, Toney, Denise, Marathe, Madhav
The pandemic of COVID-19 has imposed tremendous pressure on public health systems and social economic ecosystems over the past years. To alleviate its social impact, it is important to proactively track the prevalence of COVID-19 within communities.
Externí odkaz:
http://arxiv.org/abs/2403.15291
Autor:
Kaur, Gursharn, Sahasrabudhe, Neeraja
We consider interacting urns on a finite directed network, where both sampling and reinforcement processes depend on the nodes of the network. This extends previous research by incorporating node-dependent sampling (preferential or de-preferential) a
Externí odkaz:
http://arxiv.org/abs/2312.02096
We study two fringe subtree counting statistics, the number of cherries and that of pitchforks for Ford's $\alpha$ model, a one-parameter family of random phylogenetic tree models that includes the uniform and the Yule models, two tree models commonl
Externí odkaz:
http://arxiv.org/abs/2110.02850
Publikováno v:
In Journal of Theoretical Biology 7 May 2024 584
Tree shape statistics provide valuable quantitative insights into evolutionary mechanisms underpinning phylogenetic trees, a commonly used graph representation of evolution systems ranging from viruses to species. By developing limit theorems for a v
Externí odkaz:
http://arxiv.org/abs/2101.07488
Autor:
Kaur, Gursharn, Röllin, Adrian
Our main results are quantitative bounds in the multivariate normal approximation of centred subgraph counts in random graphs generated by a general graphon and independent vertex labels. We are interested in these statistics because they are key to
Externí odkaz:
http://arxiv.org/abs/2006.15805
Autor:
Kaur, Gursharn, Sahasrabudhe, Neeraja
We introduce a general two colour interacting urn model on a finite directed graph, where each urn at a node, reinforces all the urns in its out-neighbours according to a fixed, non-negative and balanced reinforcement matrix. We show that the fractio
Externí odkaz:
http://arxiv.org/abs/1905.10738
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Kaur, Gursharn
Publikováno v:
Advances in Applied Mathematics Volume 105, April 2019
We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where $w$ is a non
Externí odkaz:
http://arxiv.org/abs/1808.00796
Autor:
Bandyopadhyay, Antar, Kaur, Gursharn
In this paper, we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the \emph{negatively reinforced} urn
Externí odkaz:
http://arxiv.org/abs/1801.02380