Results 151 to 160 of about 63,637 (247)
ABSTRACT Introduction Depersonalization and derealization disorder (DPDR) is a debilitating condition. To date, little was known about the role of personality structure and of perceived social support and loneliness in DPDR. Methods Three studies investigated, respectively: (i) broadband personality traits (five‐factor model), maladaptive trait domains
Emanuele Fino+6 more
wiley +1 more source
On maximum spectral radius of {H (3, 3), H (4, 3)}-free graphs [PDF]
Amir Rehman, Shariefuddin Pirzada
doaj +1 more source
Road traffic estimation and algorithmic routing in a spatially dependent network
ABSTRACT This work concerns a procedure to estimate the joint distribution of the per‐edge travel times in a road traffic network with spatial dependence. The constructed estimator, based on the realized travel times of a collection of independently operating probe vehicles traversing the network, is shown to be consistent and rate‐optimal.
Rens Kamphuis+2 more
wiley +1 more source
Identifying HIV-induced subgraph patterns in brain networks with side information. [PDF]
Cao B, Kong X, Zhang J, Yu PS, Ragin AB.
europepmc +1 more source
Clustering of tag-induced subgraphs in complex networks [PDF]
Péter Pollner+2 more
openalex +1 more source
Profinite rigidity for free‐by‐cyclic groups with centre
Abstract A free‐by‐cyclic group FN⋊ϕZ$F_N\rtimes _\phi \mathbb {Z}$ has non‐trivial centre if and only if [ϕ]$[\phi]$ has finite order in Out(FN)${\rm {Out}}(F_N)$. We establish a profinite rigidity result for such groups: if Γ1$\Gamma _1$ is a free‐by‐cyclic group with non‐trivial centre and Γ2$\Gamma _2$ is a finitely generated free‐by‐cyclic group ...
Martin R. Bridson, Paweł Piwek
wiley +1 more source
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs
David S. Gunderson, V. Rödl, N. Sauer
openalex +1 more source
Hausdorff dimensions of irreducible Markov hom tree‐shifts
Abstract This paper features a Cramér's theorem for finite‐state Markov chains indexed by rooted d$d$‐trees, obtained via the method of types in the classical analysis of large deviations. Along with the theorem comes two applications: an almost‐sure type convergence of sample means and a formula for the Hausdorff dimension of the symbolic space ...
Jung‐Chao Ban+2 more
wiley +1 more source
The graph grabbing game on {0,1}-weighted graphs
The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj
On profinite rigidity amongst free‐by‐cyclic groups I: The generic case
Abstract We prove that amongst the class of free‐by‐cyclic groups, Gromov hyperbolicity is an invariant of the profinite completion. We show that whenever G$G$ is a free‐by‐cyclic group with first Betti number equal to one, and H$H$ is a free‐by‐cyclic group which is profinitely isomorphic to G$G$, the ranks of the fibres and the characteristic ...
Sam Hughes, Monika Kudlinska
wiley +1 more source