1.1k citations · 1.1k across the 15 of their papers we have counts for
16 papers
Optimizing Connectivity through Network Gradients for Restricted Boltzmann Machines
A. C. N. de Oliveira, D. R. Figueiredo
Leveraging sparse networks to connect successive layers in deep neural networks has recently been shown to provide benefits to large-scale state-of-the-art models. However, network…
A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
Igor Nunes, Giulio Iacobelli, Daniel Ratton Figueiredo
The and are two well-known algorithms to generate uniform spanning trees (USTs) based on random walks. This work studies their relationship while th…
Quantum Walks can Unitarily Represent Random Walks on Finite Graphs
Matheus G. Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time inst…
On the equivalence between quantum and random walks on finite graphs
Matheus G. Andrade, Franklin Marquezino, Daniel R. Figueiredo
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number o…
A Contextual Hierarchical Graph Model for Generating Random Sequences of Objects with Application to Music Playlists
Igor de Oliveira Nunes, Gabriel Matos Cardoso Leite, Daniel Ratton Figueiredo
Recommending the right content in large scale multimedia streaming services is an important and challenging problem that has received much attention in the past decade. A key ingre…
The end time of SIS epidemics driven by random walks on edge-transitive graphs
Daniel Figueiredo, Giulio Iacobelli, Seva Shneer
Network epidemics is a ubiquitous model that can represent different phenomena and finds applications in various domains. Among its various characteristics, a fundamental question…
Transient and Slim versus Recurrent and Fat: Random Walks and the Trees they Grow
Giulio Iacobelli, Daniel R. Figueiredo, Giovanni Neglia
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches,…
Building your path to escape from home
Daniel R. Figueiredo, Giulio Iacobelli, Roberto I. Oliveira +2
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little i…
struc2vec: Learning Node Representations from Structural Identity
Leonardo F. R. Ribeiro, Pedro H. P. Savarese, Daniel R. Figueiredo
Structural identity is a concept of symmetry in which network nodes are identified according to the network structure and their relationship to other nodes. Structural identity has…
On the Emergence of Shortest Paths by Reinforced Random Walks
Daniel R. Figueiredo, Michele Garetto
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of…
Local symmetry in random graphs
Jefferson Elbert Simões, Daniel R. Figueiredo, Valmir C. Barbosa
Quite often real-world networks can be thought of as being symmetric, in the abstract sense that vertices can be found to have similar or equivalent structural roles. However, trad…
On the Duration and Intensity of Competitions in Nonlinear Pólya Urn Processes with Fitness
Bo Jiang, Daniel R. Figueiredo, Bruno Ribeiro +1
Cumulative advantage (CA) refers to the notion that accumulated resources foster the accumulation of further resources in competitions, a phenomenon that has been empirically obser…
Power-law decay of the degree-sequence probabilities of multiple random graphs with application to graph isomorphism
Jefferson Elbert Simões, Daniel R. Figueiredo, Valmir C. Barbosa
We consider events over the probability space generated by the degree sequences of multiple independent Erdős-Rényi random graphs, and consider an approximation probability space w…
On the duration and intensity of cumulative advantage competitions
Bo Jiang, Liyuan Sun, Daniel R. Figueiredo +2
The role of skill (fitness) and luck (randomness) as driving forces on the dynamics of resource accumulation in a myriad of systems have long puzzled scientists. Fueled by undisput…
Characterizing Continuous Time Random Walks on Time Varying Graphs
Daniel Figueiredo, Philippe Nain, Bruno Ribeiro +2
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is…
Heterogeneous download times in a homogeneous BitTorrent swarm
Fabricio Murai, Antonio A de A Rocha, Daniel R. Figueiredo +1
Modeling and understanding BitTorrent (BT) dynamics is a recurrent research topic mainly due to its high complexity and tremendous practical efficiency. Over the years, different m…