Results 1 to 10 of about 44,866 (226)

Entropic No-Disturbance as a Physical Principle

, 2018
The celebrated Bell-Kochen-Specker no-go theorem asserts that quantum mechanics does not present the property of realism, the essence of the theorem is the lack of a joint probability distributions for some experiment settings.
Guo, Guang-Can, Jia, Zhih-Ahn, Wu, Yu-Chun, Yu, Bai-Chu, Zhai, Rui   +4 more
core   +1 more source

A notion of graph likelihood and an infinite monkey theorem

, 2013
We play with a graph-theoretic analogue of the folklore infinite monkey theorem. We define a notion of graph likelihood as the probability that a given graph is constructed by a monkey in a number of time steps equal to the number of vertices. We present
Banerji, Christopher R. S., Mansour, Toufik, Severini, Simone   +2 more
core   +2 more sources

Streaming Graph Challenge: Stochastic Block Partition

, 2017
An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem.
Gadepally, Vijay, Hurley, Michael, Jones, Michael, Kao, Edward, Kepner, Jeremy, Mohindra, Sanjeev, Monticciolo, Paul, Reuther, Albert, Samsi, Siddharth, Smith, Steven, Song, William, Staheli, Diane   +11 more
core   +1 more source

Discussion: Latent variable graphical model selection via convex optimization

, 2012
Discussion of "Latent variable graphical model selection via convex optimization" by Venkat Chandrasekaran, Pablo A. Parrilo and Alan S. Willsky [arXiv:1008.1290].Comment: Published in at http://dx.doi.org/10.1214/12-AOS981 the Annals of Statistics ...
Wainwright, Martin J.
core   +1 more source

Low-Density Code-Domain NOMA: Better Be Regular

, 2017
A closed-form analytical expression is derived for the limiting empirical squared singular value density of a spreading (signature) matrix corresponding to sparse low-density code-domain (LDCD) non-orthogonal multiple-access (NOMA) with regular random ...
Shamai, Shlomo, Shental, Ori, Zaidel, Benjamin M.   +2 more
core   +1 more source

A semidefinite program for unbalanced multisection in the stochastic block model

, 2016
We propose a semidefinite programming (SDP) algorithm for community detection in the stochastic block model, a popular model for networks with latent community structure.
Perry, Amelia, Wein, Alexander S.
core   +1 more source

On directed information theory and Granger causality graphs

, 2010
Directed information theory deals with communication channels with feedback. When applied to networks, a natural extension based on causal conditioning is needed.
A Kaiser, A Kraskov, AK Seth, AK Seth, CWJ Granger, CWJ Granger, D Brillinger, EL Lehmann, F Bach, H Marko, J Beirlant, J Cover, J Geweke, J Pearl, J Rissanen, J Whittaker, JD Victor, K Hlavackova-Schindlera, L Barnett, L Paninski, LF Kozachenko, M Eichler, M Eichler, M Kaminski, M Lungarella, M Palus, MS Pinsker, NN Leonenko, O Sporns, OJJ Michel, Olivier J. J. Michel, Pierre-Olivier Amblard, Q Wang, R Dahlaus, R Dahlaus, R Dahlaus, R Venkataramanan, RM Gray, RM Gray, S Achard, S Frenzel, S Lauritzen, S Tatikonda, T Schreiber, Y Saito   +44 more
core   +3 more sources

Limitations of Quantum Coset States for Graph Isomorphism

, 2005
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the resulting algorithms
Hallgren, Sean, Roetteler, Martin, Sen, Pranab   +2 more
core  

Detection of brain network abnormalities by graph invariants in Alzheimer's disease using MRI images. [PDF]

Sci Rep
NallappaBhavithran G, Selvakumar R.
europepmc   +1 more source

A fuzzy graph theoretic approach to face shape recognition using cubic outerplanar structures. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc   +1 more source