Graphene quantum dots with improved fluorescence activity via machine learning: Implications for fluorescence monitoring
Q Zhang, Y Tao, B Tang, J Yang, H Liang… - ACS Applied Nano …, 2022 - ACS Publications
Graphene quantum dots (GQDs) have shown great potential in physical–chemical-biological
applications, especially for fluorescence monitoring. However, the low fluorescence activity …
applications, especially for fluorescence monitoring. However, the low fluorescence activity …
The power of two choices for random walks
A Georgakopoulos, J Haslegrave… - Combinatorics …, 2022 - cambridge.org
We apply the power-of-two-choices paradigm to a random walk on a graph: rather than
moving to a uniform random neighbour at each step, a controller is allowed to choose from …
moving to a uniform random neighbour at each step, a controller is allowed to choose from …
Random walks which prefer unvisited edges. exploring high girth even degree expanders in linear time.
P Berenbrink, C Cooper, T Friedetzky - … of the 2012 ACM symposium on …, 2012 - dl.acm.org
In this paper, we consider a modified random walk which uses unvisited edges whenever
possible, and makes a simple random walk otherwise. We call such a walk an edge-process …
possible, and makes a simple random walk otherwise. We call such a walk an edge-process …
Time-Biased Random Walks and Robustness of Expanders
Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms,
derandomization, graph theory, and distributed computing. A desirable property is that they …
derandomization, graph theory, and distributed computing. A desirable property is that they …
Adjacency-Information-Entropy-Based Cooperative Name Resolution Approach in ICN
J Li, J You, H Deng - Future Internet, 2022 - mdpi.com
Information-centric networking (ICN) is an emerging network architecture that has the
potential to address low-transmission latency and high-reliability requirements in the fifth …
potential to address low-transmission latency and high-reliability requirements in the fifth …
The cover time of a biased random walk on a random cubic graph
The cover time of a biased random walk on a random cubic graph arXiv:1801.00760v2 [math.CO]
3 Jan 2018 Page 1 The cover time of a biased random walk on a random cubic graph Colin …
3 Jan 2018 Page 1 The cover time of a biased random walk on a random cubic graph Colin …
Collaborative Storage and Resolution Method between Layers in Hierarchical ICN Name Resolution Systems
Y Li, Y Li - Future Internet, 2023 - mdpi.com
Name resolution system is an important infrastructure in Information Centric Networking
(ICN) network architecture of identifier–locator separation mode. In the Local Name …
(ICN) network architecture of identifier–locator separation mode. In the Local Name …
Vacant sets and vacant nets: Component structures induced by a random walk
Given a discrete random walk on a finite graph G, the vacant set and vacant net are,
respectively, the sets of vertices and edges which remain unvisited by the walk at a given …
respectively, the sets of vertices and edges which remain unvisited by the walk at a given …
Once reinforced random walk on
D Kious, B Schapira, A Singh - Annales de l'Institut Henri Poincare …, 2021 - projecteuclid.org
We revisit Vervoort's unpublished paper (Vervoort (2002)) on the once reinforced random
walk, and prove that this process is recurrent on any graph of the form Z× Γ, with Γ a finite …
walk, and prove that this process is recurrent on any graph of the form Z× Γ, with Γ a finite …
[HTML][HTML] 圈上的多重懒惰随机游走
王彬 - 数学杂志, 2017 - sxzz.whu.edu.cn
圈上的多重懒惰随机游走 数学杂志 2017, Vol. 37 Issue (5): 1081-1086 PDF 扩展功能 加入
收藏夹 复制引文信息 加入引用管理器 Email Alert RSS 本文作者相关文章 王彬 圈上的多重 …
收藏夹 复制引文信息 加入引用管理器 Email Alert RSS 本文作者相关文章 王彬 圈上的多重 …