40 citations · 120 across the 18 of their papers we have counts for
12 papers · 1 filter
Scale-free Segregation in Transport Networks
Ph. Blanchard, D. Volchenkov
Every route of a transport network approaching equilibrium can be represented by a vector of Euclidean space which length quantifies its segregation from the rest of the graph. We…
Transport Networks Revisited: Why Dual Graphs?
D. Volchenkov, Ph. Blanchard
Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movemen…
Magnetohydrodynamics In The Context Of Nelson's Stochastic Mechanics
D. Volchenkov, R. Lima
A simple generalization of the MHD model accounting for the fluctuations of the configurations due to kinetic effects in plasmas in short times small scales is considered. The velo…
Markov Chain Methods For Analyzing Complex Transport Networks
D. Volchenkov, Ph. Blanchard
We have developed a steady state theory of complex transport networks used to model the flow of commodity, information, viruses, opinions, or traffic. Our approach is based on the…
Ghetto of Venice: Access to the Target Node and the Random Target Access Time
D. Volchenkov, Ph. Blanchard
Random walks defined on undirected graphs assign the absolute scores to all nodes based on the quality of path they provide for random walkers. In city space syntax, the notion of…
Sestieri of Venice
D. Volchenkov, Ph. Blanchard
We have investigated space syntax of Venice by means of random walks. Random walks being defined on an undirected graph establish the Euclidean space in which distances and angles…