Results 121 to 130 of about 79,461 (254)
Cryptocurrency Bubbles and Costly Mining
ABSTRACT This paper develops a model of a cryptocurrency by incorporating mining into the otherwise standard search‐theoretic monetary framework. As usual, multiple equilibria exist. To obtain a sharp prediction on whether a cryptocurrency' s value will last in the future, I propose a notion of equilibrium refinement based on the feature that mining ...
Kohei Iwasaki
wiley +1 more source
Constructing Connectome Atlas by Graph Laplacian Learning. [PDF]
Kim M +5 more
europepmc +1 more source
A Construction of Cospectral Graphs for the Normalized Laplacian [PDF]
Steve Butler, Jason Grout
openalex +1 more source
Laplacian {−1,0,1}- and {−1,1}-diagonalizable graphs
A graph is called "Laplacian integral" if the eigenvalues of its Laplacian matrix are all integers. We investigate the subset of these graphs whose Laplacian is furthermore diagonalized by a matrix with entries coming from a fixed set, in particular, the sets $\{-1,0,1\}$ or $\{-1,1\}$.
Nathaniel Johnston, Sarah Plosker
openaire +3 more sources
On Metric Choice in Dimension Reduction for Fréchet Regression
Summary Fréchet regression is becoming a mainstay in modern data analysis for analysing non‐traditional data types belonging to general metric spaces. This novel regression method is especially useful in the analysis of complex health data such as continuous monitoring and imaging data.
Abdul‐Nasah Soale +3 more
wiley +1 more source
The Laplacian Spread of a Tree
The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph.
Yi-Zheng Fan +3 more
doaj
Combining non-negative matrix factorization with graph Laplacian regularization for predicting drug-miRNA associations based on multi-source information fusion. [PDF]
Wang MN, Li Y, Lei LL, Ding DW, Xie XJ.
europepmc +1 more source
A hybrid RANS‐LES turbulence model adapted for the Moving Particle Semi‐implicit method is employed to investigate a turbulent free surface flow. A method based on the cell‐linked list is proposed to speed up the nearest wall search for the turbulence model.
Fabio Kenji Motezuki +3 more
wiley +1 more source
A truncated nuclear norm and graph-Laplacian regularized low-rank representation method for tumor clustering and gene selection. [PDF]
Liu Q.
europepmc +1 more source
Laplacian controllable graphs based on connecting two antiregular graphs [PDF]
Shun‐Pin Hsu, Ping‐Yen Yang
openalex +1 more source

