Wyszukiwarka
Katedra Rachunku Prawdopodobieństwa i Biomatematyki
Publikacje
Filtry
wszystkich: 101
Katalog Publikacji
Rok 2021
-
On asymptotic periodicity of kernel double Markovian operators
PublikacjaIt is proved that a kernel, doubly Markovian operator T is asymptotically periodic if and only if its deterministic σ-field Σd(T)(equivalently Σd(T∗)) is finite. It follows that kernel doubly Markovian operator T is asymptotically periodic if and only if T∗ is asymptotically periodic.
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
Rok 2020
-
A Measurable Selector in Kadison’s Carpenter’s Theorem
PublikacjaWe show the existence of a measurable selector in Carpenter’s Theorem due to Kadison. This solves a problem posed by Jasper and the first author in an earlier work. As an application we obtain a characterization of all possible spectral functions of shift-invariant subspaces of L 2 (R d ) and Carpenter’s Theorem for type I ∞ von Neumann algebras.
-
Association of Genes Related to Oxidative Stress with the Extent of Coronary Atherosclerosis
PublikacjaOxidative stress is believed to play a critical role in atherosclerosis initiation and progression. In line with this, in a group of 1099 subjects, we determined eight single nucleotide polymorphisms (SNPs) related to oxidative stress (PON1 c.575A>G, MPO c.463G>A, SOD2 c.47T>C, GCLM c.590C>T, NOS3 c.894G>T, NOS3 c.786T>C, CYBA c.214C>T, and CYBA c.932A>G) and assessed the extent of atherosclerosis in coronary arteries based on...
-
Certified domination
PublikacjaImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Homoclinics for singular strong force Lagrangian systems
PublikacjaWe study the existence of homoclinic solutions for a class of generalized Lagrangian systems in the plane, with a C1-smooth potential with a single well of infinite depth at a point ξ and a unique strict global maximum 0 at the origin.Under a strong force condition around the singular point ξ, via minimization of an action integral, we will prove the existence of at least two geometrically distinct homoclinic solutions.
-
On the Existence of Homoclinic Type Solutions of a Class of Inhomogenous Second Order Hamiltonian Systems
PublikacjaWe show the existence of homoclinic type solutions of a class of inhomogenous second order Hamiltonian systems, where a C1-smooth potential satisfies a relaxed superquadratic growth condition, its gradient is bounded in the time variable, and a forcing term is sufficiently small in the space of square integrable functions. The idea of our proof is to approximate the original system by time-periodic ones, with larger and larger...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
Rok 2019
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Folate/homocysteine metabolism and lung cancer risk among smokers
PublikacjaBackground: Folate and homocysteine are involved in DNA synthesis and methylation processes, which are deregulated during carcinogenesis. Objectives: The aim of this study was to assess the relationship between folate/homocysteine concentrations, the functional polymorphisms of folate/homocysteine genes and lung cancer risk among cigarette smokers. Study design: The study included 132 lung cancer patients and 396 controls from...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Result of the 6-min walk test is an independent prognostic factor of surgically treated non-small-cell lung cancer
PublikacjaPathological tumour, node and metastasis (TNM) stage remains the most significant prognostic factor of non-small-cell lung cancer (NSCLC). Meanwhile, age, gender, pulmonary function tests, the extent of surgical resection and the presence of concomitant diseases are commonly used to complete the prognostic profile of the patient with early stage of NSCLC. The aim of this study is to assess how the result of a 6-min walk test (6MWT)...
-
Subharmonic solutions for a class of Lagrangian systems
PublikacjaWe prove that second order Hamiltonian systems with a potential of class C1, periodic in time and superquadratic at infinity with respect to the space variable have subharmonic solutions. Our intention is to generalise a result on subharmonics for Hamiltonian systems with a potential satisfying the global Ambrosetti-Rabinowitz condition from [P. H. Rabinowitz, Proc. Roy. Soc. Edinburgh Sect. A, 114 (1990), 33-38]. Indeed, we weaken...
-
The Maslov index and the spectral flow—revisited
PublikacjaWe give an elementary proof of a celebrated theorem of Cappell, Lee and Miller which relates the Maslov index of a pair of paths of Lagrangian subspaces to the spectral flow of an associated path of self-adjoint first-order operators. We particularly pay attention to the continuity of the latter path of operators, where we consider the gap-metric on the set of all closed operators on a Hilbert space. Finally, we obtain from Cappell,...
-
Weak Stability of Centred Quadratic Stochastic Operators
PublikacjaWe consider the weak convergence of iterates of so-called centred quadratic stochastic operators. These iterations allow us to study the discrete time evolution of probability distributions of vector-valued traits in populations of inbreeding or hermaphroditic species, whenever the offspring’s trait is equal to an additively perturbed arithmetic mean of the parents’ traits. It is shown that for the existence of a weak limit, it...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
Rok 2018
-
Bifurcation of equilibrium forms of an elastic rod on a two-parameter Winkler foundation
PublikacjaWe consider two-parameter bifurcation of equilibrium states of an elastic rod on a deformable foundation. Our main theorem shows that bifurcation occurs if and only if the linearization of our problem has nontrivial solutions. In fact our proof, based on the concept of the Brouwer degree, gives more, namely that from each bifurcation point there branches off a continuum of solutions.
-
Comprehensive stabilization of all streams of solid residues formed during sewage sludge thermal treatment – Case study
PublikacjaModern wastewater treatment plants are currently struggling with the problem of processing and ecological management of sewage sludge. Thermal utilization is a frequently used practice of excess sludge utilization especially in large wastewater treatment plants, which seems to be a quite promising concept. However, during thermal treatment, fractions of ashes and dusts are generated. Such wastes, especially the dust fraction, can...
-
Coronas and Domination Subdivision Number of a Graph
PublikacjaIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.