Results 41 to 50 of about 30,403 (170)
Nonconcentration of return times
We show that the distribution of the first return time $\tau$ to the origin, v, of a simple random walk on an infinite recurrent graph is heavy tailed and nonconcentrated.
Gurel-Gurevich, Ori, Nachmias, Asaf
core +1 more source
Bose-Einstein Condensation on inhomogeneous complex networks
The thermodynamic properties of non interacting bosons on a complex network can be strongly affected by topological inhomogeneities. The latter give rise to anomalies in the density of states that can induce Bose-Einstein condensation in low dimensional ...
A Vezzani +21 more
core +1 more source
Dimension and cut vertices: an application of Ramsey theory
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$ is at most $d$
Trotter, William T. +2 more
core +1 more source
This review presents recent progress in vision‐augmented wearable interfaces that combine artificial vision, soft wearable sensors, and exoskeletal robots. Inspired by biological visual systems, these technologies enable multimodal perception and intelligent human–machine interaction.
Jihun Lee +4 more
wiley +1 more source
Bose Einstein condensation on inhomogeneous amenable graphs
We investigate the Bose-Einstein Condensation on nonhomogeneous amenable networks for the model describing arrays of Josephson junctions. The resulting topological model, whose Hamiltonian is the pure hopping one given by the opposite of the adjacency ...
DANIELE GUIDO +5 more
core +1 more source
Embedded CRISPRi Enhances Gene‐Silencing Efficiency in Drosophila
Current CRISPR interference (CRISPRi) technology in Drosophila has limited efficiency. This study introduces the emCRISPRi platform, which significantly enhances transcriptional silencing efficacy by embedding inhibitory domains within the dCas9 architecture.
Pengchong Fu +7 more
wiley +1 more source
Total vertex irregularity strength of comb product of two cycles
Let G = (V (G),E(G)) be a graph and k be a positive integer. A total k-labeling of G is a map f : V (G) ∪ E(G) → {1,2...,k}. The vertex weight v under the labeling f is denoted by Wf(v) and defined by Wf(v) = f(v) + Σuv∈E(G)f(uv). A total k-labeling of G
Ramdani Rismawati, Ramdhani Muhammad Ali
doaj +1 more source
On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is called an edge-antimagic vertex labeling.
Brian Juned Septory +3 more
openaire +1 more source
Study of Free‐Space Optical Quantum Network: Review and Prospectives
Free from the constraints of fiber connections, free‐space quantum network enables longer and more flexible quantum network connections. This review summarizes and comparatively analyzes free‐space quantum network experiments based on ground stations, satellites, and mobile platforms.
Hua‐Ying Liu, Zhenda Xie, Shining Zhu
wiley +1 more source
A-vertex magicness of product of graphs
In this paper, we discuss the A-vertex magicness of some products of graphs, where A is a non-trivial additive Abelian group with identity 0. We characterize A-vertex magicness of the Cartesian product of Pn and Pm, where A has at least three elements ...
S. Balamoorthy
doaj +1 more source

