Results 31 to 40 of about 1,396,823 (294)
Confinement/deconfinement transition in the D0-brane matrix model — A signature of M-theory?
We study the confinement/deconfinement transition in the D0-brane matrix model (often called the BFSS matrix model) and its one-parameter deformation (the BMN matrix model) numerically by lattice Monte Carlo simulations.
Monte Carlo String/M-theory collaboration (MCSMC)+8 more
doaj +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah+2 more
doaj +1 more source
Sign determinacy of M-matrix minors
AbstractWe show that if A is an M-matrix for which the length of the longest simple cycle in its associated undirected graph G(A) is at most 3, then every minor of A has determined sign (nonnegative or nonpositive), independent of the magnitudes of the matrix entries.
Dale D. Olesky+3 more
openaire +2 more sources
This study examines the demographic dynamics of two seabird populations on Tromelin Island, 15 years after the eradication of brown rats. The results indicate that these populations are in good health and are expected to continue growing until breeding sites are saturated in about a century.
Merlène Saunier+6 more
wiley +1 more source
Network topology drives population temporal variability in experimental habitat networks
Habitat patches connected by dispersal pathways form habitat networks. We explored how network topology affects population outcomes in laboratory experiments using a model species (Daphnia carinata). Central habitat nodes in complex lattice networks exhibited lower temporal variability in population sizes, suggesting they support more stable ...
Yiwen Xu+3 more
wiley +1 more source
On regular splittings of an M-matrix
AbstractLet A = M − N ∈ Rn be a splitting. We call it a regular splitting if M-1⩾0 and N⩾0. In this paper, we answer Questions 5.1 and 5.4, and we generalize Theorem 4.5, of Schneider [Linear Algebra Appl. 58:407–429 (1984)].
openaire +2 more sources
occumb: An R package for site occupancy modeling of eDNA metabarcoding data
This study introduces a new R package, occumb, for the convenient application of site occupancy modeling using environmental DNA (eDNA) metabarcoding data. We outline a data analysis workflow, including data setup, model fitting, model assessment, and comparison of potential study settings based on model predictions, all of which can be performed using
Keiichi Fukaya, Yuta Hasebe
wiley +1 more source
Several new inequalities for the minimum eigenvalue of M-matrices
Several convergent sequences of the lower bounds for the minimum eigenvalue of M-matrices are given. It is proved that these sequences are monotone increasing and improve some existing results.
Jianxing Zhao, Caili Sang
doaj +1 more source
AbstractOne aspect of the inverse M-matrix problem can be posed as follows. Given a positive n × n matrix A=(aij) which has been scaled to have unit diagonal elements and off-diagonal elements which satisfy 0 < y ⩽ aij ⩽ x < 1, what additional element conditions will guarantee that the inverse of A exists and is an M-matrix?
openaire +2 more sources
The symmetric inverse M-matrix completion problem
AbstractNecessary and sufficient conditions are given on the data for completability of a partial symmetric inverse M-matrix, the graph of whose specified entries is a cycle, and these conditions coincide with those we identify to be necessary in the general (nonsymmetric) case.
Charles R. Johnson, Ronald L. Smith
openaire +2 more sources