248 results on '"Vincent D. Blondel"'
Search Results
2. Partition-Merge: Distributed Inference and Modularity Optimization.
3. A Place-Focused Model for Social Networks in Cities.
4. On primitivity of sets of matrices.
5. On the cost of deciding consensus.
6. PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation.
7. Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices.
8. Explicit solutions for root optimization of a polynomial family.
9. Opinion dynamics for agents with opinion-dependent connections.
10. On primitivity of sets of matrices.
11. Sensitivity analysis of a branching process evolving on a network with application in epidemiology.
12. Scaling Behaviors in the Communication Network between Cities.
13. Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices.
14. Social Leaders in Graphs.
15. Convergence in Multiagent Coordination, Consensus, and Flocking.
16. Rigidity and Persistence of Directed Graphs.
17. Approximations of the Rate of Growth of Switched Linear Systems.
18. A simultaneous stabilization approach to (passive) fault tolerant control.
19. Computational Universality in Symbolic Dynamical Systems.
20. PageRank optimization by edge selection.
21. How to Decide Consensus? A Combinatorial Necessary and Sufficient Condition and a Proof that Consensus is Decidable but NP-Hard.
22. Urban Sensing Using Mobile Phone Network Data: A Survey of Research.
23. Similarity Matrices for Pairs of Graphs.
24. How hard is it to control switched systems?
25. An experimental study of approximation algorithms for the joint spectral radius.
26. On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations.
27. Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint.
28. The Stability of Saturated Linear Dynamical Systems Is Undecidable.
29. Bilinear Functions and Trees over the (max, +) Semiring.
30. Fast computation of minimal elementary decompositions of metabolic flux vectors.
31. Observable graphs.
32. The set of realizations of a max-plus linear sequence is semi-polyhedral.
33. Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications.
34. Joint Spectral Characteristics of Matrices: A Conic Programming Approach.
35. The continuous Skolem-Pisot problem.
36. On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity.
37. Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices.
38. On the number of alpha-power-free binary words for 2alpha<=7/3.
39. Overlap-free words and spectra of matrices.
40. Formation Reorganization by Primitive Operations on Directed Graphs.
41. Clean up or mess up: the effect of sampling biases on measurements of degree distributions in mobile phone datasets.
42. Three and higher dimensional autonomous formations: Rigidity, persistence and structural persistence.
43. On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns.
44. Decidability and Universality in Symbolic Dynamical Systems.
45. Complexity of control on finite automata.
46. Computationally Efficient Approximations of the Joint Spectral Radius.
47. Decidable and Undecidable Problems about Quantum Automata.
48. Modelling Influence and Opinion Evolution in Online Collective Behaviour.
49. Fault tolerant control: a simultaneous stabilization result.
50. A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.