搜索结果: 31-45 共查到“理学 graphs”相关记录299条 . 查询时间(0.109 秒)
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES
Sequential sampling algorithms the random graph degree
font style='font-size:12px;'>
2015/7/8
A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES。
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE
Random graph sequence
font style='font-size:12px;'>
2015/7/7
RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE。
Dissipation Inequalities for Distributed Systems on Graphs
Graphs Distributed Systems
font style='font-size:12px;'>
2015/6/19
This paper considers linear dynamic systems with an interconnection structure specified by a directed graph. We formulate linear matrix inequalities for computation of performance of the system based ...
Control of Distributed Discrete-Time Systems on Graphs
Graphs Discrete-Time Systems
font style='font-size:12px;'>
2015/6/19
This paper considers linear time-invariant dynamic systems with an interconnection structure specified by a directed graph. We formulate a semidefinite program for system analysis and controller synth...
SPECTRUM OF THE 1-LAPLACIAN AND CHEEGER'S CONSTANT ON GRAPHS
THE 1-LAPLACIAN GRAPHS
font style='font-size:12px;'>
2014/9/26
We develop a nonlinear spectral graph theory, in which the Laplace
operator is replaced by the 1 Laplacian ∆1
. The eigenvalue problem is to
solve a nonlinear system, involving a set valued f...
Assortativity and clustering of sparse random intersection graphs
assortativity clustering power law random graph random intersection graph 2010 Mathematics Subject Classifications 05C80 05C82 91D30
font style='font-size:12px;'>
2012/11/23
We consider sparse random intersection graphs with the property that the clustering coefficient does not vanish as the number of nodes tends to infinity. We find explicit asymptotic expressions for th...
Higher connectivity of fiber graphs of Grobner bases
Higher connectivity fiber graphs Grobner bases
font style='font-size:12px;'>
2012/11/23
Fiber graphs of Gr\"obner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings algorithm. The con...
Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs
Sparse graphical model Reversible Markovchain Markov equivalence class.
font style='font-size:12px;'>
2012/11/23
Graphical models are popular statistical tools which are used to represent dependent or causal complex systems. Statistically equivalent causal or directed graphical models are said to belong to a Mar...
Link Prediction in Graphs with Autoregressive Features
Autoregressive Features Link Prediction Graphs
font style='font-size:12px;'>
2012/11/22
In the paper, we consider the problem of link prediction in time-evolving graphs. We assume that certain graph features, such as the node degree, follow a vector autoregressive (VAR) model and we prop...
Fitting directed acyclic graphs with latent nodes as finite mixtures models, with application to education transmission
Extendedlatentclassmodels mixturemodels structuralequations causal inference
font style='font-size:12px;'>
2012/11/22
This paper describes an efficient EM algorithm for maximum likelihood estimation of a system of nonlinear structural equations corresponding to a directed acyclic graph model that can contain an arbit...
Combined degree and connectivity conditions for H-linked graphs
Combined degree connectivity conditions H-linked graphs Combinatorics
font style='font-size:12px;'>
2012/6/27
For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv i...
Constructing graphs with no immersion of large complete graphs
Graph immersion minimum degree chromatic number edgeconnectivity Hajos Conjecture Hadwiger Conjecture graph minor
font style='font-size:12px;'>
2012/6/29
In 1989, Lescure and Meyniel proved, for $d=5, 6$, that every $d$-chromatic graph contains an immersion of $K_d$, and in 2003 Abu-Khzam and Langston conjectured that this holds for all $d$. In 2010, D...
Hodge-de Rham Theory on Fractal Graphs and Fractals
Analysis on fractals Sierpinski gasket Hodge-deRham theory k-forms harmonic 1-forms fractal graphs
font style='font-size:12px;'>
2012/6/25
We present a new approach to the theory of k-forms on self-similar fractals. We work out the details for two examples, the standard Sierpinski gasket and the 3-dimensional Sierpinski gasket, but the m...
Coloring claw-free graphs with Δ-1 colors
Coloring claw-free graphs Combinatorics
font style='font-size:12px;'>
2012/6/25
We prove that every claw-free graph $G$ that doesn't contain a clique on $\Delta(G) \geq 9$ vertices can be $\Delta(G) - 1$ colored.
A Mermin--Wagner theorem for quantum Gibbs states on 2D graphs, I
quantum bosonic system with continuous spins symmetry group the Feynman–Kac representation bi-dimensional graphs Gibbs states
font style='font-size:12px;'>
2012/6/25
This is the the first of a series of papers considering properties of quantum systems over 2D graphs or manifolds, with continuous spins. In the model considered here the phase space of a single spin ...